./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 b5317dae 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-?-b5317da-m [2023-02-16 03:35:55,608 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:35:55,610 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:35:55,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:35:55,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:35:55,631 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:35:55,632 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:35:55,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:35:55,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:35:55,634 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:35:55,635 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:35:55,636 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:35:55,636 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:35:55,641 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:35:55,641 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:35:55,642 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:35:55,643 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:35:55,643 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:35:55,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:35:55,650 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:35:55,652 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:35:55,655 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:35:55,657 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:35:55,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:35:55,664 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:35:55,664 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:35:55,664 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:35:55,665 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:35:55,666 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:35:55,668 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:35:55,668 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:35:55,669 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:35:55,670 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:35:55,671 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:35:55,672 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:35:55,672 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:35:55,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:35:55,673 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:35:55,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:35:55,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:35:55,674 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:35:55,675 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-16 03:35:55,697 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:35:55,699 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:35:55,699 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:35:55,699 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:35:55,700 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:35:55,700 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:35:55,702 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:35:55,702 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:35:55,702 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:35:55,702 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:35:55,703 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:35:55,703 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:35:55,703 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:35:55,703 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:35:55,703 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:35:55,703 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:35:55,703 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:35:55,704 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:35:55,704 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:35:55,704 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:35:55,704 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:35:55,704 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:35:55,704 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:35:55,705 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:35:55,705 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:35:55,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:35:55,705 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:35:55,705 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:35:55,705 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:35:55,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:35:55,706 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:35:55,706 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:35:55,706 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:35:55,706 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:35:55,706 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-02-16 03:35:55,871 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:35:55,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:35:55,889 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:35:55,890 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:35:55,890 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:35:55,891 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 [2023-02-16 03:35:57,009 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:35:57,202 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:35:57,203 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-queue-1.i [2023-02-16 03:35:57,212 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56dc55200/225195e22ca247c99c83bf67ea077def/FLAG18ef2fd57 [2023-02-16 03:35:57,222 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56dc55200/225195e22ca247c99c83bf67ea077def [2023-02-16 03:35:57,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:35:57,225 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:35:57,226 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:35:57,226 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:35:57,243 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:35:57,244 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:35:57" (1/1) ... [2023-02-16 03:35:57,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ce17689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:57, skipping insertion in model container [2023-02-16 03:35:57,247 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:35:57" (1/1) ... [2023-02-16 03:35:57,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:35:57,294 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:35:57,559 WARN L237 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] [2023-02-16 03:35:57,563 WARN L237 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] [2023-02-16 03:35:57,564 WARN L237 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] [2023-02-16 03:35:57,566 WARN L237 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] [2023-02-16 03:35:57,567 WARN L237 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] [2023-02-16 03:35:57,568 WARN L237 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] [2023-02-16 03:35:57,569 WARN L237 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] [2023-02-16 03:35:57,570 WARN L237 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] [2023-02-16 03:35:57,571 WARN L237 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] [2023-02-16 03:35:57,572 WARN L237 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] [2023-02-16 03:35:57,573 WARN L237 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] [2023-02-16 03:35:57,574 WARN L237 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] [2023-02-16 03:35:57,576 WARN L237 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] [2023-02-16 03:35:57,578 WARN L237 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] [2023-02-16 03:35:57,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:35:57,591 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:35:57,620 WARN L237 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] [2023-02-16 03:35:57,626 WARN L237 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] [2023-02-16 03:35:57,627 WARN L237 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] [2023-02-16 03:35:57,628 WARN L237 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] [2023-02-16 03:35:57,630 WARN L237 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] [2023-02-16 03:35:57,631 WARN L237 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] [2023-02-16 03:35:57,633 WARN L237 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] [2023-02-16 03:35:57,635 WARN L237 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] [2023-02-16 03:35:57,636 WARN L237 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] [2023-02-16 03:35:57,637 WARN L237 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] [2023-02-16 03:35:57,637 WARN L237 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] [2023-02-16 03:35:57,638 WARN L237 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] [2023-02-16 03:35:57,638 WARN L237 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] [2023-02-16 03:35:57,639 WARN L237 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] [2023-02-16 03:35:57,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:35:57,658 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:35:57,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:57 WrapperNode [2023-02-16 03:35:57,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:35:57,660 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:35:57,660 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:35:57,660 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:35:57,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:57" (1/1) ... [2023-02-16 03:35:57,674 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:57" (1/1) ... [2023-02-16 03:35:57,691 INFO L138 Inliner]: procedures = 119, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 222 [2023-02-16 03:35:57,691 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:35:57,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:35:57,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:35:57,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:35:57,700 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:57" (1/1) ... [2023-02-16 03:35:57,700 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:57" (1/1) ... [2023-02-16 03:35:57,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:57" (1/1) ... [2023-02-16 03:35:57,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:57" (1/1) ... [2023-02-16 03:35:57,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:57" (1/1) ... [2023-02-16 03:35:57,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:57" (1/1) ... [2023-02-16 03:35:57,715 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:57" (1/1) ... [2023-02-16 03:35:57,716 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:57" (1/1) ... [2023-02-16 03:35:57,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:35:57,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:35:57,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:35:57,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:35:57,719 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:57" (1/1) ... [2023-02-16 03:35:57,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:35:57,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:35:57,743 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) [2023-02-16 03:35:57,749 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 [2023-02-16 03:35:57,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 03:35:57,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 03:35:57,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:35:57,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:35:57,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:35:57,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:35:57,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:35:57,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 03:35:57,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:35:57,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:35:57,841 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:35:57,843 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:35:58,168 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:35:58,173 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:35:58,174 INFO L300 CfgBuilder]: Removed 31 assume(true) statements. [2023-02-16 03:35:58,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:35:58 BoogieIcfgContainer [2023-02-16 03:35:58,175 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:35:58,176 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:35:58,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:35:58,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:35:58,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:35:57" (1/3) ... [2023-02-16 03:35:58,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54497a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:35:58, skipping insertion in model container [2023-02-16 03:35:58,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:57" (2/3) ... [2023-02-16 03:35:58,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54497a39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:35:58, skipping insertion in model container [2023-02-16 03:35:58,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:35:58" (3/3) ... [2023-02-16 03:35:58,187 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-queue-1.i [2023-02-16 03:35:58,199 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:35:58,200 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2023-02-16 03:35:58,255 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:35:58,265 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5a6177f9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:35:58,266 INFO L358 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2023-02-16 03:35:58,271 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) [2023-02-16 03:35:58,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-16 03:35:58,276 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:58,277 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-16 03:35:58,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)] === [2023-02-16 03:35:58,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:58,285 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-16 03:35:58,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:58,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959771709] [2023-02-16 03:35:58,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:58,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:58,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:58,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:58,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959771709] [2023-02-16 03:35:58,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959771709] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:58,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:58,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:35:58,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940114175] [2023-02-16 03:35:58,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:58,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:35:58,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:58,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:35:58,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:35:58,477 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) [2023-02-16 03:35:58,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:58,585 INFO L93 Difference]: Finished difference Result 169 states and 179 transitions. [2023-02-16 03:35:58,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:35:58,587 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 [2023-02-16 03:35:58,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:58,593 INFO L225 Difference]: With dead ends: 169 [2023-02-16 03:35:58,594 INFO L226 Difference]: Without dead ends: 165 [2023-02-16 03:35:58,595 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 [2023-02-16 03:35:58,597 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 [2023-02-16 03:35:58,598 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] [2023-02-16 03:35:58,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-16 03:35:58,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 161. [2023-02-16 03:35:58,623 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) [2023-02-16 03:35:58,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 173 transitions. [2023-02-16 03:35:58,625 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 173 transitions. Word has length 3 [2023-02-16 03:35:58,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:58,626 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 173 transitions. [2023-02-16 03:35:58,626 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) [2023-02-16 03:35:58,626 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 173 transitions. [2023-02-16 03:35:58,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-16 03:35:58,627 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:58,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-16 03:35:58,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 03:35:58,628 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)] === [2023-02-16 03:35:58,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:58,628 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-16 03:35:58,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:58,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497424081] [2023-02-16 03:35:58,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:58,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:58,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:58,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:58,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497424081] [2023-02-16 03:35:58,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497424081] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:58,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:58,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:35:58,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189994380] [2023-02-16 03:35:58,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:58,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:35:58,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:58,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:35:58,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:35:58,706 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) [2023-02-16 03:35:58,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:58,773 INFO L93 Difference]: Finished difference Result 155 states and 165 transitions. [2023-02-16 03:35:58,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:35:58,773 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 [2023-02-16 03:35:58,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:58,774 INFO L225 Difference]: With dead ends: 155 [2023-02-16 03:35:58,775 INFO L226 Difference]: Without dead ends: 155 [2023-02-16 03:35:58,775 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 [2023-02-16 03:35:58,776 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 147 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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 [2023-02-16 03:35:58,776 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] [2023-02-16 03:35:58,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-02-16 03:35:58,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2023-02-16 03:35:58,781 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) [2023-02-16 03:35:58,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 162 transitions. [2023-02-16 03:35:58,782 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 162 transitions. Word has length 3 [2023-02-16 03:35:58,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:58,782 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 162 transitions. [2023-02-16 03:35:58,782 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) [2023-02-16 03:35:58,782 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 162 transitions. [2023-02-16 03:35:58,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-16 03:35:58,783 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:58,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:58,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 03:35:58,783 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)] === [2023-02-16 03:35:58,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:58,784 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2023-02-16 03:35:58,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:58,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337741303] [2023-02-16 03:35:58,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:58,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:58,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:58,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:58,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337741303] [2023-02-16 03:35:58,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337741303] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:58,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:58,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:35:58,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396952893] [2023-02-16 03:35:58,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:58,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:35:58,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:58,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:35:58,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:35:58,936 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) [2023-02-16 03:35:59,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:59,082 INFO L93 Difference]: Finished difference Result 161 states and 171 transitions. [2023-02-16 03:35:59,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:35:59,083 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 [2023-02-16 03:35:59,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:59,084 INFO L225 Difference]: With dead ends: 161 [2023-02-16 03:35:59,084 INFO L226 Difference]: Without dead ends: 161 [2023-02-16 03:35:59,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:35:59,085 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 [2023-02-16 03:35:59,085 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] [2023-02-16 03:35:59,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2023-02-16 03:35:59,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2023-02-16 03:35:59,090 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) [2023-02-16 03:35:59,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 168 transitions. [2023-02-16 03:35:59,091 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 168 transitions. Word has length 8 [2023-02-16 03:35:59,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:59,091 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 168 transitions. [2023-02-16 03:35:59,091 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) [2023-02-16 03:35:59,092 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 168 transitions. [2023-02-16 03:35:59,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-16 03:35:59,092 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:59,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:59,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 03:35:59,093 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)] === [2023-02-16 03:35:59,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:59,095 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2023-02-16 03:35:59,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:59,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443855427] [2023-02-16 03:35:59,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:59,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:59,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:59,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:59,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443855427] [2023-02-16 03:35:59,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443855427] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:59,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:59,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:35:59,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006478980] [2023-02-16 03:35:59,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:59,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:35:59,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:59,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:35:59,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:35:59,253 INFO L87 Difference]: Start difference. First operand 153 states and 168 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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) [2023-02-16 03:35:59,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:59,487 INFO L93 Difference]: Finished difference Result 244 states and 260 transitions. [2023-02-16 03:35:59,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:35:59,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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 [2023-02-16 03:35:59,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:59,489 INFO L225 Difference]: With dead ends: 244 [2023-02-16 03:35:59,489 INFO L226 Difference]: Without dead ends: 244 [2023-02-16 03:35:59,489 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:35:59,490 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 318 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:59,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 241 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:35:59,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-02-16 03:35:59,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 158. [2023-02-16 03:35:59,495 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) [2023-02-16 03:35:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 173 transitions. [2023-02-16 03:35:59,496 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 173 transitions. Word has length 8 [2023-02-16 03:35:59,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:59,496 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 173 transitions. [2023-02-16 03:35:59,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 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) [2023-02-16 03:35:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 173 transitions. [2023-02-16 03:35:59,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-16 03:35:59,497 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:59,497 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:59,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 03:35:59,497 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)] === [2023-02-16 03:35:59,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:59,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1837174119, now seen corresponding path program 1 times [2023-02-16 03:35:59,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:59,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376932842] [2023-02-16 03:35:59,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:59,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:59,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:59,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:59,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376932842] [2023-02-16 03:35:59,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376932842] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:59,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:59,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:35:59,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715221179] [2023-02-16 03:35:59,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:59,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:35:59,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:59,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:35:59,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:35:59,523 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) [2023-02-16 03:35:59,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:59,546 INFO L93 Difference]: Finished difference Result 148 states and 162 transitions. [2023-02-16 03:35:59,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:35:59,546 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 [2023-02-16 03:35:59,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:59,547 INFO L225 Difference]: With dead ends: 148 [2023-02-16 03:35:59,547 INFO L226 Difference]: Without dead ends: 148 [2023-02-16 03:35:59,547 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 [2023-02-16 03:35:59,548 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 [2023-02-16 03:35:59,548 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] [2023-02-16 03:35:59,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-02-16 03:35:59,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2023-02-16 03:35:59,552 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) [2023-02-16 03:35:59,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 162 transitions. [2023-02-16 03:35:59,552 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 162 transitions. Word has length 9 [2023-02-16 03:35:59,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:59,553 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 162 transitions. [2023-02-16 03:35:59,553 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) [2023-02-16 03:35:59,553 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 162 transitions. [2023-02-16 03:35:59,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-16 03:35:59,553 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:59,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:59,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 03:35:59,554 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)] === [2023-02-16 03:35:59,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:59,554 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2023-02-16 03:35:59,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:59,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282785407] [2023-02-16 03:35:59,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:59,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:59,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:59,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:59,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282785407] [2023-02-16 03:35:59,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282785407] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:59,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:59,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:35:59,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562844687] [2023-02-16 03:35:59,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:59,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:35:59,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:59,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:35:59,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:35:59,633 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) [2023-02-16 03:35:59,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:59,822 INFO L93 Difference]: Finished difference Result 219 states and 234 transitions. [2023-02-16 03:35:59,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:35:59,823 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 [2023-02-16 03:35:59,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:59,824 INFO L225 Difference]: With dead ends: 219 [2023-02-16 03:35:59,824 INFO L226 Difference]: Without dead ends: 219 [2023-02-16 03:35:59,824 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 [2023-02-16 03:35:59,825 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 [2023-02-16 03:35:59,825 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] [2023-02-16 03:35:59,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-02-16 03:35:59,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 147. [2023-02-16 03:35:59,828 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) [2023-02-16 03:35:59,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2023-02-16 03:35:59,829 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 12 [2023-02-16 03:35:59,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:59,829 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2023-02-16 03:35:59,830 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) [2023-02-16 03:35:59,830 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2023-02-16 03:35:59,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-16 03:35:59,830 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:59,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:59,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-16 03:35:59,831 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)] === [2023-02-16 03:35:59,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:59,831 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2023-02-16 03:35:59,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:59,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681781050] [2023-02-16 03:35:59,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:59,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:59,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:59,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:59,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:59,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681781050] [2023-02-16 03:35:59,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681781050] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:59,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:59,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:35:59,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107732293] [2023-02-16 03:35:59,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:59,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:35:59,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:59,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:35:59,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:35:59,945 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) [2023-02-16 03:36:00,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:36:00,205 INFO L93 Difference]: Finished difference Result 211 states and 228 transitions. [2023-02-16 03:36:00,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:36:00,205 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 [2023-02-16 03:36:00,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:36:00,206 INFO L225 Difference]: With dead ends: 211 [2023-02-16 03:36:00,206 INFO L226 Difference]: Without dead ends: 211 [2023-02-16 03:36:00,207 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 [2023-02-16 03:36:00,207 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 [2023-02-16 03:36:00,208 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] [2023-02-16 03:36:00,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-02-16 03:36:00,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 136. [2023-02-16 03:36:00,211 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) [2023-02-16 03:36:00,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2023-02-16 03:36:00,211 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 12 [2023-02-16 03:36:00,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:36:00,212 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2023-02-16 03:36:00,212 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) [2023-02-16 03:36:00,212 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2023-02-16 03:36:00,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-02-16 03:36:00,213 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:36:00,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:36:00,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-16 03:36:00,213 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)] === [2023-02-16 03:36:00,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:36:00,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1603335132, now seen corresponding path program 1 times [2023-02-16 03:36:00,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:36:00,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132412118] [2023-02-16 03:36:00,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:00,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:36:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:00,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:00,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:36:00,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132412118] [2023-02-16 03:36:00,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132412118] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:36:00,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:36:00,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:36:00,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570924672] [2023-02-16 03:36:00,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:36:00,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:36:00,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:36:00,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:36:00,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:36:00,242 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) [2023-02-16 03:36:00,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:36:00,262 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2023-02-16 03:36:00,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:36:00,263 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 [2023-02-16 03:36:00,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:36:00,264 INFO L225 Difference]: With dead ends: 191 [2023-02-16 03:36:00,264 INFO L226 Difference]: Without dead ends: 191 [2023-02-16 03:36:00,264 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 [2023-02-16 03:36:00,264 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 [2023-02-16 03:36:00,265 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] [2023-02-16 03:36:00,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-02-16 03:36:00,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 149. [2023-02-16 03:36:00,267 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) [2023-02-16 03:36:00,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 163 transitions. [2023-02-16 03:36:00,267 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 163 transitions. Word has length 15 [2023-02-16 03:36:00,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:36:00,267 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 163 transitions. [2023-02-16 03:36:00,268 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) [2023-02-16 03:36:00,268 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 163 transitions. [2023-02-16 03:36:00,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 03:36:00,268 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:36:00,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:36:00,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-16 03:36:00,269 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)] === [2023-02-16 03:36:00,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:36:00,269 INFO L85 PathProgramCache]: Analyzing trace with hash -775737061, now seen corresponding path program 1 times [2023-02-16 03:36:00,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:36:00,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754021969] [2023-02-16 03:36:00,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:00,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:36:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:00,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:00,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:36:00,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754021969] [2023-02-16 03:36:00,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754021969] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:36:00,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:36:00,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:36:00,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536598446] [2023-02-16 03:36:00,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:36:00,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:36:00,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:36:00,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:36:00,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:36:00,349 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) [2023-02-16 03:36:00,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:36:00,459 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2023-02-16 03:36:00,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:36:00,460 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 [2023-02-16 03:36:00,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:36:00,461 INFO L225 Difference]: With dead ends: 149 [2023-02-16 03:36:00,461 INFO L226 Difference]: Without dead ends: 149 [2023-02-16 03:36:00,461 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 [2023-02-16 03:36:00,462 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 90 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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 [2023-02-16 03:36:00,462 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] [2023-02-16 03:36:00,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-02-16 03:36:00,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2023-02-16 03:36:00,464 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) [2023-02-16 03:36:00,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 161 transitions. [2023-02-16 03:36:00,465 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 161 transitions. Word has length 19 [2023-02-16 03:36:00,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:36:00,465 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 161 transitions. [2023-02-16 03:36:00,465 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) [2023-02-16 03:36:00,465 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2023-02-16 03:36:00,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-16 03:36:00,466 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:36:00,466 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] [2023-02-16 03:36:00,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-16 03:36:00,466 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)] === [2023-02-16 03:36:00,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:36:00,467 INFO L85 PathProgramCache]: Analyzing trace with hash 73317399, now seen corresponding path program 1 times [2023-02-16 03:36:00,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:36:00,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043855003] [2023-02-16 03:36:00,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:00,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:36:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:00,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:00,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:36:00,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043855003] [2023-02-16 03:36:00,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043855003] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:36:00,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:36:00,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:36:00,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001859100] [2023-02-16 03:36:00,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:36:00,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:36:00,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:36:00,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:36:00,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:36:00,583 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) [2023-02-16 03:36:00,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:36:00,689 INFO L93 Difference]: Finished difference Result 156 states and 170 transitions. [2023-02-16 03:36:00,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:36:00,690 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 [2023-02-16 03:36:00,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:36:00,690 INFO L225 Difference]: With dead ends: 156 [2023-02-16 03:36:00,690 INFO L226 Difference]: Without dead ends: 156 [2023-02-16 03:36:00,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:36:00,691 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 12 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:36:00,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 572 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:36:00,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-02-16 03:36:00,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2023-02-16 03:36:00,693 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) [2023-02-16 03:36:00,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2023-02-16 03:36:00,694 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 20 [2023-02-16 03:36:00,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:36:00,694 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2023-02-16 03:36:00,694 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) [2023-02-16 03:36:00,694 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2023-02-16 03:36:00,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 03:36:00,695 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:36:00,695 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] [2023-02-16 03:36:00,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-16 03:36:00,695 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)] === [2023-02-16 03:36:00,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:36:00,696 INFO L85 PathProgramCache]: Analyzing trace with hash -800612379, now seen corresponding path program 1 times [2023-02-16 03:36:00,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:36:00,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148828154] [2023-02-16 03:36:00,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:00,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:36:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:00,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:00,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:36:00,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148828154] [2023-02-16 03:36:00,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148828154] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:36:00,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:36:00,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:36:00,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570692342] [2023-02-16 03:36:00,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:36:00,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:36:00,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:36:00,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:36:00,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:36:00,770 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) [2023-02-16 03:36:00,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:36:00,824 INFO L93 Difference]: Finished difference Result 152 states and 165 transitions. [2023-02-16 03:36:00,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:36:00,824 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 [2023-02-16 03:36:00,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:36:00,825 INFO L225 Difference]: With dead ends: 152 [2023-02-16 03:36:00,825 INFO L226 Difference]: Without dead ends: 152 [2023-02-16 03:36:00,825 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 [2023-02-16 03:36:00,826 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 136 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:36:00,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 210 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:36:00,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-02-16 03:36:00,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2023-02-16 03:36:00,828 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) [2023-02-16 03:36:00,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2023-02-16 03:36:00,828 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 22 [2023-02-16 03:36:00,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:36:00,828 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2023-02-16 03:36:00,828 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) [2023-02-16 03:36:00,829 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2023-02-16 03:36:00,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 03:36:00,829 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:36:00,829 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] [2023-02-16 03:36:00,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-16 03:36:00,829 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)] === [2023-02-16 03:36:00,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:36:00,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1089542561, now seen corresponding path program 1 times [2023-02-16 03:36:00,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:36:00,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984887366] [2023-02-16 03:36:00,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:00,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:36:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:01,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:01,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:36:01,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984887366] [2023-02-16 03:36:01,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984887366] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:36:01,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853345808] [2023-02-16 03:36:01,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:01,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:36:01,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:36:01,022 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) [2023-02-16 03:36:01,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 03:36:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:01,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-16 03:36:01,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:36:01,223 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:01,226 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:01,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:01,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:36:01,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:01,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853345808] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:36:01,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:36:01,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 11 [2023-02-16 03:36:01,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451392537] [2023-02-16 03:36:01,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:36:01,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 03:36:01,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:36:01,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 03:36:01,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-16 03:36:01,325 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) [2023-02-16 03:36:01,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:36:01,550 INFO L93 Difference]: Finished difference Result 181 states and 199 transitions. [2023-02-16 03:36:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 03:36:01,551 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 [2023-02-16 03:36:01,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:36:01,551 INFO L225 Difference]: With dead ends: 181 [2023-02-16 03:36:01,551 INFO L226 Difference]: Without dead ends: 181 [2023-02-16 03:36:01,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2023-02-16 03:36:01,552 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 111 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:36:01,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 668 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:36:01,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-16 03:36:01,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 162. [2023-02-16 03:36:01,554 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) [2023-02-16 03:36:01,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 176 transitions. [2023-02-16 03:36:01,554 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 176 transitions. Word has length 25 [2023-02-16 03:36:01,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:36:01,554 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 176 transitions. [2023-02-16 03:36:01,555 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) [2023-02-16 03:36:01,555 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 176 transitions. [2023-02-16 03:36:01,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 03:36:01,555 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:36:01,555 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] [2023-02-16 03:36:01,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-16 03:36:01,755 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 [2023-02-16 03:36:01,756 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)] === [2023-02-16 03:36:01,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:36:01,756 INFO L85 PathProgramCache]: Analyzing trace with hash 583917852, now seen corresponding path program 1 times [2023-02-16 03:36:01,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:36:01,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276683909] [2023-02-16 03:36:01,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:01,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:36:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:01,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:01,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:36:01,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276683909] [2023-02-16 03:36:01,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276683909] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:36:01,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623952680] [2023-02-16 03:36:01,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:01,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:36:01,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:36:01,836 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) [2023-02-16 03:36:01,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-16 03:36:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:01,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 03:36:01,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:36:02,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2023-02-16 03:36:02,041 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~item~0#1.base| Int)) (let ((.cse0 (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_main_~item~0#1.base|))) (and (= (store |c_#valid| |ULTIMATE.start_main_~item~0#1.base| .cse0) |c_ULTIMATE.start_main_old_#valid#1|) (= 0 .cse0) (= (select |c_#valid| |ULTIMATE.start_main_~item~0#1.base|) 0)))) is different from true [2023-02-16 03:36:02,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-02-16 03:36:02,054 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:36:02,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:02,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623952680] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:36:02,114 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:36:02,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2023-02-16 03:36:02,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812570402] [2023-02-16 03:36:02,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:36:02,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:36:02,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:36:02,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:36:02,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2023-02-16 03:36:02,116 INFO L87 Difference]: Start difference. First operand 162 states and 176 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:36:02,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:36:02,228 INFO L93 Difference]: Finished difference Result 172 states and 185 transitions. [2023-02-16 03:36:02,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:36:02,228 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 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 [2023-02-16 03:36:02,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:36:02,229 INFO L225 Difference]: With dead ends: 172 [2023-02-16 03:36:02,229 INFO L226 Difference]: Without dead ends: 153 [2023-02-16 03:36:02,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2023-02-16 03:36:02,230 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 12 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:36:02,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 380 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 162 Invalid, 0 Unknown, 151 Unchecked, 0.1s Time] [2023-02-16 03:36:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-16 03:36:02,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2023-02-16 03:36:02,232 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) [2023-02-16 03:36:02,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 166 transitions. [2023-02-16 03:36:02,232 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 166 transitions. Word has length 26 [2023-02-16 03:36:02,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:36:02,233 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 166 transitions. [2023-02-16 03:36:02,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:36:02,233 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 166 transitions. [2023-02-16 03:36:02,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 03:36:02,233 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:36:02,234 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] [2023-02-16 03:36:02,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-16 03:36:02,438 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 [2023-02-16 03:36:02,438 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)] === [2023-02-16 03:36:02,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:36:02,439 INFO L85 PathProgramCache]: Analyzing trace with hash -370767273, now seen corresponding path program 1 times [2023-02-16 03:36:02,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:36:02,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432365757] [2023-02-16 03:36:02,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:02,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:36:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:02,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:02,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:36:02,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432365757] [2023-02-16 03:36:02,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432365757] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:36:02,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503399799] [2023-02-16 03:36:02,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:02,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:36:02,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:36:02,606 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) [2023-02-16 03:36:02,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-16 03:36:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:02,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-16 03:36:02,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:36:02,686 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:02,727 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:36:02,728 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:02,756 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:02,839 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:02,840 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:02,863 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:02,863 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:02,928 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:02,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:02,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:36:02,991 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int))) (not (= 0 (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|)))) is different from false [2023-02-16 03:36:03,026 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:03,027 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:03,034 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:03,034 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:03,038 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:03,165 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:03,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503399799] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:36:03,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:36:03,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 22 [2023-02-16 03:36:03,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933386446] [2023-02-16 03:36:03,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:36:03,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-16 03:36:03,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:36:03,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-16 03:36:03,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=342, Unknown=11, NotChecked=38, Total=462 [2023-02-16 03:36:03,167 INFO L87 Difference]: Start difference. First operand 153 states and 166 transitions. Second operand has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:36:03,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:36:03,714 INFO L93 Difference]: Finished difference Result 263 states and 286 transitions. [2023-02-16 03:36:03,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 03:36:03,714 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 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 [2023-02-16 03:36:03,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:36:03,715 INFO L225 Difference]: With dead ends: 263 [2023-02-16 03:36:03,715 INFO L226 Difference]: Without dead ends: 263 [2023-02-16 03:36:03,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=632, Unknown=11, NotChecked=54, Total=870 [2023-02-16 03:36:03,716 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 879 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 767 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 950 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:36:03,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 1045 Invalid, 950 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 767 Invalid, 0 Unknown, 157 Unchecked, 0.4s Time] [2023-02-16 03:36:03,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2023-02-16 03:36:03,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 168. [2023-02-16 03:36:03,718 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) [2023-02-16 03:36:03,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 183 transitions. [2023-02-16 03:36:03,719 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 183 transitions. Word has length 29 [2023-02-16 03:36:03,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:36:03,719 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 183 transitions. [2023-02-16 03:36:03,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:36:03,719 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 183 transitions. [2023-02-16 03:36:03,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-16 03:36:03,719 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:36:03,719 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] [2023-02-16 03:36:03,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-16 03:36:03,927 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 [2023-02-16 03:36:03,927 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)] === [2023-02-16 03:36:03,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:36:03,927 INFO L85 PathProgramCache]: Analyzing trace with hash -751968760, now seen corresponding path program 1 times [2023-02-16 03:36:03,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:36:03,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031607898] [2023-02-16 03:36:03,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:03,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:36:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:03,949 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:03,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:36:03,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031607898] [2023-02-16 03:36:03,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031607898] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:36:03,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:36:03,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:36:03,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013658609] [2023-02-16 03:36:03,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:36:03,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:36:03,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:36:03,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:36:03,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:36:03,951 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) [2023-02-16 03:36:03,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:36:03,968 INFO L93 Difference]: Finished difference Result 239 states and 260 transitions. [2023-02-16 03:36:03,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:36:03,968 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 [2023-02-16 03:36:03,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:36:03,969 INFO L225 Difference]: With dead ends: 239 [2023-02-16 03:36:03,969 INFO L226 Difference]: Without dead ends: 239 [2023-02-16 03:36:03,969 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 [2023-02-16 03:36:03,970 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 [2023-02-16 03:36:03,970 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] [2023-02-16 03:36:03,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-02-16 03:36:03,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 186. [2023-02-16 03:36:03,973 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) [2023-02-16 03:36:03,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 201 transitions. [2023-02-16 03:36:03,973 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 201 transitions. Word has length 30 [2023-02-16 03:36:03,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:36:03,973 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 201 transitions. [2023-02-16 03:36:03,973 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) [2023-02-16 03:36:03,974 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 201 transitions. [2023-02-16 03:36:03,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-16 03:36:03,974 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:36:03,974 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] [2023-02-16 03:36:03,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-16 03:36:03,975 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)] === [2023-02-16 03:36:03,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:36:03,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1573046208, now seen corresponding path program 1 times [2023-02-16 03:36:03,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:36:03,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701614695] [2023-02-16 03:36:03,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:03,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:36:03,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:04,229 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:04,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:36:04,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701614695] [2023-02-16 03:36:04,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701614695] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:36:04,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555106542] [2023-02-16 03:36:04,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:04,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:36:04,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:36:04,231 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) [2023-02-16 03:36:04,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-16 03:36:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:04,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-16 03:36:04,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:36:04,339 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:04,391 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:36:04,391 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:04,421 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:04,505 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:04,505 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:04,535 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:04,535 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:04,639 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:04,699 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:04,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:36:04,753 WARN L837 $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 [2023-02-16 03:36:06,888 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:06,888 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:06,894 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:06,894 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:06,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-02-16 03:36:11,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:11,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555106542] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:36:11,069 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:36:11,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 29 [2023-02-16 03:36:11,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079262618] [2023-02-16 03:36:11,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:36:11,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-16 03:36:11,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:36:11,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-16 03:36:11,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=654, Unknown=14, NotChecked=54, Total=870 [2023-02-16 03:36:11,071 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) [2023-02-16 03:36:15,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:36:15,996 INFO L93 Difference]: Finished difference Result 324 states and 351 transitions. [2023-02-16 03:36:15,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-16 03:36:15,997 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 [2023-02-16 03:36:15,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:36:15,998 INFO L225 Difference]: With dead ends: 324 [2023-02-16 03:36:15,998 INFO L226 Difference]: Without dead ends: 324 [2023-02-16 03:36:15,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=454, Invalid=1516, Unknown=14, NotChecked=86, Total=2070 [2023-02-16 03:36:15,999 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 763 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 252 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:36:15,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 857 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 779 Invalid, 0 Unknown, 252 Unchecked, 0.5s Time] [2023-02-16 03:36:16,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2023-02-16 03:36:16,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 197. [2023-02-16 03:36:16,002 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) [2023-02-16 03:36:16,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 216 transitions. [2023-02-16 03:36:16,002 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 216 transitions. Word has length 39 [2023-02-16 03:36:16,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:36:16,003 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 216 transitions. [2023-02-16 03:36:16,003 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) [2023-02-16 03:36:16,003 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 216 transitions. [2023-02-16 03:36:16,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-02-16 03:36:16,003 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:36:16,003 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] [2023-02-16 03:36:16,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-16 03:36:16,209 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 [2023-02-16 03:36:16,209 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)] === [2023-02-16 03:36:16,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:36:16,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1573046209, now seen corresponding path program 1 times [2023-02-16 03:36:16,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:36:16,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602711999] [2023-02-16 03:36:16,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:16,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:36:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:16,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:16,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:36:16,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602711999] [2023-02-16 03:36:16,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602711999] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:36:16,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274107711] [2023-02-16 03:36:16,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:16,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:36:16,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:36:16,709 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) [2023-02-16 03:36:16,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-16 03:36:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:16,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-16 03:36:16,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:36:16,796 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:16,852 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:36:16,853 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:16,858 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:16,923 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:16,929 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:17,032 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:17,032 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:17,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:36:17,047 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:17,069 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:17,069 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:17,075 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:17,210 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:17,216 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:17,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:17,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:36:17,404 WARN L837 $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_~item~0#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_~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 (+ (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|) 4)))) is different from false [2023-02-16 03:36:17,426 WARN L837 $PredicateComparison]: unable to prove that (and (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))) (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|))))) is different from false [2023-02-16 03:36:17,434 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_491 (Array Int Int))) (<= 0 (+ (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|) 4))) (forall ((v_ArrVal_490 (Array Int Int)) (v_ArrVal_491 (Array Int Int))) (<= (+ (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 [2023-02-16 03:36:17,449 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:17,449 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:17,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:17,455 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:17,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-02-16 03:36:17,476 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:17,476 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:17,481 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:17,482 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:17,485 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:36:17,488 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:17,491 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:36:17,493 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:17,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:17,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274107711] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:36:17,602 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:36:17,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 10] total 31 [2023-02-16 03:36:17,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447573221] [2023-02-16 03:36:17,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:36:17,602 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-16 03:36:17,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:36:17,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-16 03:36:17,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=712, Unknown=3, NotChecked=168, Total=992 [2023-02-16 03:36:17,604 INFO L87 Difference]: Start difference. First operand 197 states and 216 transitions. Second operand has 32 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 32 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) [2023-02-16 03:36:22,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:36:22,350 INFO L93 Difference]: Finished difference Result 327 states and 353 transitions. [2023-02-16 03:36:22,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-16 03:36:22,350 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 32 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 [2023-02-16 03:36:22,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:36:22,361 INFO L225 Difference]: With dead ends: 327 [2023-02-16 03:36:22,361 INFO L226 Difference]: Without dead ends: 327 [2023-02-16 03:36:22,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=400, Invalid=1959, Unknown=5, NotChecked=288, Total=2652 [2023-02-16 03:36:22,375 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 452 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 1391 mSolverCounterSat, 56 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 1606 SdHoareTripleChecker+Invalid, 2271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1391 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 822 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:36:22,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 1606 Invalid, 2271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1391 Invalid, 2 Unknown, 822 Unchecked, 0.6s Time] [2023-02-16 03:36:22,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-02-16 03:36:22,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 201. [2023-02-16 03:36:22,382 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) [2023-02-16 03:36:22,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 220 transitions. [2023-02-16 03:36:22,386 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 220 transitions. Word has length 39 [2023-02-16 03:36:22,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:36:22,400 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 220 transitions. [2023-02-16 03:36:22,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.6774193548387095) internal successors, (114), 32 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) [2023-02-16 03:36:22,401 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 220 transitions. [2023-02-16 03:36:22,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-16 03:36:22,402 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:36:22,402 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] [2023-02-16 03:36:22,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-16 03:36:22,607 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 [2023-02-16 03:36:22,607 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)] === [2023-02-16 03:36:22,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:36:22,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1519790839, now seen corresponding path program 1 times [2023-02-16 03:36:22,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:36:22,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431430412] [2023-02-16 03:36:22,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:22,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:36:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:22,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:36:22,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:36:22,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431430412] [2023-02-16 03:36:22,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431430412] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:36:22,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:36:22,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:36:22,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259387637] [2023-02-16 03:36:22,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:36:22,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:36:22,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:36:22,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:36:22,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:36:22,650 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) [2023-02-16 03:36:22,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:36:22,657 INFO L93 Difference]: Finished difference Result 202 states and 220 transitions. [2023-02-16 03:36:22,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:36:22,658 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 [2023-02-16 03:36:22,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:36:22,659 INFO L225 Difference]: With dead ends: 202 [2023-02-16 03:36:22,659 INFO L226 Difference]: Without dead ends: 202 [2023-02-16 03:36:22,659 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 [2023-02-16 03:36:22,659 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 [2023-02-16 03:36:22,660 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] [2023-02-16 03:36:22,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-02-16 03:36:22,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2023-02-16 03:36:22,663 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) [2023-02-16 03:36:22,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 220 transitions. [2023-02-16 03:36:22,664 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 220 transitions. Word has length 40 [2023-02-16 03:36:22,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:36:22,664 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 220 transitions. [2023-02-16 03:36:22,664 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) [2023-02-16 03:36:22,665 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 220 transitions. [2023-02-16 03:36:22,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-16 03:36:22,665 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:36:22,666 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] [2023-02-16 03:36:22,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-16 03:36:22,666 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)] === [2023-02-16 03:36:22,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:36:22,667 INFO L85 PathProgramCache]: Analyzing trace with hash 231761564, now seen corresponding path program 1 times [2023-02-16 03:36:22,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:36:22,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122059892] [2023-02-16 03:36:22,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:22,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:36:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:23,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:23,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:36:23,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122059892] [2023-02-16 03:36:23,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122059892] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:36:23,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654556365] [2023-02-16 03:36:23,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:23,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:36:23,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:36:23,322 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) [2023-02-16 03:36:23,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-16 03:36:23,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:23,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 49 conjunts are in the unsatisfiable core [2023-02-16 03:36:23,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:36:23,414 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:23,442 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:36:23,443 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:23,450 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:23,485 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:23,496 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:23,600 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:36:23,600 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:23,608 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:23,618 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:23,618 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:23,682 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:23,683 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:23,687 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:23,693 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:23,696 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:23,956 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:23,959 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:24,054 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:36:24,056 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:24,056 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:24,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:24,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:36:24,194 INFO L350 Elim1Store]: Elim1 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 72 treesize of output 52 [2023-02-16 03:36:24,443 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:24,444 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:24,450 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:24,450 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:24,465 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:24,475 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:24,475 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:24,482 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:36:24,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:36:24,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:36:24,487 INFO L350 Elim1Store]: Elim1 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 20 treesize of output 12 [2023-02-16 03:36:24,500 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:24,501 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:24,504 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:36:24,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:36:24,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:36:24,508 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:24,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654556365] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:36:24,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:36:24,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 37 [2023-02-16 03:36:24,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284087073] [2023-02-16 03:36:24,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:36:24,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-16 03:36:24,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:36:24,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-16 03:36:24,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2023-02-16 03:36:24,665 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) [2023-02-16 03:36:27,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:36:27,003 INFO L93 Difference]: Finished difference Result 332 states and 357 transitions. [2023-02-16 03:36:27,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-16 03:36:27,004 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 [2023-02-16 03:36:27,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:36:27,007 INFO L225 Difference]: With dead ends: 332 [2023-02-16 03:36:27,007 INFO L226 Difference]: Without dead ends: 332 [2023-02-16 03:36:27,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=502, Invalid=3158, Unknown=0, NotChecked=0, Total=3660 [2023-02-16 03:36:27,008 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 899 mSDsluCounter, 1736 mSDsCounter, 0 mSdLazyCounter, 1715 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 1771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:36:27,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 1825 Invalid, 1771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1715 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-16 03:36:27,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2023-02-16 03:36:27,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 201. [2023-02-16 03:36:27,012 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) [2023-02-16 03:36:27,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 218 transitions. [2023-02-16 03:36:27,014 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 218 transitions. Word has length 42 [2023-02-16 03:36:27,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:36:27,014 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 218 transitions. [2023-02-16 03:36:27,015 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) [2023-02-16 03:36:27,015 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 218 transitions. [2023-02-16 03:36:27,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-16 03:36:27,015 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:36:27,015 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] [2023-02-16 03:36:27,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-16 03:36:27,220 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 [2023-02-16 03:36:27,220 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)] === [2023-02-16 03:36:27,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:36:27,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1588995560, now seen corresponding path program 1 times [2023-02-16 03:36:27,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:36:27,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998832996] [2023-02-16 03:36:27,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:27,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:36:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:27,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:27,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:36:27,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998832996] [2023-02-16 03:36:27,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998832996] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:36:27,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851272348] [2023-02-16 03:36:27,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:27,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:36:27,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:36:27,488 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) [2023-02-16 03:36:27,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-16 03:36:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:27,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-16 03:36:27,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:36:27,594 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:27,681 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:36:27,681 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:27,715 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:27,808 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:27,808 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:27,833 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:27,833 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:28,001 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:28,051 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:28,056 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:28,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:36:28,205 WARN L837 $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 (= |c_ULTIMATE.start_main_~head~0#1.base| (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|))))) is different from false [2023-02-16 03:36:28,255 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:28,255 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:28,261 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:28,261 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:28,265 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:28,280 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:28,281 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:28,283 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:36:28,284 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:28,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:28,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851272348] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:36:28,367 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:36:28,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2023-02-16 03:36:28,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103022391] [2023-02-16 03:36:28,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:36:28,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-16 03:36:28,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:36:28,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-16 03:36:28,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=621, Unknown=16, NotChecked=52, Total=812 [2023-02-16 03:36:28,368 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) [2023-02-16 03:36:28,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:36:28,937 INFO L93 Difference]: Finished difference Result 248 states and 269 transitions. [2023-02-16 03:36:28,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-16 03:36:28,937 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 [2023-02-16 03:36:28,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:36:28,938 INFO L225 Difference]: With dead ends: 248 [2023-02-16 03:36:28,938 INFO L226 Difference]: Without dead ends: 248 [2023-02-16 03:36:28,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=851, Unknown=16, NotChecked=62, Total=1122 [2023-02-16 03:36:28,939 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 488 mSDsluCounter, 995 mSDsCounter, 0 mSdLazyCounter, 887 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 1082 SdHoareTripleChecker+Invalid, 1109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 887 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:36:28,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 1082 Invalid, 1109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 887 Invalid, 0 Unknown, 191 Unchecked, 0.4s Time] [2023-02-16 03:36:28,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-02-16 03:36:28,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 224. [2023-02-16 03:36:28,941 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) [2023-02-16 03:36:28,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 252 transitions. [2023-02-16 03:36:28,942 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 252 transitions. Word has length 44 [2023-02-16 03:36:28,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:36:28,942 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 252 transitions. [2023-02-16 03:36:28,942 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) [2023-02-16 03:36:28,942 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 252 transitions. [2023-02-16 03:36:28,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-16 03:36:28,942 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:36:28,942 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] [2023-02-16 03:36:28,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-16 03:36:29,149 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 [2023-02-16 03:36:29,149 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)] === [2023-02-16 03:36:29,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:36:29,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1588995559, now seen corresponding path program 1 times [2023-02-16 03:36:29,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:36:29,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054355505] [2023-02-16 03:36:29,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:29,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:36:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:29,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:29,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:36:29,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054355505] [2023-02-16 03:36:29,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054355505] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:36:29,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042864854] [2023-02-16 03:36:29,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:29,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:36:29,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:36:29,604 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) [2023-02-16 03:36:29,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-16 03:36:29,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:29,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-16 03:36:29,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:36:29,695 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:29,739 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:29,748 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:36:29,748 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:29,776 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:29,784 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:29,875 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:36:29,875 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:29,879 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:29,891 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:29,892 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:29,928 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:29,928 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:29,932 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:30,111 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:30,115 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:30,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:30,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:36:30,275 WARN L837 $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_~item~0#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_~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|))))) is different from false [2023-02-16 03:36:30,290 WARN L837 $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 [2023-02-16 03:36:30,297 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_761 (Array Int Int))) (<= 0 (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|))) (forall ((v_ArrVal_762 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (<= (+ (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|)))))) is different from false [2023-02-16 03:36:30,308 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:30,308 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:30,312 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:30,312 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:30,319 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:30,319 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:30,329 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:30,329 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:30,333 INFO L350 Elim1Store]: Elim1 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 66 treesize of output 62 [2023-02-16 03:36:30,337 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 28 [2023-02-16 03:36:30,415 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:30,416 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:30,418 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:36:30,419 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:30,509 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:30,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042864854] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:36:30,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:36:30,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 28 [2023-02-16 03:36:30,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142321062] [2023-02-16 03:36:30,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:36:30,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-16 03:36:30,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:36:30,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-16 03:36:30,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=568, Unknown=3, NotChecked=150, Total=812 [2023-02-16 03:36:30,511 INFO L87 Difference]: Start difference. First operand 224 states and 252 transitions. Second operand has 29 states, 28 states have (on average 4.428571428571429) internal successors, (124), 29 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:36:31,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:36:31,577 INFO L93 Difference]: Finished difference Result 243 states and 264 transitions. [2023-02-16 03:36:31,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-16 03:36:31,578 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 4.428571428571429) internal successors, (124), 29 states have internal predecessors, (124), 0 states have call successors, (0), 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 [2023-02-16 03:36:31,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:36:31,579 INFO L225 Difference]: With dead ends: 243 [2023-02-16 03:36:31,579 INFO L226 Difference]: Without dead ends: 243 [2023-02-16 03:36:31,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=328, Invalid=1240, Unknown=4, NotChecked=234, Total=1806 [2023-02-16 03:36:31,579 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 546 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 26 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 571 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:36:31,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 977 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 820 Invalid, 26 Unknown, 571 Unchecked, 0.5s Time] [2023-02-16 03:36:31,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-02-16 03:36:31,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 224. [2023-02-16 03:36:31,582 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) [2023-02-16 03:36:31,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 251 transitions. [2023-02-16 03:36:31,582 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 251 transitions. Word has length 44 [2023-02-16 03:36:31,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:36:31,583 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 251 transitions. [2023-02-16 03:36:31,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 4.428571428571429) internal successors, (124), 29 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:36:31,583 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 251 transitions. [2023-02-16 03:36:31,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-16 03:36:31,583 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:36:31,583 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] [2023-02-16 03:36:31,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-02-16 03:36:31,787 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 [2023-02-16 03:36:31,788 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)] === [2023-02-16 03:36:31,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:36:31,788 INFO L85 PathProgramCache]: Analyzing trace with hash -64101254, now seen corresponding path program 1 times [2023-02-16 03:36:31,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:36:31,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142913439] [2023-02-16 03:36:31,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:31,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:36:31,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-16 03:36:31,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:36:31,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142913439] [2023-02-16 03:36:31,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142913439] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:36:31,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:36:31,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:36:31,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770319655] [2023-02-16 03:36:31,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:36:31,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:36:31,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:36:31,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:36:31,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:36:31,822 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) [2023-02-16 03:36:31,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:36:31,843 INFO L93 Difference]: Finished difference Result 298 states and 331 transitions. [2023-02-16 03:36:31,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:36:31,843 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 [2023-02-16 03:36:31,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:36:31,844 INFO L225 Difference]: With dead ends: 298 [2023-02-16 03:36:31,845 INFO L226 Difference]: Without dead ends: 298 [2023-02-16 03:36:31,845 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 [2023-02-16 03:36:31,845 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 [2023-02-16 03:36:31,845 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] [2023-02-16 03:36:31,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2023-02-16 03:36:31,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 242. [2023-02-16 03:36:31,848 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) [2023-02-16 03:36:31,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 270 transitions. [2023-02-16 03:36:31,849 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 270 transitions. Word has length 44 [2023-02-16 03:36:31,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:36:31,849 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 270 transitions. [2023-02-16 03:36:31,849 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) [2023-02-16 03:36:31,849 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 270 transitions. [2023-02-16 03:36:31,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-16 03:36:31,850 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:36:31,850 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] [2023-02-16 03:36:31,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-16 03:36:31,850 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)] === [2023-02-16 03:36:31,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:36:31,851 INFO L85 PathProgramCache]: Analyzing trace with hash -2014223229, now seen corresponding path program 1 times [2023-02-16 03:36:31,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:36:31,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446011528] [2023-02-16 03:36:31,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:31,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:36:31,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:31,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:36:31,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:36:31,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446011528] [2023-02-16 03:36:31,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446011528] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:36:31,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299410371] [2023-02-16 03:36:31,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:31,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:36:31,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:36:31,937 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) [2023-02-16 03:36:31,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-02-16 03:36:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:32,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-16 03:36:32,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:36:32,066 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:32,068 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:32,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:36:32,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:36:32,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:36:32,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299410371] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:36:32,147 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:36:32,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2023-02-16 03:36:32,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294480948] [2023-02-16 03:36:32,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:36:32,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:36:32,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:36:32,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:36:32,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:36:32,148 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) [2023-02-16 03:36:32,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:36:32,260 INFO L93 Difference]: Finished difference Result 283 states and 314 transitions. [2023-02-16 03:36:32,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:36:32,261 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 [2023-02-16 03:36:32,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:36:32,262 INFO L225 Difference]: With dead ends: 283 [2023-02-16 03:36:32,262 INFO L226 Difference]: Without dead ends: 275 [2023-02-16 03:36:32,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 86 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:36:32,262 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 185 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:36:32,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 423 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:36:32,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2023-02-16 03:36:32,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 269. [2023-02-16 03:36:32,266 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) [2023-02-16 03:36:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 304 transitions. [2023-02-16 03:36:32,266 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 304 transitions. Word has length 45 [2023-02-16 03:36:32,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:36:32,267 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 304 transitions. [2023-02-16 03:36:32,267 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) [2023-02-16 03:36:32,267 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 304 transitions. [2023-02-16 03:36:32,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-16 03:36:32,267 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:36:32,267 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] [2023-02-16 03:36:32,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-02-16 03:36:32,472 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 [2023-02-16 03:36:32,472 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)] === [2023-02-16 03:36:32,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:36:32,473 INFO L85 PathProgramCache]: Analyzing trace with hash 164743237, now seen corresponding path program 1 times [2023-02-16 03:36:32,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:36:32,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264909790] [2023-02-16 03:36:32,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:32,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:36:32,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:32,950 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:32,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:36:32,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264909790] [2023-02-16 03:36:32,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264909790] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:36:32,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259923725] [2023-02-16 03:36:32,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:32,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:36:32,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:36:32,952 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) [2023-02-16 03:36:32,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-02-16 03:36:33,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:33,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 40 conjunts are in the unsatisfiable core [2023-02-16 03:36:33,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:36:33,074 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:33,145 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:36:33,145 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:33,182 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:33,307 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:33,307 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:33,325 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:33,326 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:33,377 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:36:33,378 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:33,433 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-16 03:36:33,434 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:33,557 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-16 03:36:33,558 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:33,569 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:33,666 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-16 03:36:33,666 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:33,678 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 12 [2023-02-16 03:36:33,734 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:33,737 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:33,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:36:33,755 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int))) (not (= 0 (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|)))) is different from false [2023-02-16 03:36:33,761 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (Array Int Int))) (not (= 0 (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|)))) is different from false [2023-02-16 03:36:33,764 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1003 (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_1003) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-16 03:36:33,845 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:33,846 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:33,922 WARN L837 $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 (= 0 (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|)))))) is different from false [2023-02-16 03:36:33,932 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:33,933 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:33,940 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:33,940 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:33,946 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:33,947 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:33,950 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:33,957 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-16 03:36:33,957 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:34,094 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-02-16 03:36:34,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259923725] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:36:34,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:36:34,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 38 [2023-02-16 03:36:34,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168447871] [2023-02-16 03:36:34,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:36:34,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-16 03:36:34,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:36:34,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-16 03:36:34,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=966, Unknown=6, NotChecked=268, Total=1406 [2023-02-16 03:36:34,095 INFO L87 Difference]: Start difference. First operand 269 states and 304 transitions. Second operand has 38 states, 38 states have (on average 3.026315789473684) internal successors, (115), 38 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) [2023-02-16 03:36:36,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:36:36,455 INFO L93 Difference]: Finished difference Result 306 states and 342 transitions. [2023-02-16 03:36:36,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-02-16 03:36:36,464 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 3.026315789473684) internal successors, (115), 38 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 [2023-02-16 03:36:36,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:36:36,466 INFO L225 Difference]: With dead ends: 306 [2023-02-16 03:36:36,466 INFO L226 Difference]: Without dead ends: 306 [2023-02-16 03:36:36,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 1251 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=869, Invalid=3693, Unknown=10, NotChecked=540, Total=5112 [2023-02-16 03:36:36,468 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 757 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 91 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 2138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 727 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-16 03:36:36,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 1294 Invalid, 2138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1317 Invalid, 3 Unknown, 727 Unchecked, 0.7s Time] [2023-02-16 03:36:36,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2023-02-16 03:36:36,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 267. [2023-02-16 03:36:36,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 236 states have (on average 1.2796610169491525) internal successors, (302), 266 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:36:36,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 302 transitions. [2023-02-16 03:36:36,478 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 302 transitions. Word has length 45 [2023-02-16 03:36:36,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:36:36,479 INFO L495 AbstractCegarLoop]: Abstraction has 267 states and 302 transitions. [2023-02-16 03:36:36,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 3.026315789473684) internal successors, (115), 38 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) [2023-02-16 03:36:36,480 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 302 transitions. [2023-02-16 03:36:36,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-16 03:36:36,480 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:36:36,481 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] [2023-02-16 03:36:36,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-02-16 03:36:36,686 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 [2023-02-16 03:36:36,686 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)] === [2023-02-16 03:36:36,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:36:36,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1983636472, now seen corresponding path program 1 times [2023-02-16 03:36:36,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:36:36,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265412908] [2023-02-16 03:36:36,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:36,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:36:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:36,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:36,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:36:36,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265412908] [2023-02-16 03:36:36,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265412908] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:36:36,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867392757] [2023-02-16 03:36:36,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:36,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:36:36,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:36:36,939 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) [2023-02-16 03:36:36,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-02-16 03:36:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:37,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-16 03:36:37,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:36:37,044 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:37,092 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:36:37,093 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:37,120 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:37,125 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:37,147 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:37,199 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:37,206 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:37,300 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:37,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:37,307 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:36:37,346 WARN L837 $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 [2023-02-16 03:36:37,352 WARN L837 $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 [2023-02-16 03:36:37,355 WARN L837 $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 [2023-02-16 03:36:37,360 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:37,360 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:37,366 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:37,366 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:37,369 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:37,439 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:37,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867392757] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:36:37,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:36:37,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 24 [2023-02-16 03:36:37,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121170033] [2023-02-16 03:36:37,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:36:37,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-16 03:36:37,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:36:37,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-16 03:36:37,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=385, Unknown=3, NotChecked=126, Total=600 [2023-02-16 03:36:37,441 INFO L87 Difference]: Start difference. First operand 267 states and 302 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) [2023-02-16 03:36:37,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:36:37,975 INFO L93 Difference]: Finished difference Result 285 states and 315 transitions. [2023-02-16 03:36:37,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-16 03:36:37,975 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 [2023-02-16 03:36:37,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:36:37,976 INFO L225 Difference]: With dead ends: 285 [2023-02-16 03:36:37,976 INFO L226 Difference]: Without dead ends: 285 [2023-02-16 03:36:37,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=263, Invalid=868, Unknown=3, NotChecked=198, Total=1332 [2023-02-16 03:36:37,977 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 647 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 473 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:36:37,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 857 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 648 Invalid, 0 Unknown, 473 Unchecked, 0.3s Time] [2023-02-16 03:36:37,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-02-16 03:36:37,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 269. [2023-02-16 03:36:37,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 238 states have (on average 1.2773109243697478) 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) [2023-02-16 03:36:37,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 304 transitions. [2023-02-16 03:36:37,981 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 304 transitions. Word has length 46 [2023-02-16 03:36:37,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:36:37,981 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 304 transitions. [2023-02-16 03:36:37,981 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) [2023-02-16 03:36:37,981 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 304 transitions. [2023-02-16 03:36:37,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-16 03:36:37,981 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:36:37,982 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] [2023-02-16 03:36:37,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-02-16 03:36:38,187 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 [2023-02-16 03:36:38,188 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)] === [2023-02-16 03:36:38,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:36:38,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1363188935, now seen corresponding path program 1 times [2023-02-16 03:36:38,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:36:38,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811508222] [2023-02-16 03:36:38,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:38,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:36:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:38,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:36:38,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811508222] [2023-02-16 03:36:38,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811508222] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:36:38,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555333975] [2023-02-16 03:36:38,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:38,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:36:38,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:36:38,430 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:36:38,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-02-16 03:36:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:38,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-16 03:36:38,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:36:38,592 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:38,641 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:36:38,642 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:38,680 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:38,776 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:38,776 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:38,790 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:38,791 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:38,914 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:38,931 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:38,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:36:39,085 INFO L350 Elim1Store]: Elim1 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 32 treesize of output 28 [2023-02-16 03:36:39,210 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:39,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555333975] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:36:39,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:36:39,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2023-02-16 03:36:39,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44586194] [2023-02-16 03:36:39,210 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:36:39,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-16 03:36:39,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:36:39,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-16 03:36:39,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2023-02-16 03:36:39,212 INFO L87 Difference]: Start difference. First operand 269 states and 304 transitions. Second operand has 22 states, 21 states have (on average 4.428571428571429) internal successors, (93), 22 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:36:39,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:36:39,761 INFO L93 Difference]: Finished difference Result 281 states and 311 transitions. [2023-02-16 03:36:39,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-16 03:36:39,761 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.428571428571429) internal successors, (93), 22 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2023-02-16 03:36:39,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:36:39,766 INFO L225 Difference]: With dead ends: 281 [2023-02-16 03:36:39,766 INFO L226 Difference]: Without dead ends: 281 [2023-02-16 03:36:39,767 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 77 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=242, Invalid=880, Unknown=0, NotChecked=0, Total=1122 [2023-02-16 03:36:39,768 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 588 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:36:39,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 762 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:36:39,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-02-16 03:36:39,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 270. [2023-02-16 03:36:39,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 239 states have (on average 1.2761506276150627) internal successors, (305), 269 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:36:39,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 305 transitions. [2023-02-16 03:36:39,776 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 305 transitions. Word has length 47 [2023-02-16 03:36:39,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:36:39,776 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 305 transitions. [2023-02-16 03:36:39,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.428571428571429) internal successors, (93), 22 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:36:39,776 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 305 transitions. [2023-02-16 03:36:39,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-16 03:36:39,777 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:36:39,777 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, 1, 1] [2023-02-16 03:36:39,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-02-16 03:36:39,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-02-16 03:36:39,982 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-02-16 03:36:39,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:36:39,983 INFO L85 PathProgramCache]: Analyzing trace with hash -595406900, now seen corresponding path program 1 times [2023-02-16 03:36:39,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:36:39,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111102853] [2023-02-16 03:36:39,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:39,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:36:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:40,380 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:40,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:36:40,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111102853] [2023-02-16 03:36:40,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111102853] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:36:40,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974975301] [2023-02-16 03:36:40,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:40,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:36:40,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:36:40,385 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:36:40,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-02-16 03:36:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:40,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-16 03:36:40,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:36:40,503 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:40,558 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:36:40,558 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:40,585 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:40,673 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:40,673 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:40,691 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:40,691 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:40,734 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:36:40,734 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:40,765 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-16 03:36:40,766 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 22 [2023-02-16 03:36:40,919 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-16 03:36:40,920 INFO L350 Elim1Store]: Elim1 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 47 treesize of output 49 [2023-02-16 03:36:40,922 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:41,013 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-16 03:36:41,013 INFO L350 Elim1Store]: Elim1 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 56 treesize of output 56 [2023-02-16 03:36:41,122 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:41,135 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:41,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:36:41,172 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1272 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1272) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2023-02-16 03:36:41,183 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1272 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1272) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2023-02-16 03:36:41,187 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1272 (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_1272) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2023-02-16 03:36:41,196 INFO L321 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2023-02-16 03:36:41,197 INFO L350 Elim1Store]: Elim1 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 27 treesize of output 26 [2023-02-16 03:36:41,300 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:41,300 INFO L350 Elim1Store]: Elim1 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 16 treesize of output 20 [2023-02-16 03:36:41,409 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:41,409 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:41,415 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:41,416 INFO L350 Elim1Store]: Elim1 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 134 treesize of output 133 [2023-02-16 03:36:41,418 INFO L350 Elim1Store]: Elim1 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 118 treesize of output 110 [2023-02-16 03:36:41,424 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:41,424 INFO L350 Elim1Store]: Elim1 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 118 treesize of output 108 [2023-02-16 03:36:41,432 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-16 03:36:41,432 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:41,596 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-02-16 03:36:41,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974975301] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:36:41,597 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:36:41,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 37 [2023-02-16 03:36:41,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155494752] [2023-02-16 03:36:41,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:36:41,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-02-16 03:36:41,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:36:41,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-02-16 03:36:41,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1038, Unknown=19, NotChecked=204, Total=1406 [2023-02-16 03:36:41,600 INFO L87 Difference]: Start difference. First operand 270 states and 305 transitions. Second operand has 38 states, 37 states have (on average 3.2432432432432434) internal successors, (120), 38 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:36:45,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:36:45,349 INFO L93 Difference]: Finished difference Result 339 states and 380 transitions. [2023-02-16 03:36:45,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-16 03:36:45,350 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.2432432432432434) internal successors, (120), 38 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2023-02-16 03:36:45,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:36:45,351 INFO L225 Difference]: With dead ends: 339 [2023-02-16 03:36:45,351 INFO L226 Difference]: Without dead ends: 339 [2023-02-16 03:36:45,352 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 71 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=498, Invalid=2575, Unknown=19, NotChecked=330, Total=3422 [2023-02-16 03:36:45,352 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 423 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 423 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 1838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 445 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-16 03:36:45,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [423 Valid, 1311 Invalid, 1838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1322 Invalid, 0 Unknown, 445 Unchecked, 0.8s Time] [2023-02-16 03:36:45,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-02-16 03:36:45,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 296. [2023-02-16 03:36:45,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 265 states have (on average 1.2566037735849056) internal successors, (333), 295 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:36:45,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 333 transitions. [2023-02-16 03:36:45,356 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 333 transitions. Word has length 47 [2023-02-16 03:36:45,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:36:45,356 INFO L495 AbstractCegarLoop]: Abstraction has 296 states and 333 transitions. [2023-02-16 03:36:45,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.2432432432432434) internal successors, (120), 38 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:36:45,356 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 333 transitions. [2023-02-16 03:36:45,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-16 03:36:45,357 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:36:45,357 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, 1, 1] [2023-02-16 03:36:45,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-02-16 03:36:45,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-02-16 03:36:45,563 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-02-16 03:36:45,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:36:45,563 INFO L85 PathProgramCache]: Analyzing trace with hash -595406899, now seen corresponding path program 1 times [2023-02-16 03:36:45,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:36:45,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591752865] [2023-02-16 03:36:45,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:45,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:36:45,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:46,094 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:46,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:36:46,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591752865] [2023-02-16 03:36:46,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591752865] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:36:46,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033467449] [2023-02-16 03:36:46,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:46,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:36:46,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:36:46,096 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:36:46,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-02-16 03:36:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:46,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 61 conjunts are in the unsatisfiable core [2023-02-16 03:36:46,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:36:46,222 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:46,275 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:36:46,275 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:46,311 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:46,319 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:46,432 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:46,433 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:46,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:36:46,442 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:46,508 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:46,509 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:46,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:36:46,518 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:46,694 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:36:46,695 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 20 [2023-02-16 03:36:46,718 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-16 03:36:46,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-16 03:36:46,778 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-16 03:36:46,778 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:46,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:36:46,949 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-16 03:36:46,949 INFO L350 Elim1Store]: Elim1 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 65 treesize of output 55 [2023-02-16 03:36:46,964 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:36:46,964 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:46,966 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:47,053 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-16 03:36:47,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 63 [2023-02-16 03:36:47,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-16 03:36:47,264 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 03:36:47,264 INFO L350 Elim1Store]: Elim1 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 55 treesize of output 26 [2023-02-16 03:36:47,277 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:47,302 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:47,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:36:47,401 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1397 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1398) |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_1397) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1398 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1398) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-16 03:36:47,419 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1398 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1398) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1397 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1398) |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_1397) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-02-16 03:36:47,426 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (and (forall ((v_ArrVal_1398 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1398) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1397 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1398) |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_1397) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2023-02-16 03:36:47,439 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1397 (Array Int Int)) (v_ArrVal_1394 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1394) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1398) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (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|) |c_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_1397) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1398 (Array Int Int)) (v_ArrVal_1394 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1394) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1398) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-16 03:36:47,571 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:47,571 INFO L350 Elim1Store]: Elim1 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 117 treesize of output 121 [2023-02-16 03:36:47,578 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:47,578 INFO L350 Elim1Store]: Elim1 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 115 treesize of output 112 [2023-02-16 03:36:47,631 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 22 [2023-02-16 03:36:47,824 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~item~0#1.offset| Int)) (or (forall ((v_arrayElimArr_19 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_19 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= 0 (select |c_#valid| .cse0))) (forall ((v_ArrVal_1397 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_19) .cse0 v_ArrVal_1397) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) .cse0)))))) (not (<= 0 |ULTIMATE.start_main_~item~0#1.offset|)))) (forall ((v_arrayElimCell_161 Int) (v_prenex_1 (Array Int Int)) (v_prenex_3 (Array Int Int))) (or (not (= 0 (select |c_#valid| v_arrayElimCell_161))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_prenex_3) v_arrayElimCell_161 v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 5))) (forall ((v_ArrVal_1398 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc3#1.base_41| Int) (v_ArrVal_1394 (Array Int Int))) (or (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1394) |v_ULTIMATE.start_main_#t~malloc3#1.base_41| v_ArrVal_1398) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_41|))))) (forall ((|ULTIMATE.start_main_~item~0#1.offset| Int)) (or (forall ((v_arrayElimArr_19 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_19 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= 0 (select |c_#valid| .cse1))) (forall ((v_ArrVal_1397 (Array Int Int))) (= |c_ULTIMATE.start_main_~item~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_19) .cse1 v_ArrVal_1397) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (not (<= 0 |ULTIMATE.start_main_~item~0#1.offset|))))) is different from false [2023-02-16 03:36:48,099 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:48,099 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:48,106 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:48,107 INFO L350 Elim1Store]: Elim1 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 68 treesize of output 71 [2023-02-16 03:36:48,114 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:48,114 INFO L350 Elim1Store]: Elim1 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 64 treesize of output 60 [2023-02-16 03:36:48,117 INFO L350 Elim1Store]: Elim1 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 46 treesize of output 42 [2023-02-16 03:36:48,164 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:48,164 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 22 [2023-02-16 03:36:48,171 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:48,171 INFO L350 Elim1Store]: Elim1 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 122 treesize of output 121 [2023-02-16 03:36:48,175 INFO L350 Elim1Store]: Elim1 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 53 treesize of output 49 [2023-02-16 03:36:48,178 INFO L350 Elim1Store]: Elim1 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 102 treesize of output 94 [2023-02-16 03:36:48,248 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:48,248 INFO L350 Elim1Store]: Elim1 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 26 treesize of output 27 [2023-02-16 03:36:48,250 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:36:48,257 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:48,257 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 40 [2023-02-16 03:36:48,264 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:48,265 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 33 [2023-02-16 03:36:48,312 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:48,312 INFO L350 Elim1Store]: Elim1 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 21 treesize of output 22 [2023-02-16 03:36:48,315 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:36:48,321 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:48,322 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:48,324 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:36:48,596 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2023-02-16 03:36:48,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033467449] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:36:48,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:36:48,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 44 [2023-02-16 03:36:48,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006826291] [2023-02-16 03:36:48,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:36:48,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-02-16 03:36:48,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:36:48,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-02-16 03:36:48,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1380, Unknown=15, NotChecked=400, Total=1980 [2023-02-16 03:36:48,598 INFO L87 Difference]: Start difference. First operand 296 states and 333 transitions. Second operand has 45 states, 44 states have (on average 3.159090909090909) internal successors, (139), 45 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:37:02,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:37:02,628 INFO L93 Difference]: Finished difference Result 475 states and 534 transitions. [2023-02-16 03:37:02,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-02-16 03:37:02,629 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 3.159090909090909) internal successors, (139), 45 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2023-02-16 03:37:02,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:37:02,630 INFO L225 Difference]: With dead ends: 475 [2023-02-16 03:37:02,630 INFO L226 Difference]: Without dead ends: 475 [2023-02-16 03:37:02,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 1358 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=740, Invalid=4372, Unknown=20, NotChecked=720, Total=5852 [2023-02-16 03:37:02,631 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 1059 mSDsluCounter, 1795 mSDsCounter, 0 mSdLazyCounter, 2122 mSolverCounterSat, 96 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 1894 SdHoareTripleChecker+Invalid, 3236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2122 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 1008 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-16 03:37:02,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 1894 Invalid, 3236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2122 Invalid, 10 Unknown, 1008 Unchecked, 1.9s Time] [2023-02-16 03:37:02,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2023-02-16 03:37:02,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 323. [2023-02-16 03:37:02,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 292 states have (on average 1.2431506849315068) internal successors, (363), 322 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:37:02,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 363 transitions. [2023-02-16 03:37:02,636 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 363 transitions. Word has length 47 [2023-02-16 03:37:02,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:37:02,636 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 363 transitions. [2023-02-16 03:37:02,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.159090909090909) internal successors, (139), 45 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:37:02,637 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 363 transitions. [2023-02-16 03:37:02,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-16 03:37:02,637 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:37:02,637 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:37:02,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-02-16 03:37:02,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:37:02,843 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-02-16 03:37:02,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:37:02,843 INFO L85 PathProgramCache]: Analyzing trace with hash -690815526, now seen corresponding path program 1 times [2023-02-16 03:37:02,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:37:02,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923129287] [2023-02-16 03:37:02,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:37:02,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:37:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:37:02,876 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 03:37:02,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:37:02,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923129287] [2023-02-16 03:37:02,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923129287] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:37:02,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:37:02,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:37:02,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258411256] [2023-02-16 03:37:02,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:37:02,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:37:02,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:37:02,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:37:02,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:37:02,878 INFO L87 Difference]: Start difference. First operand 323 states and 363 transitions. Second operand has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:37:02,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:37:02,951 INFO L93 Difference]: Finished difference Result 327 states and 366 transitions. [2023-02-16 03:37:02,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:37:02,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2023-02-16 03:37:02,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:37:02,952 INFO L225 Difference]: With dead ends: 327 [2023-02-16 03:37:02,952 INFO L226 Difference]: Without dead ends: 327 [2023-02-16 03:37:02,953 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 [2023-02-16 03:37:02,956 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 158 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:37:02,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 154 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:37:02,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2023-02-16 03:37:02,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 316. [2023-02-16 03:37:02,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 286 states have (on average 1.2447552447552448) internal successors, (356), 315 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:37:02,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 356 transitions. [2023-02-16 03:37:02,960 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 356 transitions. Word has length 48 [2023-02-16 03:37:02,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:37:02,960 INFO L495 AbstractCegarLoop]: Abstraction has 316 states and 356 transitions. [2023-02-16 03:37:02,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:37:02,960 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 356 transitions. [2023-02-16 03:37:02,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-16 03:37:02,962 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:37:02,963 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, 1] [2023-02-16 03:37:02,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-02-16 03:37:02,963 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-02-16 03:37:02,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:37:02,963 INFO L85 PathProgramCache]: Analyzing trace with hash -2103557434, now seen corresponding path program 1 times [2023-02-16 03:37:02,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:37:02,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050788545] [2023-02-16 03:37:02,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:37:02,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:37:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:37:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:37:03,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:37:03,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050788545] [2023-02-16 03:37:03,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050788545] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:37:03,009 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:37:03,009 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:37:03,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220762319] [2023-02-16 03:37:03,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:37:03,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:37:03,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:37:03,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:37:03,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:37:03,011 INFO L87 Difference]: Start difference. First operand 316 states and 356 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:37:03,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:37:03,037 INFO L93 Difference]: Finished difference Result 333 states and 362 transitions. [2023-02-16 03:37:03,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:37:03,037 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2023-02-16 03:37:03,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:37:03,038 INFO L225 Difference]: With dead ends: 333 [2023-02-16 03:37:03,038 INFO L226 Difference]: Without dead ends: 333 [2023-02-16 03:37:03,039 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 [2023-02-16 03:37:03,039 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 46 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:37:03,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 362 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:37:03,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2023-02-16 03:37:03,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 310. [2023-02-16 03:37:03,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 280 states have (on average 1.225) internal successors, (343), 309 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:37:03,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 343 transitions. [2023-02-16 03:37:03,043 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 343 transitions. Word has length 48 [2023-02-16 03:37:03,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:37:03,043 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 343 transitions. [2023-02-16 03:37:03,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:37:03,043 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 343 transitions. [2023-02-16 03:37:03,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-16 03:37:03,044 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:37:03,044 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, 1, 1, 1, 1] [2023-02-16 03:37:03,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-02-16 03:37:03,044 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2023-02-16 03:37:03,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:37:03,044 INFO L85 PathProgramCache]: Analyzing trace with hash -955374836, now seen corresponding path program 1 times [2023-02-16 03:37:03,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:37:03,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036696879] [2023-02-16 03:37:03,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:37:03,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:37:03,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:37:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:37:03,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:37:03,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036696879] [2023-02-16 03:37:03,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036696879] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:37:03,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374503218] [2023-02-16 03:37:03,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:37:03,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:37:03,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:37:03,612 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:37:03,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-02-16 03:37:03,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:37:03,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 62 conjunts are in the unsatisfiable core [2023-02-16 03:37:03,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:37:03,778 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:37:03,853 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:37:03,853 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:37:03,887 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:37:03,892 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:37:04,028 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:37:04,029 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:37:04,032 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:37:04,042 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:37:04,042 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:37:04,091 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:37:04,091 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:37:04,095 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:37:04,106 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:37:04,106 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:37:04,222 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-16 03:37:04,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-16 03:37:04,260 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-16 03:37:04,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2023-02-16 03:37:04,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:37:04,393 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-16 03:37:04,393 INFO L350 Elim1Store]: Elim1 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 82 treesize of output 68 [2023-02-16 03:37:04,402 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:37:04,403 INFO L350 Elim1Store]: Elim1 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 74 treesize of output 70 [2023-02-16 03:37:04,468 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-16 03:37:04,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 80 [2023-02-16 03:37:04,477 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:37:04,477 INFO L350 Elim1Store]: Elim1 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 71 treesize of output 70 [2023-02-16 03:37:04,624 INFO L350 Elim1Store]: Elim1 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 60 treesize of output 44 [2023-02-16 03:37:04,671 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 03:37:04,672 INFO L350 Elim1Store]: Elim1 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 60 treesize of output 23 [2023-02-16 03:37:04,677 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:37:04,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:37:04,789 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1592 (Array Int Int)) (v_ArrVal_1591 (Array Int Int))) (not (= 0 (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1591))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1592) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-02-16 03:37:04,793 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1592 (Array Int Int)) (v_ArrVal_1591 (Array Int Int))) (not (= 0 (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1591))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1592) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2023-02-16 03:37:04,800 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1586 (Array Int Int)) (v_ArrVal_1592 (Array Int Int)) (v_ArrVal_1591 (Array Int Int))) (not (= 0 (select (let ((.cse0 (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|) |c_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_1591))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1586) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1592) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-02-16 03:37:04,904 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:37:04,905 INFO L350 Elim1Store]: Elim1 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2023-02-16 03:37:05,161 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:37:05,162 INFO L350 Elim1Store]: Elim1 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 64 treesize of output 65 [2023-02-16 03:37:05,166 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:37:05,166 INFO L350 Elim1Store]: Elim1 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 68 treesize of output 61 [2023-02-16 03:37:05,173 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:37:05,174 INFO L350 Elim1Store]: Elim1 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 230 treesize of output 181 [2023-02-16 03:37:05,586 INFO L321 Elim1Store]: treesize reduction 294, result has 60.5 percent of original size [2023-02-16 03:37:05,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 4635 treesize of output 4604 [2023-02-16 03:37:05,658 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:37:05,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 4312 treesize of output 3528 [2023-02-16 03:37:05,707 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:37:05,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3441 treesize of output 3197 [2023-02-16 03:37:05,724 INFO L350 Elim1Store]: Elim1 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 219 treesize of output 181 [2023-02-16 03:37:05,740 INFO L350 Elim1Store]: Elim1 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 209 treesize of output 171