./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-buckets-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-buckets-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a4c2149f6fe1f453f0ff04220f5041f2227f6654d0fa84d48205415ce284fcb --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:09:46,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:09:46,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:09:46,900 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:09:46,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:09:46,902 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:09:46,903 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:09:46,905 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:09:46,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:09:46,909 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:09:46,910 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:09:46,912 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:09:46,912 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:09:46,918 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:09:46,919 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:09:46,921 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:09:46,922 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:09:46,923 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:09:46,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:09:46,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:09:46,929 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:09:46,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:09:46,930 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:09:46,931 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:09:46,932 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:09:46,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:09:46,937 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:09:46,938 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:09:46,939 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:09:46,939 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:09:46,940 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:09:46,940 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:09:46,941 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:09:46,942 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:09:46,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:09:46,943 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:09:46,944 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:09:46,944 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:09:46,944 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:09:46,944 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:09:46,945 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:09:46,946 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:09:46,947 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-07-20 05:09:46,968 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:09:46,969 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:09:46,969 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:09:46,969 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:09:46,970 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:09:46,970 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:09:46,970 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:09:46,970 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:09:46,970 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:09:46,971 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:09:46,971 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:09:46,971 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:09:46,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:09:46,972 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:09:46,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:09:46,972 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:09:46,972 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:09:46,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:09:46,972 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:09:46,972 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:09:46,972 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:09:46,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:09:46,973 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:09:46,973 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:09:46,973 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:09:46,973 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:09:46,973 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:09:46,973 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 05:09:46,974 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 05:09:46,974 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) 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 -> 5a4c2149f6fe1f453f0ff04220f5041f2227f6654d0fa84d48205415ce284fcb [2022-07-20 05:09:47,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:09:47,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:09:47,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:09:47,188 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:09:47,189 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:09:47,190 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-buckets-2.i [2022-07-20 05:09:47,270 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d42dfe74/3b1237a82f5a49ef9c2abee8008d2c52/FLAGb1d31018e [2022-07-20 05:09:47,684 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:09:47,685 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-2.i [2022-07-20 05:09:47,695 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d42dfe74/3b1237a82f5a49ef9c2abee8008d2c52/FLAGb1d31018e [2022-07-20 05:09:47,707 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d42dfe74/3b1237a82f5a49ef9c2abee8008d2c52 [2022-07-20 05:09:47,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:09:47,710 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:09:47,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:09:47,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:09:47,718 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:09:47,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:09:47" (1/1) ... [2022-07-20 05:09:47,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bd460fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:47, skipping insertion in model container [2022-07-20 05:09:47,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:09:47" (1/1) ... [2022-07-20 05:09:47,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:09:47,744 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:09:47,939 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-2.i[22663,22676] [2022-07-20 05:09:47,944 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-2.i[22734,22747] [2022-07-20 05:09:47,946 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-2.i[22862,22875] [2022-07-20 05:09:47,952 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-2.i[23275,23288] [2022-07-20 05:09:47,953 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-2.i[23364,23377] [2022-07-20 05:09:47,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:09:47,965 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:09:47,986 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-2.i[22663,22676] [2022-07-20 05:09:47,987 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-2.i[22734,22747] [2022-07-20 05:09:47,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-2.i[22862,22875] [2022-07-20 05:09:47,990 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-2.i[23275,23288] [2022-07-20 05:09:47,991 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-2.i[23364,23377] [2022-07-20 05:09:47,992 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:09:48,014 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:09:48,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:48 WrapperNode [2022-07-20 05:09:48,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:09:48,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:09:48,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:09:48,016 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:09:48,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:48" (1/1) ... [2022-07-20 05:09:48,048 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:48" (1/1) ... [2022-07-20 05:09:48,069 INFO L137 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 161 [2022-07-20 05:09:48,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:09:48,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:09:48,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:09:48,070 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:09:48,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:48" (1/1) ... [2022-07-20 05:09:48,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:48" (1/1) ... [2022-07-20 05:09:48,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:48" (1/1) ... [2022-07-20 05:09:48,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:48" (1/1) ... [2022-07-20 05:09:48,083 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:48" (1/1) ... [2022-07-20 05:09:48,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:48" (1/1) ... [2022-07-20 05:09:48,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:48" (1/1) ... [2022-07-20 05:09:48,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:09:48,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:09:48,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:09:48,094 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:09:48,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:48" (1/1) ... [2022-07-20 05:09:48,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:09:48,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:09:48,119 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 05:09:48,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 05:09:48,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 05:09:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 05:09:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 05:09:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 05:09:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 05:09:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 05:09:48,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:09:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 05:09:48,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:09:48,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:09:48,215 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:09:48,216 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:09:48,537 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:09:48,547 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:09:48,548 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2022-07-20 05:09:48,550 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:09:48 BoogieIcfgContainer [2022-07-20 05:09:48,550 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:09:48,552 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:09:48,552 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:09:48,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:09:48,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:09:47" (1/3) ... [2022-07-20 05:09:48,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352e87ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:09:48, skipping insertion in model container [2022-07-20 05:09:48,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:09:48" (2/3) ... [2022-07-20 05:09:48,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@352e87ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:09:48, skipping insertion in model container [2022-07-20 05:09:48,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:09:48" (3/3) ... [2022-07-20 05:09:48,557 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-buckets-2.i [2022-07-20 05:09:48,567 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:09:48,567 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2022-07-20 05:09:48,597 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:09:48,601 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5d6ceb5c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2349317 [2022-07-20 05:09:48,601 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2022-07-20 05:09:48,605 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 82 states have (on average 2.2195121951219514) internal successors, (182), 154 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:48,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 05:09:48,619 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:48,620 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 05:09:48,620 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 05:09:48,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:48,624 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-20 05:09:48,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:48,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135037035] [2022-07-20 05:09:48,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:48,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:48,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:09:48,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:48,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135037035] [2022-07-20 05:09:48,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135037035] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:48,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:48,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:09:48,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124401213] [2022-07-20 05:09:48,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:48,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:09:48,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:48,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:09:48,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:09:48,833 INFO L87 Difference]: Start difference. First operand has 155 states, 82 states have (on average 2.2195121951219514) internal successors, (182), 154 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:48,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:48,981 INFO L93 Difference]: Finished difference Result 190 states and 198 transitions. [2022-07-20 05:09:48,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:09:48,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-20 05:09:48,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:48,992 INFO L225 Difference]: With dead ends: 190 [2022-07-20 05:09:48,992 INFO L226 Difference]: Without dead ends: 186 [2022-07-20 05:09:48,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:09:48,997 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 141 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:48,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 120 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:49,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-07-20 05:09:49,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 149. [2022-07-20 05:09:49,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 81 states have (on average 1.9259259259259258) internal successors, (156), 148 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:49,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 156 transitions. [2022-07-20 05:09:49,044 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 156 transitions. Word has length 3 [2022-07-20 05:09:49,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:49,044 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 156 transitions. [2022-07-20 05:09:49,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:49,045 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2022-07-20 05:09:49,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 05:09:49,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:49,045 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 05:09:49,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 05:09:49,047 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 05:09:49,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:49,048 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-20 05:09:49,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:49,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772595178] [2022-07-20 05:09:49,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:49,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:49,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:09:49,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:49,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772595178] [2022-07-20 05:09:49,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772595178] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:49,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:49,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:09:49,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785730654] [2022-07-20 05:09:49,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:49,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:09:49,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:49,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:09:49,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:09:49,109 INFO L87 Difference]: Start difference. First operand 149 states and 156 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:49,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:49,205 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2022-07-20 05:09:49,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:09:49,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-20 05:09:49,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:49,209 INFO L225 Difference]: With dead ends: 185 [2022-07-20 05:09:49,209 INFO L226 Difference]: Without dead ends: 185 [2022-07-20 05:09:49,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:09:49,211 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 70 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:49,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 190 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:49,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-20 05:09:49,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 145. [2022-07-20 05:09:49,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 81 states have (on average 1.876543209876543) internal successors, (152), 144 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:49,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 152 transitions. [2022-07-20 05:09:49,232 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 152 transitions. Word has length 3 [2022-07-20 05:09:49,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:49,233 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 152 transitions. [2022-07-20 05:09:49,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:49,233 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 152 transitions. [2022-07-20 05:09:49,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 05:09:49,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:49,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:49,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 05:09:49,237 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 05:09:49,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:49,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924362, now seen corresponding path program 1 times [2022-07-20 05:09:49,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:49,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255484161] [2022-07-20 05:09:49,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:49,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:49,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:09:49,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:49,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255484161] [2022-07-20 05:09:49,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255484161] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:49,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:49,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:09:49,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549381625] [2022-07-20 05:09:49,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:49,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:09:49,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:49,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:09:49,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:09:49,307 INFO L87 Difference]: Start difference. First operand 145 states and 152 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:49,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:49,517 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2022-07-20 05:09:49,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:09:49,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-07-20 05:09:49,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:49,536 INFO L225 Difference]: With dead ends: 151 [2022-07-20 05:09:49,536 INFO L226 Difference]: Without dead ends: 151 [2022-07-20 05:09:49,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:09:49,537 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 97 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:49,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 305 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:09:49,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-20 05:09:49,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 143. [2022-07-20 05:09:49,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 90 states have (on average 1.7555555555555555) internal successors, (158), 142 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 158 transitions. [2022-07-20 05:09:49,542 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 158 transitions. Word has length 10 [2022-07-20 05:09:49,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:49,542 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 158 transitions. [2022-07-20 05:09:49,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:49,542 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 158 transitions. [2022-07-20 05:09:49,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 05:09:49,543 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:49,543 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:49,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 05:09:49,546 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 05:09:49,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:49,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924363, now seen corresponding path program 1 times [2022-07-20 05:09:49,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:49,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113882570] [2022-07-20 05:09:49,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:49,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:49,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:09:49,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:49,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113882570] [2022-07-20 05:09:49,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113882570] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:49,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:49,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:09:49,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077744476] [2022-07-20 05:09:49,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:49,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:09:49,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:49,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:09:49,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:09:49,635 INFO L87 Difference]: Start difference. First operand 143 states and 158 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:49,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:49,808 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2022-07-20 05:09:49,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:09:49,809 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-07-20 05:09:49,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:49,810 INFO L225 Difference]: With dead ends: 139 [2022-07-20 05:09:49,810 INFO L226 Difference]: Without dead ends: 139 [2022-07-20 05:09:49,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:09:49,816 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 6 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:49,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 416 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:49,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-20 05:09:49,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-07-20 05:09:49,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 90 states have (on average 1.711111111111111) internal successors, (154), 138 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:49,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2022-07-20 05:09:49,830 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 10 [2022-07-20 05:09:49,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:49,830 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2022-07-20 05:09:49,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:49,830 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2022-07-20 05:09:49,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 05:09:49,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:49,831 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:49,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 05:09:49,832 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 05:09:49,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:49,833 INFO L85 PathProgramCache]: Analyzing trace with hash 592229104, now seen corresponding path program 1 times [2022-07-20 05:09:49,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:49,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870287420] [2022-07-20 05:09:49,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:49,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:09:49,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:49,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870287420] [2022-07-20 05:09:49,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870287420] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:49,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:49,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:09:49,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159572749] [2022-07-20 05:09:49,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:49,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:09:49,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:49,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:09:49,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:09:49,935 INFO L87 Difference]: Start difference. First operand 139 states and 154 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:50,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:50,089 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2022-07-20 05:09:50,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:09:50,089 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-20 05:09:50,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:50,090 INFO L225 Difference]: With dead ends: 146 [2022-07-20 05:09:50,090 INFO L226 Difference]: Without dead ends: 146 [2022-07-20 05:09:50,090 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:09:50,091 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 94 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:50,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 297 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:50,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-20 05:09:50,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 138. [2022-07-20 05:09:50,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 90 states have (on average 1.7) internal successors, (153), 137 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:50,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 153 transitions. [2022-07-20 05:09:50,093 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 153 transitions. Word has length 17 [2022-07-20 05:09:50,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:50,094 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 153 transitions. [2022-07-20 05:09:50,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:50,094 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 153 transitions. [2022-07-20 05:09:50,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 05:09:50,094 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:50,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:50,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 05:09:50,094 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 05:09:50,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:50,095 INFO L85 PathProgramCache]: Analyzing trace with hash 592229105, now seen corresponding path program 1 times [2022-07-20 05:09:50,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:50,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337027489] [2022-07-20 05:09:50,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:50,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:50,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:09:50,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:50,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337027489] [2022-07-20 05:09:50,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337027489] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:50,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:50,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:09:50,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730219142] [2022-07-20 05:09:50,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:50,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:09:50,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:50,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:09:50,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:09:50,195 INFO L87 Difference]: Start difference. First operand 138 states and 153 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:50,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:50,332 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2022-07-20 05:09:50,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:09:50,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-20 05:09:50,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:50,333 INFO L225 Difference]: With dead ends: 138 [2022-07-20 05:09:50,333 INFO L226 Difference]: Without dead ends: 138 [2022-07-20 05:09:50,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:09:50,334 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 8 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:50,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 403 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:50,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-20 05:09:50,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2022-07-20 05:09:50,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 90 states have (on average 1.6666666666666667) internal successors, (150), 134 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:50,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2022-07-20 05:09:50,336 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 17 [2022-07-20 05:09:50,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:50,337 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2022-07-20 05:09:50,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:50,337 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2022-07-20 05:09:50,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 05:09:50,337 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:50,337 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:50,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 05:09:50,337 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 05:09:50,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:50,340 INFO L85 PathProgramCache]: Analyzing trace with hash 840457529, now seen corresponding path program 1 times [2022-07-20 05:09:50,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:50,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781831173] [2022-07-20 05:09:50,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:50,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:50,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:09:50,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:50,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781831173] [2022-07-20 05:09:50,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781831173] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:50,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:50,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:09:50,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928377524] [2022-07-20 05:09:50,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:50,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:09:50,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:50,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:09:50,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:09:50,428 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:50,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:50,478 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2022-07-20 05:09:50,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:09:50,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-20 05:09:50,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:50,479 INFO L225 Difference]: With dead ends: 141 [2022-07-20 05:09:50,480 INFO L226 Difference]: Without dead ends: 141 [2022-07-20 05:09:50,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:09:50,481 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 67 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:50,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 143 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:09:50,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-20 05:09:50,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2022-07-20 05:09:50,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 90 states have (on average 1.6111111111111112) internal successors, (145), 129 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:50,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 145 transitions. [2022-07-20 05:09:50,485 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 145 transitions. Word has length 23 [2022-07-20 05:09:50,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:50,485 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 145 transitions. [2022-07-20 05:09:50,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:50,485 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 145 transitions. [2022-07-20 05:09:50,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 05:09:50,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:50,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:50,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 05:09:50,487 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 05:09:50,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:50,487 INFO L85 PathProgramCache]: Analyzing trace with hash 840457530, now seen corresponding path program 1 times [2022-07-20 05:09:50,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:50,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359884519] [2022-07-20 05:09:50,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:50,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:09:50,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:50,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359884519] [2022-07-20 05:09:50,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359884519] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:50,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:50,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:09:50,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807303952] [2022-07-20 05:09:50,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:50,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:09:50,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:50,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:09:50,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:09:50,546 INFO L87 Difference]: Start difference. First operand 130 states and 145 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:50,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:50,597 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2022-07-20 05:09:50,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:09:50,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-20 05:09:50,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:50,598 INFO L225 Difference]: With dead ends: 136 [2022-07-20 05:09:50,598 INFO L226 Difference]: Without dead ends: 136 [2022-07-20 05:09:50,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:09:50,599 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 62 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:50,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 144 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:09:50,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-20 05:09:50,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 125. [2022-07-20 05:09:50,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 90 states have (on average 1.5555555555555556) internal successors, (140), 124 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:50,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 140 transitions. [2022-07-20 05:09:50,602 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 140 transitions. Word has length 23 [2022-07-20 05:09:50,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:50,603 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 140 transitions. [2022-07-20 05:09:50,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:50,603 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 140 transitions. [2022-07-20 05:09:50,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 05:09:50,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:50,604 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] [2022-07-20 05:09:50,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 05:09:50,604 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 05:09:50,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:50,605 INFO L85 PathProgramCache]: Analyzing trace with hash 225913191, now seen corresponding path program 1 times [2022-07-20 05:09:50,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:50,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538007024] [2022-07-20 05:09:50,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:50,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:09:50,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:50,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538007024] [2022-07-20 05:09:50,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538007024] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:50,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:50,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:09:50,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878086809] [2022-07-20 05:09:50,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:50,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:09:50,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:50,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:09:50,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:09:50,672 INFO L87 Difference]: Start difference. First operand 125 states and 140 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:50,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:50,787 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2022-07-20 05:09:50,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:09:50,787 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-20 05:09:50,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:50,788 INFO L225 Difference]: With dead ends: 175 [2022-07-20 05:09:50,788 INFO L226 Difference]: Without dead ends: 175 [2022-07-20 05:09:50,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:09:50,789 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 215 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:50,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 162 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:50,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-20 05:09:50,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 132. [2022-07-20 05:09:50,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 97 states have (on average 1.5670103092783505) internal successors, (152), 131 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 152 transitions. [2022-07-20 05:09:50,792 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 152 transitions. Word has length 25 [2022-07-20 05:09:50,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:50,792 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 152 transitions. [2022-07-20 05:09:50,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:50,793 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 152 transitions. [2022-07-20 05:09:50,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 05:09:50,793 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:50,793 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] [2022-07-20 05:09:50,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 05:09:50,794 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 05:09:50,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:50,794 INFO L85 PathProgramCache]: Analyzing trace with hash 225913192, now seen corresponding path program 1 times [2022-07-20 05:09:50,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:50,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522092291] [2022-07-20 05:09:50,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:50,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:09:50,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:50,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522092291] [2022-07-20 05:09:50,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522092291] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:50,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:50,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:09:50,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668998062] [2022-07-20 05:09:50,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:50,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:09:50,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:50,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:09:50,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:09:50,897 INFO L87 Difference]: Start difference. First operand 132 states and 152 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:51,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:51,134 INFO L93 Difference]: Finished difference Result 226 states and 250 transitions. [2022-07-20 05:09:51,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:09:51,135 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-20 05:09:51,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:51,137 INFO L225 Difference]: With dead ends: 226 [2022-07-20 05:09:51,137 INFO L226 Difference]: Without dead ends: 226 [2022-07-20 05:09:51,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:09:51,138 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 255 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:51,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 246 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:09:51,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-07-20 05:09:51,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 170. [2022-07-20 05:09:51,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 135 states have (on average 1.548148148148148) internal successors, (209), 169 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:51,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 209 transitions. [2022-07-20 05:09:51,142 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 209 transitions. Word has length 25 [2022-07-20 05:09:51,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:51,143 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 209 transitions. [2022-07-20 05:09:51,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:51,143 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 209 transitions. [2022-07-20 05:09:51,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 05:09:51,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:51,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:51,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 05:09:51,144 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 05:09:51,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:51,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1586624732, now seen corresponding path program 1 times [2022-07-20 05:09:51,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:51,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47763015] [2022-07-20 05:09:51,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:51,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:51,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:51,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:09:51,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:51,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47763015] [2022-07-20 05:09:51,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47763015] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:51,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:51,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:09:51,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295080652] [2022-07-20 05:09:51,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:51,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:09:51,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:51,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:09:51,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:09:51,180 INFO L87 Difference]: Start difference. First operand 170 states and 209 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:51,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:51,241 INFO L93 Difference]: Finished difference Result 210 states and 242 transitions. [2022-07-20 05:09:51,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:09:51,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-20 05:09:51,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:51,243 INFO L225 Difference]: With dead ends: 210 [2022-07-20 05:09:51,243 INFO L226 Difference]: Without dead ends: 210 [2022-07-20 05:09:51,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:09:51,244 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 188 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:51,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 217 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:51,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-07-20 05:09:51,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 168. [2022-07-20 05:09:51,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 134 states have (on average 1.5298507462686568) internal successors, (205), 167 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:51,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 205 transitions. [2022-07-20 05:09:51,248 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 205 transitions. Word has length 26 [2022-07-20 05:09:51,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:51,248 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 205 transitions. [2022-07-20 05:09:51,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 205 transitions. [2022-07-20 05:09:51,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 05:09:51,249 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:51,249 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:51,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 05:09:51,249 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 05:09:51,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:51,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1044883735, now seen corresponding path program 1 times [2022-07-20 05:09:51,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:51,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733069669] [2022-07-20 05:09:51,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:51,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:51,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:09:51,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:51,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733069669] [2022-07-20 05:09:51,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733069669] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:51,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:51,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-20 05:09:51,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436122717] [2022-07-20 05:09:51,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:51,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-20 05:09:51,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:51,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-20 05:09:51,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-07-20 05:09:51,541 INFO L87 Difference]: Start difference. First operand 168 states and 205 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:52,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:52,131 INFO L93 Difference]: Finished difference Result 198 states and 231 transitions. [2022-07-20 05:09:52,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-20 05:09:52,132 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-20 05:09:52,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:52,133 INFO L225 Difference]: With dead ends: 198 [2022-07-20 05:09:52,133 INFO L226 Difference]: Without dead ends: 198 [2022-07-20 05:09:52,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=240, Invalid=950, Unknown=0, NotChecked=0, Total=1190 [2022-07-20 05:09:52,134 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 192 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:52,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 688 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:09:52,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-07-20 05:09:52,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 174. [2022-07-20 05:09:52,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 141 states have (on average 1.4822695035460993) internal successors, (209), 173 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:52,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 209 transitions. [2022-07-20 05:09:52,137 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 209 transitions. Word has length 29 [2022-07-20 05:09:52,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:52,137 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 209 transitions. [2022-07-20 05:09:52,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:52,137 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 209 transitions. [2022-07-20 05:09:52,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 05:09:52,138 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:52,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:52,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 05:09:52,138 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 05:09:52,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:52,138 INFO L85 PathProgramCache]: Analyzing trace with hash 981328753, now seen corresponding path program 1 times [2022-07-20 05:09:52,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:52,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763228532] [2022-07-20 05:09:52,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:52,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:52,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:09:52,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:52,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763228532] [2022-07-20 05:09:52,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763228532] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:52,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:52,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:09:52,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352564241] [2022-07-20 05:09:52,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:52,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:09:52,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:52,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:09:52,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:09:52,184 INFO L87 Difference]: Start difference. First operand 174 states and 209 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:52,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:52,199 INFO L93 Difference]: Finished difference Result 172 states and 207 transitions. [2022-07-20 05:09:52,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:09:52,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-20 05:09:52,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:52,200 INFO L225 Difference]: With dead ends: 172 [2022-07-20 05:09:52,200 INFO L226 Difference]: Without dead ends: 172 [2022-07-20 05:09:52,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:09:52,201 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 46 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:52,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 174 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:09:52,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-20 05:09:52,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2022-07-20 05:09:52,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 140 states have (on average 1.4785714285714286) internal successors, (207), 171 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:52,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 207 transitions. [2022-07-20 05:09:52,206 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 207 transitions. Word has length 31 [2022-07-20 05:09:52,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:52,207 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 207 transitions. [2022-07-20 05:09:52,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:52,207 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 207 transitions. [2022-07-20 05:09:52,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-20 05:09:52,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:52,210 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:52,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 05:09:52,210 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 05:09:52,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:52,210 INFO L85 PathProgramCache]: Analyzing trace with hash 873646240, now seen corresponding path program 1 times [2022-07-20 05:09:52,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:52,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353575085] [2022-07-20 05:09:52,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:52,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:52,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:09:52,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:52,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353575085] [2022-07-20 05:09:52,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353575085] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:52,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:09:52,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:09:52,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112537747] [2022-07-20 05:09:52,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:52,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:09:52,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:52,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:09:52,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:09:52,286 INFO L87 Difference]: Start difference. First operand 172 states and 207 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:52,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:52,365 INFO L93 Difference]: Finished difference Result 209 states and 238 transitions. [2022-07-20 05:09:52,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:09:52,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2022-07-20 05:09:52,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:52,367 INFO L225 Difference]: With dead ends: 209 [2022-07-20 05:09:52,367 INFO L226 Difference]: Without dead ends: 209 [2022-07-20 05:09:52,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:09:52,368 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 169 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:52,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 216 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:09:52,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-07-20 05:09:52,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 174. [2022-07-20 05:09:52,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 142 states have (on average 1.471830985915493) internal successors, (209), 173 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:52,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 209 transitions. [2022-07-20 05:09:52,372 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 209 transitions. Word has length 35 [2022-07-20 05:09:52,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:52,373 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 209 transitions. [2022-07-20 05:09:52,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:52,373 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 209 transitions. [2022-07-20 05:09:52,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 05:09:52,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:52,377 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:52,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 05:09:52,378 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 05:09:52,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:52,378 INFO L85 PathProgramCache]: Analyzing trace with hash 124937643, now seen corresponding path program 1 times [2022-07-20 05:09:52,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:52,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056056234] [2022-07-20 05:09:52,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:52,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:52,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:09:52,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:52,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056056234] [2022-07-20 05:09:52,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056056234] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:09:52,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705989153] [2022-07-20 05:09:52,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:52,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:09:52,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:09:52,701 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:09:52,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 05:09:52,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:52,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 49 conjunts are in the unsatisfiable core [2022-07-20 05:09:52,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:09:52,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:09:52,987 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:09:52,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:09:53,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:09:53,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:09:53,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:09:53,066 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 05:09:53,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 05:09:53,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 05:09:53,268 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 05:09:53,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2022-07-20 05:09:53,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-20 05:09:53,350 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 05:09:53,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2022-07-20 05:09:53,395 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 05:09:53,395 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2022-07-20 05:09:53,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-20 05:09:53,465 INFO L356 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-07-20 05:09:53,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2022-07-20 05:09:53,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-20 05:09:53,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-20 05:09:53,600 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:09:53,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 05:09:53,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:09:53,647 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:09:53,792 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_32| Int) (v_ArrVal_804 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_48| Int) (v_ArrVal_802 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_32|) 0)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_48| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_802) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_804) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) 1))) is different from false [2022-07-20 05:09:53,836 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_801 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_32| Int) (v_ArrVal_804 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_48| Int) (v_ArrVal_802 Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_802) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_801) |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_804) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) 1) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_32|) 0)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_48| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) is different from false [2022-07-20 05:09:53,876 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_801 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_32| Int) (v_ArrVal_804 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_48| Int) (v_ArrVal_802 Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_802) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_801) |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_804) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) 1) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_32|) 0)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_48| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) is different from false [2022-07-20 05:09:53,890 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_801 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_32| Int) (v_ArrVal_804 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_48| Int) (v_ArrVal_802 Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_32|) 0)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_48| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_802) (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_801) |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_804) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) 1))) is different from false [2022-07-20 05:09:53,973 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_796 Int) (v_ArrVal_801 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_32| Int) (v_ArrVal_804 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_48| Int) (v_ArrVal_802 Int) (|v_ULTIMATE.start_main_#t~malloc4#1.base_6| Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_6| v_ArrVal_796))) (or (not (= 0 (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_32|))) (= (select (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_802) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |ULTIMATE.start_main_~bcki~0#1.offset| |v_ULTIMATE.start_main_#t~malloc4#1.base_6|)) |v_ULTIMATE.start_main_#t~malloc4#1.base_6| v_ArrVal_801) |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_804) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) 1) (not (= (select .cse0 |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_48| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_6|) 0))))) is different from false [2022-07-20 05:09:53,987 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:09:53,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2022-07-20 05:09:54,001 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_796 Int) (v_ArrVal_801 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_32| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_48| Int) (v_ArrVal_802 Int)) (let ((.cse1 (select v_arrayElimArr_1 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse0 (store |c_#valid| .cse1 v_ArrVal_796))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_32|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) (= (select (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_802) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_1) .cse1 v_ArrVal_801) |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_804) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) 1) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_48| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select |c_#valid| .cse1) 0)) (not (= (select .cse0 |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)))))) is different from false [2022-07-20 05:09:54,039 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_796 Int) (v_ArrVal_801 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_32| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_48| Int) (v_ArrVal_802 Int)) (let ((.cse1 (select v_arrayElimArr_1 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse0 (store |c_#valid| .cse1 v_ArrVal_796))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_32|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) (= (select (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_802) (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_1) .cse1 v_ArrVal_801) |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_804) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) 1) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_48| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select .cse0 |c_ULTIMATE.start_main_#t~mem3#1.base|) 1)) (not (= (select |c_#valid| .cse1) 0)))))) is different from false [2022-07-20 05:09:54,058 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_796 Int) (v_ArrVal_801 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_32| Int) (v_arrayElimArr_1 (Array Int Int)) (v_ArrVal_804 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_48| Int) (v_ArrVal_802 Int)) (let ((.cse2 (select v_arrayElimArr_1 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse0 (store |c_#valid| .cse2 v_ArrVal_796)) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_32|) 0)) (not (= (select .cse0 .cse1) 1)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_48| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select |c_#valid| .cse2) 0)) (= (select (store .cse0 |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_802) (select (select (store (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_1) .cse2 v_ArrVal_801) |v_ULTIMATE.start_main_~item~0#1.base_32| v_ArrVal_804) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_48|)) 1))))) is different from false [2022-07-20 05:09:54,090 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:09:54,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-07-20 05:09:54,094 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:09:54,095 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:09:54,101 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:09:54,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 50 [2022-07-20 05:09:54,109 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:09:54,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 64 [2022-07-20 05:09:54,202 INFO L356 Elim1Store]: treesize reduction 27, result has 77.7 percent of original size [2022-07-20 05:09:54,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 283 [2022-07-20 05:09:55,333 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:09:55,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705989153] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:09:55,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:09:55,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 42 [2022-07-20 05:09:55,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222117007] [2022-07-20 05:09:55,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:09:55,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-20 05:09:55,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:55,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-20 05:09:55,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1031, Unknown=10, NotChecked=584, Total=1806 [2022-07-20 05:09:55,336 INFO L87 Difference]: Start difference. First operand 174 states and 209 transitions. Second operand has 43 states, 42 states have (on average 2.357142857142857) internal successors, (99), 43 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:56,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:56,451 INFO L93 Difference]: Finished difference Result 279 states and 314 transitions. [2022-07-20 05:09:56,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-20 05:09:56,451 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.357142857142857) internal successors, (99), 43 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-20 05:09:56,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:56,452 INFO L225 Difference]: With dead ends: 279 [2022-07-20 05:09:56,452 INFO L226 Difference]: Without dead ends: 279 [2022-07-20 05:09:56,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 60 SyntacticMatches, 9 SemanticMatches, 61 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=496, Invalid=2496, Unknown=10, NotChecked=904, Total=3906 [2022-07-20 05:09:56,454 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 974 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 974 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 3218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2100 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:56,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [974 Valid, 1251 Invalid, 3218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 986 Invalid, 0 Unknown, 2100 Unchecked, 0.5s Time] [2022-07-20 05:09:56,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-07-20 05:09:56,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 192. [2022-07-20 05:09:56,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 160 states have (on average 1.44375) internal successors, (231), 191 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:56,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 231 transitions. [2022-07-20 05:09:56,457 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 231 transitions. Word has length 37 [2022-07-20 05:09:56,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:56,457 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 231 transitions. [2022-07-20 05:09:56,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.357142857142857) internal successors, (99), 43 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:56,457 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 231 transitions. [2022-07-20 05:09:56,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 05:09:56,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:56,458 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:09:56,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 05:09:56,661 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,SelfDestructingSolverStorable14 [2022-07-20 05:09:56,661 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 05:09:56,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:56,662 INFO L85 PathProgramCache]: Analyzing trace with hash 124937644, now seen corresponding path program 1 times [2022-07-20 05:09:56,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:56,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973613258] [2022-07-20 05:09:56,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:56,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:57,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:09:57,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:57,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973613258] [2022-07-20 05:09:57,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973613258] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:09:57,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835030054] [2022-07-20 05:09:57,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:57,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:09:57,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:09:57,046 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:09:57,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 05:09:57,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:57,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-20 05:09:57,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:09:57,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:09:57,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:09:57,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:09:57,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 05:09:57,217 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:09:57,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:09:57,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:09:57,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 05:09:57,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:09:57,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-20 05:09:57,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:09:57,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:09:57,351 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 05:09:57,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 05:09:57,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:09:57,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:09:57,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 05:09:57,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:09:57,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:09:57,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:09:57,583 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-20 05:09:57,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:09:57,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:09:57,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 05:09:57,730 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:09:57,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 35 treesize of output 23 [2022-07-20 05:09:57,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:09:57,784 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 05:09:57,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835030054] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:09:57,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 05:09:57,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [17] total 34 [2022-07-20 05:09:57,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526520808] [2022-07-20 05:09:57,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:09:57,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-20 05:09:57,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:09:57,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-20 05:09:57,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2022-07-20 05:09:57,786 INFO L87 Difference]: Start difference. First operand 192 states and 231 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:58,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:09:58,395 INFO L93 Difference]: Finished difference Result 204 states and 243 transitions. [2022-07-20 05:09:58,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 05:09:58,396 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-20 05:09:58,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:09:58,397 INFO L225 Difference]: With dead ends: 204 [2022-07-20 05:09:58,397 INFO L226 Difference]: Without dead ends: 203 [2022-07-20 05:09:58,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=255, Invalid=1907, Unknown=0, NotChecked=0, Total=2162 [2022-07-20 05:09:58,398 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 61 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:09:58,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 764 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 618 Invalid, 0 Unknown, 103 Unchecked, 0.3s Time] [2022-07-20 05:09:58,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-07-20 05:09:58,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 200. [2022-07-20 05:09:58,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 168 states have (on average 1.4226190476190477) internal successors, (239), 199 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:58,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 239 transitions. [2022-07-20 05:09:58,402 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 239 transitions. Word has length 37 [2022-07-20 05:09:58,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:09:58,402 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 239 transitions. [2022-07-20 05:09:58,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 19 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:09:58,402 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 239 transitions. [2022-07-20 05:09:58,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 05:09:58,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:09:58,403 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] [2022-07-20 05:09:58,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 05:09:58,607 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,SelfDestructingSolverStorable15 [2022-07-20 05:09:58,607 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 05:09:58,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:09:58,608 INFO L85 PathProgramCache]: Analyzing trace with hash -706370693, now seen corresponding path program 1 times [2022-07-20 05:09:58,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:09:58,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185743870] [2022-07-20 05:09:58,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:58,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:09:58,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:58,850 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:09:58,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:09:58,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185743870] [2022-07-20 05:09:58,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185743870] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:09:58,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353518758] [2022-07-20 05:09:58,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:09:58,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:09:58,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:09:58,864 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:09:58,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 05:09:58,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:09:58,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-20 05:09:58,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:09:58,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:09:59,003 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:09:59,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:09:59,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:09:59,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:09:59,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:09:59,083 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:09:59,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:09:59,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 05:09:59,171 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 05:09:59,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2022-07-20 05:09:59,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-20 05:09:59,233 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 05:09:59,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2022-07-20 05:09:59,271 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 05:09:59,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2022-07-20 05:09:59,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-20 05:09:59,343 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 05:09:59,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2022-07-20 05:09:59,462 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:09:59,465 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:09:59,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-07-20 05:09:59,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-20 05:09:59,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:09:59,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:09:59,930 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:09:59,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 51 [2022-07-20 05:10:00,108 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:00,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 05:10:00,115 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:00,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-20 05:10:04,476 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:04,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-20 05:10:04,478 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:04,483 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:04,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2022-07-20 05:10:04,489 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:04,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2022-07-20 05:10:04,505 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:04,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 05:10:04,507 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:04,512 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:04,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2022-07-20 05:10:04,517 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:04,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2022-07-20 05:10:04,539 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:04,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 56 [2022-07-20 05:10:06,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:10:06,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353518758] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:10:06,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:10:06,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 17] total 36 [2022-07-20 05:10:06,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165103823] [2022-07-20 05:10:06,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:10:06,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-20 05:10:06,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:10:06,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-20 05:10:06,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1168, Unknown=24, NotChecked=0, Total=1332 [2022-07-20 05:10:06,629 INFO L87 Difference]: Start difference. First operand 200 states and 239 transitions. Second operand has 37 states, 36 states have (on average 2.388888888888889) internal successors, (86), 37 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:10:07,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:10:07,390 INFO L93 Difference]: Finished difference Result 214 states and 253 transitions. [2022-07-20 05:10:07,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-20 05:10:07,391 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.388888888888889) internal successors, (86), 37 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-20 05:10:07,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:10:07,391 INFO L225 Difference]: With dead ends: 214 [2022-07-20 05:10:07,391 INFO L226 Difference]: Without dead ends: 214 [2022-07-20 05:10:07,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 754 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=340, Invalid=2186, Unknown=24, NotChecked=0, Total=2550 [2022-07-20 05:10:07,392 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 182 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 1674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 864 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:10:07,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 1191 Invalid, 1674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 773 Invalid, 0 Unknown, 864 Unchecked, 0.3s Time] [2022-07-20 05:10:07,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-20 05:10:07,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 210. [2022-07-20 05:10:07,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 178 states have (on average 1.4101123595505618) internal successors, (251), 209 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:10:07,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 251 transitions. [2022-07-20 05:10:07,397 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 251 transitions. Word has length 38 [2022-07-20 05:10:07,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:10:07,397 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 251 transitions. [2022-07-20 05:10:07,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.388888888888889) internal successors, (86), 37 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:10:07,397 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 251 transitions. [2022-07-20 05:10:07,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 05:10:07,397 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:10:07,397 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] [2022-07-20 05:10:07,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 05:10:07,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:10:07,607 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 05:10:07,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:10:07,608 INFO L85 PathProgramCache]: Analyzing trace with hash -706370692, now seen corresponding path program 1 times [2022-07-20 05:10:07,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:10:07,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296546198] [2022-07-20 05:10:07,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:10:07,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:10:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:10:07,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:10:07,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:10:07,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296546198] [2022-07-20 05:10:07,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296546198] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:10:07,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96643936] [2022-07-20 05:10:07,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:10:07,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:10:07,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:10:07,905 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:10:07,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 05:10:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:10:08,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 67 conjunts are in the unsatisfiable core [2022-07-20 05:10:08,021 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:10:08,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:10:08,040 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 05:10:08,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 05:10:08,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:10:08,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:10:08,157 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:10:08,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 05:10:08,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:08,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:10:08,210 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:10:08,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 05:10:08,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:08,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:10:08,243 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:10:08,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-20 05:10:08,258 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-20 05:10:08,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-07-20 05:10:08,302 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-20 05:10:08,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2022-07-20 05:10:08,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:10:08,451 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-20 05:10:08,451 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 55 [2022-07-20 05:10:08,476 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:10:08,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-20 05:10:08,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 05:10:08,524 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-20 05:10:08,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 55 [2022-07-20 05:10:08,541 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:10:08,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-20 05:10:08,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 05:10:08,590 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-20 05:10:08,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 63 [2022-07-20 05:10:08,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-20 05:10:08,757 INFO L356 Elim1Store]: treesize reduction 54, result has 28.0 percent of original size [2022-07-20 05:10:08,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 52 [2022-07-20 05:10:08,825 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 05:10:08,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2022-07-20 05:10:09,053 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:09,056 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 05:10:09,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 26 [2022-07-20 05:10:09,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:09,060 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:10:09,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:10:09,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:10:09,337 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (or (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1273) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|))) (and (<= 0 (+ .cse0 4)) (<= (+ .cse0 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|))))) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_59| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_59|)))) is different from false [2022-07-20 05:10:09,759 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:09,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2022-07-20 05:10:09,897 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:09,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 110 [2022-07-20 05:10:09,911 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:09,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 70 [2022-07-20 05:10:09,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-07-20 05:10:09,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-07-20 05:10:09,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-07-20 05:10:09,992 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-07-20 05:10:10,010 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-07-20 05:10:10,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-07-20 05:10:10,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-07-20 05:10:10,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-07-20 05:10:10,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-07-20 05:10:10,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-07-20 05:10:10,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-07-20 05:10:10,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-07-20 05:10:10,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-07-20 05:10:10,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-07-20 05:10:10,224 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_arrayElimArr_8 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int)) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_59| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_59|)) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (and (forall ((v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1267) (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1273) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) (+ 4 |ULTIMATE.start_main_~bcki~0#1.offset|))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_prenex_3) (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|) v_prenex_4) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) 4))) (forall ((v_ArrVal_1274 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_8) (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) |c_ULTIMATE.start_main_~bcki~0#1.base|)) (forall ((v_ArrVal_1274 (Array Int Int))) (not (let ((.cse0 (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_8) .cse0 v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) .cse0))))) (not (= 0 (select |c_#valid| (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|)))))) is different from false [2022-07-20 05:10:10,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-07-20 05:10:10,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-07-20 05:10:10,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-07-20 05:10:10,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-07-20 05:10:10,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-07-20 05:10:10,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-07-20 05:10:10,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-07-20 05:10:10,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-07-20 05:10:10,402 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_arrayElimArr_8 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int)) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_59| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_59|)) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (not (= 0 (select |c_#valid| (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (and (forall ((v_ArrVal_1274 (Array Int Int))) (not (let ((.cse0 (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_8) .cse0 v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|))))) (forall ((v_ArrVal_1274 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem3#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_8) (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|))) (forall ((v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_ArrVal_1267) (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1273) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) (+ 4 |ULTIMATE.start_main_~bcki~0#1.offset|))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_prenex_3) (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|) v_prenex_4) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) 4)))))) is different from false [2022-07-20 05:10:10,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-20 05:10:10,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-20 05:10:10,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-20 05:10:10,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-20 05:10:10,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-20 05:10:10,490 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-20 05:10:10,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-20 05:10:10,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-20 05:10:10,562 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_arrayElimArr_8 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int)) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_59| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (and (forall ((v_ArrVal_1274 (Array Int Int))) (not (let ((.cse0 (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_arrayElimArr_8) .cse0 v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) .cse0)))) (forall ((v_ArrVal_1274 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_8) (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) .cse1))) (forall ((v_ArrVal_1267 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (<= (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_1267) (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1273) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) (+ 4 |ULTIMATE.start_main_~bcki~0#1.offset|))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_prenex_3) (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|) v_prenex_4) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) 4)))) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_59|)) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (not (= 0 (select |c_#valid| (select v_arrayElimArr_8 |ULTIMATE.start_main_~bcki~0#1.offset|)))))) is different from false [2022-07-20 05:10:10,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-20 05:10:10,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-20 05:10:10,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-20 05:10:10,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-20 05:10:10,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-20 05:10:10,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-20 05:10:10,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-20 05:10:10,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-07-20 05:10:10,700 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:10,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-07-20 05:10:10,702 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:10,706 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:10,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2022-07-20 05:10:10,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-20 05:10:10,718 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:10,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-20 05:10:10,719 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:10,720 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:10,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-20 05:10:10,726 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:10,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2022-07-20 05:10:10,727 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:10,728 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:10,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-20 05:10:10,735 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 05:10:10,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 1 [2022-07-20 05:10:10,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2022-07-20 05:10:10,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:10:10,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96643936] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:10:10,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:10:10,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 45 [2022-07-20 05:10:10,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769837619] [2022-07-20 05:10:10,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:10:10,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-20 05:10:10,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:10:10,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-20 05:10:10,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1533, Unknown=13, NotChecked=332, Total=2070 [2022-07-20 05:10:10,909 INFO L87 Difference]: Start difference. First operand 210 states and 251 transitions. Second operand has 46 states, 45 states have (on average 2.466666666666667) internal successors, (111), 46 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:10:11,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:10:11,805 INFO L93 Difference]: Finished difference Result 261 states and 296 transitions. [2022-07-20 05:10:11,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-20 05:10:11,805 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.466666666666667) internal successors, (111), 46 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-20 05:10:11,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:10:11,806 INFO L225 Difference]: With dead ends: 261 [2022-07-20 05:10:11,806 INFO L226 Difference]: Without dead ends: 261 [2022-07-20 05:10:11,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=420, Invalid=2887, Unknown=15, NotChecked=460, Total=3782 [2022-07-20 05:10:11,807 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 219 mSDsluCounter, 1204 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 1992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1310 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:10:11,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1285 Invalid, 1992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 636 Invalid, 0 Unknown, 1310 Unchecked, 0.3s Time] [2022-07-20 05:10:11,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-07-20 05:10:11,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 233. [2022-07-20 05:10:11,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 204 states have (on average 1.411764705882353) internal successors, (288), 232 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:10:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 288 transitions. [2022-07-20 05:10:11,811 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 288 transitions. Word has length 38 [2022-07-20 05:10:11,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:10:11,811 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 288 transitions. [2022-07-20 05:10:11,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.466666666666667) internal successors, (111), 46 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:10:11,811 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 288 transitions. [2022-07-20 05:10:11,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 05:10:11,811 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:10:11,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:10:11,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-20 05:10:12,019 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,SelfDestructingSolverStorable17 [2022-07-20 05:10:12,019 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 05:10:12,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:10:12,020 INFO L85 PathProgramCache]: Analyzing trace with hash 448725100, now seen corresponding path program 1 times [2022-07-20 05:10:12,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:10:12,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176264639] [2022-07-20 05:10:12,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:10:12,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:10:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:10:12,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:10:12,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:10:12,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176264639] [2022-07-20 05:10:12,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176264639] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:10:12,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678942668] [2022-07-20 05:10:12,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:10:12,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:10:12,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:10:12,406 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:10:12,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 05:10:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:10:12,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-20 05:10:12,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:10:12,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:10:12,556 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 05:10:12,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 05:10:12,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:10:12,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:10:12,702 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:10:12,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-20 05:10:12,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 05:10:12,716 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:10:12,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 05:10:12,771 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:10:12,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-20 05:10:12,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 05:10:12,785 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:10:12,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 05:10:12,812 INFO L356 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-07-20 05:10:12,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2022-07-20 05:10:12,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 [2022-07-20 05:10:12,882 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-20 05:10:12,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 31 [2022-07-20 05:10:12,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:10:13,080 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-20 05:10:13,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 69 [2022-07-20 05:10:13,106 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:10:13,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-20 05:10:13,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 05:10:13,171 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-20 05:10:13,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 69 [2022-07-20 05:10:13,196 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:10:13,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-20 05:10:13,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 05:10:13,249 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-20 05:10:13,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 77 [2022-07-20 05:10:13,254 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-20 05:10:13,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:13,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 18 treesize of output 20 [2022-07-20 05:10:13,357 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-20 05:10:13,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-07-20 05:10:13,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:10:13,414 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 05:10:13,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 62 [2022-07-20 05:10:13,494 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 05:10:13,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 62 [2022-07-20 05:10:13,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:10:13,668 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:13,671 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 05:10:13,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 26 [2022-07-20 05:10:13,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:13,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:10:13,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:10:13,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:10:13,834 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_65| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_65|)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|))) (and (<= (+ 12 .cse0) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|))) (<= 0 (+ 8 .cse0)))))) is different from false [2022-07-20 05:10:14,183 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1446 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int)) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_65| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (and (forall ((v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1448 Int)) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1446) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1452) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) 12) (select (store |c_#length| |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1448) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1447) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|)))) (forall ((v_ArrVal_1452 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1446) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1452) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) 8)))) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_65|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_41|) 0)))) is different from false [2022-07-20 05:10:16,280 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:16,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2022-07-20 05:10:16,575 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:16,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 502 treesize of output 488 [2022-07-20 05:10:16,657 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:16,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 99 [2022-07-20 05:10:16,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-07-20 05:10:16,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-07-20 05:10:16,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-07-20 05:10:16,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-07-20 05:10:16,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-07-20 05:10:16,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-07-20 05:10:17,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-07-20 05:10:17,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-07-20 05:10:17,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-07-20 05:10:17,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-07-20 05:10:17,281 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-07-20 05:10:17,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-07-20 05:10:17,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-07-20 05:10:17,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-07-20 05:10:17,488 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int)) (let ((.cse1 (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse2 (store |c_#valid| .cse1 1))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_65| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_65|)) (and (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_14) (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1447) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) |c_ULTIMATE.start_main_~bcki~0#1.base|)) (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (not (let ((.cse0 (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|))) (= .cse0 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_14) .cse0 v_ArrVal_1447) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|))))) (forall ((v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_26 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_prenex_25) (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|) v_prenex_24) |v_ULTIMATE.start_main_~item~0#1.base_41| v_prenex_26) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) 8))) (forall ((v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1441 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1441) (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1446) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1452) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_14) (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1447) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) |v_ULTIMATE.start_main_~item~0#1.base_41|)))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (not (= (select |c_#valid| .cse1) 0)) (not (= 0 (select .cse2 |v_ULTIMATE.start_main_~item~0#1.base_41|))) (not (= (select .cse2 |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)))))) is different from false [2022-07-20 05:10:17,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-07-20 05:10:17,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-07-20 05:10:17,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-07-20 05:10:17,627 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-07-20 05:10:17,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-07-20 05:10:17,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-07-20 05:10:17,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-07-20 05:10:17,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-07-20 05:10:17,915 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int)) (let ((.cse0 (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse1 (store |c_#valid| .cse0 1))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_65| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_65|)) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (not (= (select |c_#valid| .cse0) 0)) (not (= (select .cse1 |c_ULTIMATE.start_main_#t~mem3#1.base|) 1)) (not (= 0 (select .cse1 |v_ULTIMATE.start_main_~item~0#1.base_41|))) (and (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_14) (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1447) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) |v_ULTIMATE.start_main_~item~0#1.base_41|))) (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem3#1.base| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_14) (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1447) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|))) (forall ((v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1441 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_ArrVal_1441) (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1446) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1452) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_26 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_prenex_25) (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|) v_prenex_24) |v_ULTIMATE.start_main_~item~0#1.base_41| v_prenex_26) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) 8))) (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (not (let ((.cse2 (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|))) (= .cse2 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_14) .cse2 v_ArrVal_1447) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|)))))))))) is different from false [2022-07-20 05:10:17,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-07-20 05:10:17,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2022-07-20 05:10:18,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-07-20 05:10:18,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2022-07-20 05:10:18,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2022-07-20 05:10:18,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-07-20 05:10:18,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-07-20 05:10:18,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2022-07-20 05:10:18,346 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_arrayElimArr_14 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int)) (let ((.cse2 (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse3 (store |c_#valid| .cse2 1))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_65| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_65|)) (and (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (not (let ((.cse0 (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|))) (= .cse0 (select (select (store (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_arrayElimArr_14) .cse0 v_ArrVal_1447) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|))))) (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_14) (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1447) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) .cse1))) (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_arrayElimArr_14) (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1447) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) |v_ULTIMATE.start_main_~item~0#1.base_41|))) (forall ((v_ArrVal_1446 (Array Int Int)) (v_ArrVal_1441 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_1441) (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1446) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1452) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_prenex_26 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_prenex_25) (select v_arrayElimArr_14 |ULTIMATE.start_main_~bcki~0#1.offset|) v_prenex_24) |v_ULTIMATE.start_main_~item~0#1.base_41| v_prenex_26) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|))))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (not (= (select |c_#valid| .cse2) 0)) (not (= (select .cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) 1)) (not (= 0 (select .cse3 |v_ULTIMATE.start_main_~item~0#1.base_41|))))))) is different from false [2022-07-20 05:10:18,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-07-20 05:10:18,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2022-07-20 05:10:18,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-07-20 05:10:18,504 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2022-07-20 05:10:18,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2022-07-20 05:10:18,592 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-07-20 05:10:18,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-07-20 05:10:18,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2022-07-20 05:10:18,800 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:18,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-20 05:10:18,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:18,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:18,808 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:18,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2022-07-20 05:10:18,821 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:18,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-20 05:10:18,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:18,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:18,829 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:18,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2022-07-20 05:10:18,832 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-07-20 05:10:18,844 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 05:10:18,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2022-07-20 05:10:18,849 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:18,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-20 05:10:18,850 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:18,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:18,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:18,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:18,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-20 05:10:18,866 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:18,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-20 05:10:18,869 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:18,869 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:18,869 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:18,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:18,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-20 05:10:18,880 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:18,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 66 [2022-07-20 05:10:19,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:10:19,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678942668] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:10:19,165 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:10:19,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 20] total 49 [2022-07-20 05:10:19,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131906777] [2022-07-20 05:10:19,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:10:19,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-20 05:10:19,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:10:19,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-20 05:10:19,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1740, Unknown=24, NotChecked=450, Total=2450 [2022-07-20 05:10:19,167 INFO L87 Difference]: Start difference. First operand 233 states and 288 transitions. Second operand has 50 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 50 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:10:20,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:10:20,401 INFO L93 Difference]: Finished difference Result 290 states and 332 transitions. [2022-07-20 05:10:20,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-20 05:10:20,401 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 50 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-20 05:10:20,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:10:20,402 INFO L225 Difference]: With dead ends: 290 [2022-07-20 05:10:20,402 INFO L226 Difference]: Without dead ends: 290 [2022-07-20 05:10:20,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 5 IntricatePredicates, 2 DeprecatedPredicates, 1006 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=464, Invalid=2952, Unknown=26, NotChecked=590, Total=4032 [2022-07-20 05:10:20,403 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 241 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1837 SdHoareTripleChecker+Invalid, 2890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2083 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:10:20,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 1837 Invalid, 2890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 769 Invalid, 0 Unknown, 2083 Unchecked, 0.4s Time] [2022-07-20 05:10:20,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-07-20 05:10:20,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 247. [2022-07-20 05:10:20,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 218 states have (on average 1.3944954128440368) internal successors, (304), 246 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:10:20,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 304 transitions. [2022-07-20 05:10:20,408 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 304 transitions. Word has length 38 [2022-07-20 05:10:20,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:10:20,408 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 304 transitions. [2022-07-20 05:10:20,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 50 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:10:20,408 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 304 transitions. [2022-07-20 05:10:20,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 05:10:20,409 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:10:20,409 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:10:20,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 05:10:20,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:10:20,626 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 05:10:20,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:10:20,626 INFO L85 PathProgramCache]: Analyzing trace with hash -372876340, now seen corresponding path program 1 times [2022-07-20 05:10:20,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:10:20,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476106049] [2022-07-20 05:10:20,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:10:20,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:10:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:10:21,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:10:21,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:10:21,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476106049] [2022-07-20 05:10:21,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476106049] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:10:21,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437407787] [2022-07-20 05:10:21,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:10:21,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:10:21,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:10:21,023 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:10:21,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-20 05:10:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:10:21,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-20 05:10:21,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:10:21,167 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:10:21,185 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 05:10:21,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 05:10:21,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:10:21,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:10:21,327 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:10:21,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-20 05:10:21,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 05:10:21,342 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:10:21,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 05:10:21,401 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:10:21,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-20 05:10:21,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 05:10:21,417 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:10:21,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 05:10:21,445 INFO L356 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-07-20 05:10:21,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2022-07-20 05:10:21,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 [2022-07-20 05:10:21,503 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:10:21,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-20 05:10:21,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 05:10:21,524 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-20 05:10:21,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 31 [2022-07-20 05:10:21,734 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-20 05:10:21,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 69 [2022-07-20 05:10:21,758 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:10:21,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-20 05:10:21,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 05:10:21,810 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-20 05:10:21,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 87 treesize of output 69 [2022-07-20 05:10:21,829 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:10:21,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-20 05:10:21,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 05:10:21,880 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-20 05:10:21,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 77 [2022-07-20 05:10:21,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-20 05:10:21,981 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-07-20 05:10:21,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2022-07-20 05:10:21,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:10:22,040 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 05:10:22,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 62 [2022-07-20 05:10:22,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:10:22,123 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 05:10:22,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 62 [2022-07-20 05:10:22,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:10:22,280 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:22,283 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-20 05:10:22,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 26 [2022-07-20 05:10:22,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:22,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:10:22,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:10:22,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:10:22,442 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1625 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_71| Int)) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_71| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1625) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|))) (and (<= 0 (+ .cse0 8)) (<= (+ .cse0 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|))))))) is different from false [2022-07-20 05:10:22,804 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_71| Int) (|v_ULTIMATE.start_main_~item~0#1.base_44| Int) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_44|) 0)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_71| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (and (forall ((v_ArrVal_1625 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1620) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1625) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)))) (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1625 (Array Int Int)) (v_ArrVal_1622 Int)) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1620) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1625) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)) (select (store |c_#length| |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1622) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1621) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|))))) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)))) is different from false [2022-07-20 05:10:23,694 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:23,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 46 [2022-07-20 05:10:23,975 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:23,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 502 treesize of output 488 [2022-07-20 05:10:24,023 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:24,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 99 [2022-07-20 05:10:24,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-07-20 05:10:24,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-07-20 05:10:24,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-07-20 05:10:24,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-07-20 05:10:24,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-07-20 05:10:24,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-07-20 05:10:24,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-07-20 05:10:24,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-07-20 05:10:24,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-07-20 05:10:24,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-07-20 05:10:24,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-07-20 05:10:24,648 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-07-20 05:10:24,761 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-07-20 05:10:24,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-07-20 05:10:24,838 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_71| Int) (|v_ULTIMATE.start_main_~item~0#1.base_44| Int)) (let ((.cse2 (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse0 (store |c_#valid| .cse2 1))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_44|) 0)) (and (forall ((v_ArrVal_1614 (Array Int Int)) (v_ArrVal_1625 (Array Int Int)) (v_ArrVal_1620 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1614) (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1620) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1625) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)))) (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (not (let ((.cse1 (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_21) .cse1 v_ArrVal_1621) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|) .cse1)))) (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_21) (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1621) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|) |v_ULTIMATE.start_main_~item~0#1.base_44|))) (forall ((v_prenex_103 (Array Int Int)) (v_prenex_104 (Array Int Int)) (v_prenex_105 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_prenex_103) (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|) v_prenex_105) |v_ULTIMATE.start_main_~item~0#1.base_44| v_prenex_104) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|) |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_21) (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1621) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|) |c_ULTIMATE.start_main_~bcki~0#1.base|))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (not (= (select |c_#valid| .cse2) 0)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_71| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)) (not (= (select .cse0 |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)))))) is different from false [2022-07-20 05:10:24,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-07-20 05:10:24,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-07-20 05:10:24,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-07-20 05:10:25,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-07-20 05:10:25,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-07-20 05:10:25,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-07-20 05:10:25,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2022-07-20 05:10:25,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2022-07-20 05:10:25,309 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_71| Int) (|v_ULTIMATE.start_main_~item~0#1.base_44| Int)) (let ((.cse2 (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse0 (store |c_#valid| .cse2 1))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_44|) 0)) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (and (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_21) (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1621) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|) |c_ULTIMATE.start_main_#t~mem3#1.base|)) (forall ((v_ArrVal_1614 (Array Int Int)) (v_ArrVal_1625 (Array Int Int)) (v_ArrVal_1620 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_ArrVal_1614) (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1620) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1625) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|) 8))) (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_21) (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1621) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|) |v_ULTIMATE.start_main_~item~0#1.base_44|))) (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (not (let ((.cse1 (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_21) .cse1 v_ArrVal_1621) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|) .cse1)))) (forall ((v_prenex_103 (Array Int Int)) (v_prenex_104 (Array Int Int)) (v_prenex_105 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_prenex_103) (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|) v_prenex_105) |v_ULTIMATE.start_main_~item~0#1.base_44| v_prenex_104) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|) |ULTIMATE.start_main_~bcki~0#1.offset|))) (not (= (select |c_#valid| .cse2) 0)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_71| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)) (not (= (select .cse0 |c_ULTIMATE.start_main_#t~mem3#1.base|) 1)))))) is different from false [2022-07-20 05:10:25,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-07-20 05:10:25,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2022-07-20 05:10:25,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-07-20 05:10:25,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2022-07-20 05:10:25,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-07-20 05:10:25,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2022-07-20 05:10:25,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-07-20 05:10:25,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2022-07-20 05:10:25,726 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_21 (Array Int Int)) (|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_71| Int) (|v_ULTIMATE.start_main_~item~0#1.base_44| Int)) (let ((.cse1 (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse0 (store |c_#valid| .cse1 1))) (or (not (= (select .cse0 |v_ULTIMATE.start_main_~item~0#1.base_44|) 0)) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (not (= (select |c_#valid| .cse1) 0)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_71| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select .cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) 1)) (and (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_arrayElimArr_21) (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1621) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|) |v_ULTIMATE.start_main_~item~0#1.base_44|))) (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| .cse2 v_arrayElimArr_21) (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1621) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|) .cse2))) (forall ((v_ArrVal_1614 (Array Int Int)) (v_ArrVal_1625 (Array Int Int)) (v_ArrVal_1620 (Array Int Int))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_ArrVal_1614) (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1620) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1625) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|) 8))) (forall ((v_prenex_103 (Array Int Int)) (v_prenex_104 (Array Int Int)) (v_prenex_105 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_prenex_103) (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|) v_prenex_105) |v_ULTIMATE.start_main_~item~0#1.base_44| v_prenex_104) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|) |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1621 (Array Int Int))) (not (let ((.cse3 (select v_arrayElimArr_21 |ULTIMATE.start_main_~bcki~0#1.offset|))) (= .cse3 (select (select (store (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_arrayElimArr_21) .cse3 v_ArrVal_1621) |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)))))) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)))))) is different from false [2022-07-20 05:10:25,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-07-20 05:10:25,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2022-07-20 05:10:25,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-07-20 05:10:25,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2022-07-20 05:10:25,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-07-20 05:10:25,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2022-07-20 05:10:26,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-07-20 05:10:26,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2022-07-20 05:10:26,160 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:26,160 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-20 05:10:26,170 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:26,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1042 treesize of output 1014 [2022-07-20 05:10:26,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1002 treesize of output 970 [2022-07-20 05:10:26,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 493 treesize of output 477 [2022-07-20 05:10:26,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 954 treesize of output 890 [2022-07-20 05:10:26,502 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:26,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-20 05:10:26,504 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:26,504 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:26,505 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:26,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-20 05:10:26,512 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:26,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-20 05:10:26,514 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:26,514 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:26,514 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:26,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-07-20 05:10:26,522 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 05:10:26,522 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 1 [2022-07-20 05:10:26,527 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 05:10:26,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2022-07-20 05:10:26,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 53 [2022-07-20 05:10:26,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:10:26,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437407787] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:10:26,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:10:26,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 20] total 49 [2022-07-20 05:10:26,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428919613] [2022-07-20 05:10:26,907 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:10:26,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-20 05:10:26,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:10:26,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-20 05:10:26,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1735, Unknown=24, NotChecked=450, Total=2450 [2022-07-20 05:10:26,908 INFO L87 Difference]: Start difference. First operand 247 states and 304 transitions. Second operand has 50 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 50 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:10:32,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:10:32,041 INFO L93 Difference]: Finished difference Result 309 states and 354 transitions. [2022-07-20 05:10:32,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-20 05:10:32,041 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 50 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-20 05:10:32,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:10:32,042 INFO L225 Difference]: With dead ends: 309 [2022-07-20 05:10:32,042 INFO L226 Difference]: Without dead ends: 309 [2022-07-20 05:10:32,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 5 IntricatePredicates, 2 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=434, Invalid=2978, Unknown=30, NotChecked=590, Total=4032 [2022-07-20 05:10:32,043 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 246 mSDsluCounter, 1879 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 2005 SdHoareTripleChecker+Invalid, 3311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2270 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:10:32,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 2005 Invalid, 3311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1000 Invalid, 0 Unknown, 2270 Unchecked, 0.5s Time] [2022-07-20 05:10:32,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-07-20 05:10:32,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 236. [2022-07-20 05:10:32,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 207 states have (on average 1.4057971014492754) internal successors, (291), 235 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:10:32,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 291 transitions. [2022-07-20 05:10:32,047 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 291 transitions. Word has length 38 [2022-07-20 05:10:32,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:10:32,047 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 291 transitions. [2022-07-20 05:10:32,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.2244897959183674) internal successors, (109), 50 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:10:32,048 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 291 transitions. [2022-07-20 05:10:32,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 05:10:32,048 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:10:32,048 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:10:32,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-20 05:10:32,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:10:32,263 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 05:10:32,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:10:32,264 INFO L85 PathProgramCache]: Analyzing trace with hash -422654064, now seen corresponding path program 1 times [2022-07-20 05:10:32,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:10:32,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784478970] [2022-07-20 05:10:32,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:10:32,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:10:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:10:32,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:10:32,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:10:32,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784478970] [2022-07-20 05:10:32,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784478970] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:10:32,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432341826] [2022-07-20 05:10:32,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:10:32,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:10:32,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:10:32,458 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:10:32,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-20 05:10:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:10:32,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-20 05:10:32,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:10:32,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:10:32,610 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:10:32,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:10:32,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:10:32,674 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:10:32,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2022-07-20 05:10:32,685 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:10:32,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2022-07-20 05:10:32,699 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:10:32,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:10:32,727 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-20 05:10:32,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2022-07-20 05:10:32,823 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 05:10:32,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 48 [2022-07-20 05:10:32,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-20 05:10:32,891 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 05:10:32,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 55 [2022-07-20 05:10:32,918 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 05:10:32,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 55 [2022-07-20 05:10:32,984 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 05:10:32,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-07-20 05:10:33,026 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:33,027 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:33,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 15 [2022-07-20 05:10:33,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:10:33,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:10:33,108 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_76| Int) (v_ArrVal_1770 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_76|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1770) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_76|) 0)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_76| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) is different from false [2022-07-20 05:10:33,123 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_76| Int) (v_ArrVal_1770 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_76|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_76| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1770) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_76|) 0)))) is different from false [2022-07-20 05:10:33,129 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_76| Int) (v_ArrVal_1770 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_76|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_76| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1770) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_76|) 0)))) is different from false [2022-07-20 05:10:33,141 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_76| Int) (v_ArrVal_1770 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_76|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_76| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1770) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_76|) 0)))) is different from false [2022-07-20 05:10:33,176 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:33,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 05:10:33,183 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_76| Int) (v_ArrVal_1770 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_27 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_76|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_27) .cse0 v_ArrVal_1770) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_76|) 0)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_76| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select |c_#valid| .cse0) 0))))) is different from false [2022-07-20 05:10:33,200 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_76| Int) (v_ArrVal_1770 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_27 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_76|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_76| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_27) .cse0 v_ArrVal_1770) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_76|) 0)) (not (= (select |c_#valid| .cse0) 0))))) is different from false [2022-07-20 05:10:33,211 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_76| Int) (v_ArrVal_1770 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_27 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) v_arrayElimArr_27) .cse0 v_ArrVal_1770) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_76|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_76|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_76| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select |c_#valid| .cse0) 0))))) is different from false [2022-07-20 05:10:33,227 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:33,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-20 05:10:33,230 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:33,235 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:33,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2022-07-20 05:10:33,242 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:33,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2022-07-20 05:10:33,251 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:10:33,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 05:10:33,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:10:33,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432341826] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:10:33,350 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:10:33,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 38 [2022-07-20 05:10:33,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676714665] [2022-07-20 05:10:33,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:10:33,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-20 05:10:33,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:10:33,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-20 05:10:33,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=781, Unknown=7, NotChecked=448, Total=1406 [2022-07-20 05:10:33,351 INFO L87 Difference]: Start difference. First operand 236 states and 291 transitions. Second operand has 38 states, 38 states have (on average 2.5526315789473686) internal successors, (97), 38 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:10:35,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:10:35,954 INFO L93 Difference]: Finished difference Result 247 states and 291 transitions. [2022-07-20 05:10:35,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 05:10:35,955 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.5526315789473686) internal successors, (97), 38 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-20 05:10:35,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:10:35,956 INFO L225 Difference]: With dead ends: 247 [2022-07-20 05:10:35,956 INFO L226 Difference]: Without dead ends: 247 [2022-07-20 05:10:35,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=317, Invalid=1510, Unknown=7, NotChecked=616, Total=2450 [2022-07-20 05:10:35,957 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 183 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 1875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1243 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:10:35,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1120 Invalid, 1875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 598 Invalid, 0 Unknown, 1243 Unchecked, 0.3s Time] [2022-07-20 05:10:35,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-20 05:10:35,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 236. [2022-07-20 05:10:35,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 207 states have (on average 1.4009661835748792) internal successors, (290), 235 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:10:35,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 290 transitions. [2022-07-20 05:10:35,961 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 290 transitions. Word has length 39 [2022-07-20 05:10:35,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:10:35,962 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 290 transitions. [2022-07-20 05:10:35,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.5526315789473686) internal successors, (97), 38 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:10:35,962 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 290 transitions. [2022-07-20 05:10:35,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-20 05:10:35,963 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:10:35,963 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:10:35,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-20 05:10:36,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:10:36,175 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 05:10:36,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:10:36,175 INFO L85 PathProgramCache]: Analyzing trace with hash -27982635, now seen corresponding path program 1 times [2022-07-20 05:10:36,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:10:36,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259942353] [2022-07-20 05:10:36,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:10:36,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:10:36,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:10:36,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:10:36,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:10:36,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259942353] [2022-07-20 05:10:36,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259942353] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:10:36,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:10:36,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-20 05:10:36,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597984440] [2022-07-20 05:10:36,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:10:36,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-20 05:10:36,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:10:36,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-20 05:10:36,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-07-20 05:10:36,511 INFO L87 Difference]: Start difference. First operand 236 states and 290 transitions. Second operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:10:37,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:10:37,314 INFO L93 Difference]: Finished difference Result 287 states and 340 transitions. [2022-07-20 05:10:37,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 05:10:37,316 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-20 05:10:37,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:10:37,316 INFO L225 Difference]: With dead ends: 287 [2022-07-20 05:10:37,316 INFO L226 Difference]: Without dead ends: 287 [2022-07-20 05:10:37,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=281, Invalid=979, Unknown=0, NotChecked=0, Total=1260 [2022-07-20 05:10:37,317 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 399 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:10:37,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 599 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 05:10:37,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-07-20 05:10:37,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 240. [2022-07-20 05:10:37,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 211 states have (on average 1.3933649289099526) internal successors, (294), 239 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:10:37,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 294 transitions. [2022-07-20 05:10:37,321 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 294 transitions. Word has length 41 [2022-07-20 05:10:37,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:10:37,321 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 294 transitions. [2022-07-20 05:10:37,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:10:37,321 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 294 transitions. [2022-07-20 05:10:37,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 05:10:37,321 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:10:37,321 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] [2022-07-20 05:10:37,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 05:10:37,322 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 05:10:37,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:10:37,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1534306045, now seen corresponding path program 1 times [2022-07-20 05:10:37,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:10:37,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473500004] [2022-07-20 05:10:37,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:10:37,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:10:37,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:10:37,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:10:37,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:10:37,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473500004] [2022-07-20 05:10:37,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473500004] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:10:37,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640787618] [2022-07-20 05:10:37,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:10:37,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:10:37,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:10:37,751 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:10:37,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-20 05:10:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:10:37,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 82 conjunts are in the unsatisfiable core [2022-07-20 05:10:37,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:10:37,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:10:37,924 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 05:10:37,925 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 05:10:37,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:10:37,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:10:38,085 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:10:38,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2022-07-20 05:10:38,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:10:38,103 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:10:38,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 05:10:38,152 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-20 05:10:38,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2022-07-20 05:10:38,166 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-07-20 05:10:38,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2022-07-20 05:10:38,223 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-20 05:10:38,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:10:38,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:38,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-20 05:10:38,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:38,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:38,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-20 05:10:38,377 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-20 05:10:38,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 54 [2022-07-20 05:10:38,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:38,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:38,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:38,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-20 05:10:38,408 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-20 05:10:38,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 54 [2022-07-20 05:10:38,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:38,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:38,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:38,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-07-20 05:10:38,441 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-20 05:10:38,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 62 [2022-07-20 05:10:38,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:38,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-07-20 05:10:38,600 INFO L356 Elim1Store]: treesize reduction 74, result has 30.2 percent of original size [2022-07-20 05:10:38,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 62 [2022-07-20 05:10:38,613 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 05:10:38,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 36 [2022-07-20 05:10:38,915 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:38,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:10:38,916 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:38,924 INFO L356 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2022-07-20 05:10:38,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 85 treesize of output 48 [2022-07-20 05:10:38,927 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:38,931 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 05:10:38,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-20 05:10:38,938 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:10:38,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:10:41,241 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_82| Int) (v_ArrVal_2014 (Array Int Int)) (v_ArrVal_2013 (Array Int Int))) (or (and (forall ((v_ArrVal_2016 Int)) (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2014))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|))) (select (select (store .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse1 (+ |v_ULTIMATE.start_main_~bcki~0#1.offset_82| 4) v_ArrVal_2016)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2013) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_82|)) (+ (select .cse1 |v_ULTIMATE.start_main_~bcki~0#1.offset_82|) 4)))) 0)) (forall ((v_ArrVal_2018 Int)) (= (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2013))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base|))) (select (store .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse3 (+ |v_ULTIMATE.start_main_~bcki~0#1.offset_82| 4) v_ArrVal_2018)) (select .cse3 |v_ULTIMATE.start_main_~bcki~0#1.offset_82|)))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2014) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_82|) 4)) 0))) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_82| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_82|)))) is different from false [2022-07-20 05:10:44,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:44,234 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:44,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 74 [2022-07-20 05:10:44,241 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:44,247 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:44,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 66 [2022-07-20 05:10:44,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:44,267 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:44,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 74 [2022-07-20 05:10:44,270 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:44,275 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:44,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 66 [2022-07-20 05:10:49,358 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:49,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 92 [2022-07-20 05:10:49,365 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:49,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 68 [2022-07-20 05:10:49,368 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:49,405 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:49,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1286 treesize of output 1222 [2022-07-20 05:10:49,417 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:49,427 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:49,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1622 treesize of output 1498 [2022-07-20 05:10:49,459 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:49,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1494 treesize of output 1436 [2022-07-20 05:10:49,490 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:10:49,545 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:49,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 1716 treesize of output 1580 [2022-07-20 05:10:49,579 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:49,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1458 treesize of output 1406 [2022-07-20 05:10:49,654 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:10:49,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 314 treesize of output 310 [2022-07-20 05:11:00,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 05:11:00,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 05:11:00,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 05:11:00,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 05:11:01,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 05:11:01,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 05:11:01,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-20 05:11:02,698 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:11:02,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2617 treesize of output 2245 [2022-07-20 05:11:03,995 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:11:03,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 76 [2022-07-20 05:11:03,998 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:11:04,006 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:11:04,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2086 treesize of output 1976 [2022-07-20 05:11:04,017 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:11:04,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 1970 treesize of output 1490 [2022-07-20 05:11:04,023 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:11:04,030 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:11:04,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1981 treesize of output 1741 [2022-07-20 05:11:04,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:11:04,056 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:11:04,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1745 treesize of output 1507 [2022-07-20 05:11:04,088 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:11:04,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1458 treesize of output 1426 [2022-07-20 05:11:04,133 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:11:04,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 1594 treesize of output 1552 [2022-07-20 05:11:28,978 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:11:28,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1091 treesize of output 1069 [2022-07-20 05:11:29,632 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:11:29,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 577 treesize of output 523 [2022-07-20 05:11:32,231 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:11:32,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640787618] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:11:32,231 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:11:32,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 21] total 48 [2022-07-20 05:11:32,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491558594] [2022-07-20 05:11:32,232 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:11:32,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-20 05:11:32,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:11:32,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-20 05:11:32,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1927, Unknown=26, NotChecked=90, Total=2256 [2022-07-20 05:11:32,233 INFO L87 Difference]: Start difference. First operand 240 states and 294 transitions. Second operand has 48 states, 48 states have (on average 2.25) internal successors, (108), 48 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:11:33,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:11:33,431 INFO L93 Difference]: Finished difference Result 220 states and 258 transitions. [2022-07-20 05:11:33,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-20 05:11:33,432 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.25) internal successors, (108), 48 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-20 05:11:33,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:11:33,433 INFO L225 Difference]: With dead ends: 220 [2022-07-20 05:11:33,433 INFO L226 Difference]: Without dead ends: 220 [2022-07-20 05:11:33,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=433, Invalid=3447, Unknown=30, NotChecked=122, Total=4032 [2022-07-20 05:11:33,434 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 190 mSDsluCounter, 1607 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 1846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1091 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:11:33,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 1698 Invalid, 1846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 712 Invalid, 0 Unknown, 1091 Unchecked, 0.4s Time] [2022-07-20 05:11:33,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-20 05:11:33,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2022-07-20 05:11:33,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 191 states have (on average 1.350785340314136) internal successors, (258), 219 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:11:33,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 258 transitions. [2022-07-20 05:11:33,437 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 258 transitions. Word has length 42 [2022-07-20 05:11:33,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:11:33,437 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 258 transitions. [2022-07-20 05:11:33,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.25) internal successors, (108), 48 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:11:33,437 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 258 transitions. [2022-07-20 05:11:33,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 05:11:33,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:11:33,438 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:11:33,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-20 05:11:33,647 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,SelfDestructingSolverStorable22 [2022-07-20 05:11:33,648 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 05:11:33,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:11:33,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1454590384, now seen corresponding path program 1 times [2022-07-20 05:11:33,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:11:33,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638948902] [2022-07-20 05:11:33,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:11:33,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:11:33,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:11:33,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:11:33,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:11:33,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638948902] [2022-07-20 05:11:33,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638948902] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:11:33,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032349025] [2022-07-20 05:11:33,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:11:33,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:11:33,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:11:33,702 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:11:33,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-20 05:11:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:11:33,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-20 05:11:33,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:11:33,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-20 05:11:33,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-20 05:11:33,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-20 05:11:33,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-20 05:11:33,928 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 05:11:33,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 05:11:33,931 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:11:33,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:11:34,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:11:34,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032349025] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:11:34,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:11:34,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 6 [2022-07-20 05:11:34,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888891929] [2022-07-20 05:11:34,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:11:34,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:11:34,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:11:34,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:11:34,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:11:34,012 INFO L87 Difference]: Start difference. First operand 220 states and 258 transitions. Second operand has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:11:34,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:11:34,100 INFO L93 Difference]: Finished difference Result 228 states and 256 transitions. [2022-07-20 05:11:34,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:11:34,100 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-20 05:11:34,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:11:34,101 INFO L225 Difference]: With dead ends: 228 [2022-07-20 05:11:34,101 INFO L226 Difference]: Without dead ends: 228 [2022-07-20 05:11:34,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 81 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:11:34,102 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 293 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:11:34,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 77 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:11:34,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-07-20 05:11:34,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 214. [2022-07-20 05:11:34,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 186 states have (on average 1.3440860215053763) internal successors, (250), 213 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:11:34,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 250 transitions. [2022-07-20 05:11:34,105 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 250 transitions. Word has length 42 [2022-07-20 05:11:34,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:11:34,105 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 250 transitions. [2022-07-20 05:11:34,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.571428571428571) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:11:34,105 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 250 transitions. [2022-07-20 05:11:34,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-20 05:11:34,106 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:11:34,106 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] [2022-07-20 05:11:34,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-20 05:11:34,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-20 05:11:34,314 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-07-20 05:11:34,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:11:34,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2142580095, now seen corresponding path program 1 times [2022-07-20 05:11:34,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:11:34,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249105908] [2022-07-20 05:11:34,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:11:34,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:11:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:11:34,777 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:11:34,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:11:34,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249105908] [2022-07-20 05:11:34,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249105908] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:11:34,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824509458] [2022-07-20 05:11:34,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:11:34,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:11:34,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:11:34,779 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:11:34,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-20 05:11:34,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:11:34,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 78 conjunts are in the unsatisfiable core [2022-07-20 05:11:34,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:11:34,939 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:11:34,957 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 05:11:34,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 05:11:34,987 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:11:34,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:11:35,099 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:11:35,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-20 05:11:35,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 05:11:35,115 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:11:35,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 05:11:35,152 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:11:35,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-07-20 05:11:35,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:11:35,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:11:35,182 INFO L356 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-07-20 05:11:35,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2022-07-20 05:11:35,231 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-20 05:11:35,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 31 [2022-07-20 05:11:35,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:11:35,392 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-20 05:11:35,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 76 [2022-07-20 05:11:35,400 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:11:35,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 71 [2022-07-20 05:11:35,426 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-20 05:11:35,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 76 [2022-07-20 05:11:35,433 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:11:35,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 71 [2022-07-20 05:11:35,458 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-07-20 05:11:35,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 107 treesize of output 88 [2022-07-20 05:11:35,466 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 05:11:35,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 71 [2022-07-20 05:11:35,556 INFO L356 Elim1Store]: treesize reduction 102, result has 37.0 percent of original size [2022-07-20 05:11:35,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 77 [2022-07-20 05:11:35,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 05:11:35,623 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 05:11:35,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 83 [2022-07-20 05:11:35,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2022-07-20 05:11:35,702 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-07-20 05:11:35,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 83 [2022-07-20 05:11:35,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 72 [2022-07-20 05:11:35,956 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:11:35,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 57 [2022-07-20 05:11:36,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:11:36,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 05:11:36,207 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:11:36,214 INFO L356 Elim1Store]: treesize reduction 30, result has 9.1 percent of original size [2022-07-20 05:11:36,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 70 treesize of output 35 [2022-07-20 05:11:40,339 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:11:40,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:11:40,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 50 [2022-07-20 05:11:40,661 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_94| Int) (|v_ULTIMATE.start_main_~item~0#1.base_57| Int) (v_ArrVal_2344 (Array Int Int)) (v_ArrVal_2343 (Array Int Int)) (v_ArrVal_2339 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~item~0#1.base_57| v_ArrVal_2343))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_94|)) (.cse1 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~item~0#1.base_57| v_ArrVal_2344) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_94|))) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_94|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_57|) 0)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_94| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (= .cse0 |v_ULTIMATE.start_main_~item~0#1.base_57|) (not (<= 0 .cse1)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_57| v_ArrVal_2339) (select (select .cse2 .cse0) .cse1)) 1))))) is different from false [2022-07-20 05:11:40,712 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2338 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_94| Int) (v_ArrVal_2337 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_57| Int) (v_ArrVal_2344 (Array Int Int)) (v_ArrVal_2343 (Array Int Int)) (v_ArrVal_2339 Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2338) |v_ULTIMATE.start_main_~item~0#1.base_57| v_ArrVal_2343))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2337) |v_ULTIMATE.start_main_~item~0#1.base_57| v_ArrVal_2344) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_94|)) (.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_94|))) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_94|)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_57| v_ArrVal_2339) (select (select .cse0 .cse1) .cse2)) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_57|) 0)) (not (<= 0 .cse2)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_94| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (= .cse1 |v_ULTIMATE.start_main_~item~0#1.base_57|))))) is different from false [2022-07-20 05:11:40,756 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2338 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_94| Int) (v_ArrVal_2337 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_57| Int) (v_ArrVal_2344 (Array Int Int)) (v_ArrVal_2343 (Array Int Int)) (v_ArrVal_2339 Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2338) |v_ULTIMATE.start_main_~item~0#1.base_57| v_ArrVal_2343))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_94|)) (.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2337) |v_ULTIMATE.start_main_~item~0#1.base_57| v_ArrVal_2344) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_94|))) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_94|)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_57| v_ArrVal_2339) (select (select .cse0 .cse1) .cse2)) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_57|) 0)) (= .cse1 |v_ULTIMATE.start_main_~item~0#1.base_57|) (not (<= 0 .cse2)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_94| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))))) is different from false [2022-07-20 05:11:40,773 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_94| Int) (v_ArrVal_2338 (Array Int Int)) (v_ArrVal_2337 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_57| Int) (v_ArrVal_2344 (Array Int Int)) (v_ArrVal_2343 (Array Int Int)) (v_ArrVal_2339 Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_2338) |v_ULTIMATE.start_main_~item~0#1.base_57| v_ArrVal_2343))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_94|)) (.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_2337) |v_ULTIMATE.start_main_~item~0#1.base_57| v_ArrVal_2344) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_94|))) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_94|)) (not (<= 0 .cse0)) (= |v_ULTIMATE.start_main_~item~0#1.base_57| .cse1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_57|) 0)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_94| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_57| v_ArrVal_2339) (select (select .cse2 .cse1) .cse0)) 1)))))) is different from false [2022-07-20 05:11:40,875 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc4#1.base_30| Int) (v_ArrVal_2338 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_94| Int) (v_ArrVal_2337 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_57| Int) (v_ArrVal_2344 (Array Int Int)) (v_ArrVal_2343 (Array Int Int)) (v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2339 Int)) (let ((.cse2 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset| |v_ULTIMATE.start_main_#t~malloc4#1.base_30|)) |v_ULTIMATE.start_main_#t~malloc4#1.base_30| v_ArrVal_2338) |v_ULTIMATE.start_main_~item~0#1.base_57| v_ArrVal_2343))) (let ((.cse1 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_30| 1)) (.cse0 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2332) |v_ULTIMATE.start_main_#t~malloc4#1.base_30| v_ArrVal_2337) |v_ULTIMATE.start_main_~item~0#1.base_57| v_ArrVal_2344) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_94|)) (.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_94|))) (or (not (<= 0 .cse0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_94|)) (not (= (select .cse1 |v_ULTIMATE.start_main_~item~0#1.base_57|) 0)) (= (select (store .cse1 |v_ULTIMATE.start_main_~item~0#1.base_57| v_ArrVal_2339) (select (select .cse2 .cse3) .cse0)) 1) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_94| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (= .cse3 |v_ULTIMATE.start_main_~item~0#1.base_57|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_30|) 0)))))) is different from false [2022-07-20 05:11:40,902 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:11:40,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 73 [2022-07-20 05:11:40,923 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_94| Int) (v_ArrVal_2338 (Array Int Int)) (v_arrayElimArr_37 (Array Int Int)) (v_ArrVal_2337 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_57| Int) (v_ArrVal_2344 (Array Int Int)) (v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2343 (Array Int Int)) (v_ArrVal_2339 Int)) (let ((.cse0 (select v_arrayElimArr_37 |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse2 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_37) .cse0 v_ArrVal_2338) |v_ULTIMATE.start_main_~item~0#1.base_57| v_ArrVal_2343))) (let ((.cse3 (select (select .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_94|)) (.cse1 (store |c_#valid| .cse0 1)) (.cse4 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2332) .cse0 v_ArrVal_2337) |v_ULTIMATE.start_main_~item~0#1.base_57| v_ArrVal_2344) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_94|))) (or (not (= (select |c_#valid| .cse0) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_94|)) (= (select (store .cse1 |v_ULTIMATE.start_main_~item~0#1.base_57| v_ArrVal_2339) (select (select .cse2 .cse3) .cse4)) 1) (= |v_ULTIMATE.start_main_~item~0#1.base_57| .cse3) (not (= (select .cse1 |v_ULTIMATE.start_main_~item~0#1.base_57|) 0)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_94| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 .cse4))))))) is different from false [2022-07-20 05:11:40,967 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_94| Int) (v_ArrVal_2338 (Array Int Int)) (v_arrayElimArr_37 (Array Int Int)) (v_ArrVal_2337 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_57| Int) (v_ArrVal_2344 (Array Int Int)) (v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2343 (Array Int Int)) (v_ArrVal_2339 Int)) (let ((.cse4 (select v_arrayElimArr_37 |c_ULTIMATE.start_main_#t~mem3#1.offset|))) (let ((.cse2 (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_37) .cse4 v_ArrVal_2338) |v_ULTIMATE.start_main_~item~0#1.base_57| v_ArrVal_2343))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_94|)) (.cse3 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_ArrVal_2332) .cse4 v_ArrVal_2337) |v_ULTIMATE.start_main_~item~0#1.base_57| v_ArrVal_2344) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_94|)) (.cse1 (store |c_#valid| .cse4 1))) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_94|)) (= |v_ULTIMATE.start_main_~item~0#1.base_57| .cse0) (= (select (store .cse1 |v_ULTIMATE.start_main_~item~0#1.base_57| v_ArrVal_2339) (select (select .cse2 .cse0) .cse3)) 1) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_94| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select |c_#valid| .cse4) 0)) (not (<= 0 .cse3)) (not (= 0 (select .cse1 |v_ULTIMATE.start_main_~item~0#1.base_57|)))))))) is different from false [2022-07-20 05:11:40,999 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_94| Int) (v_ArrVal_2338 (Array Int Int)) (v_arrayElimArr_37 (Array Int Int)) (v_ArrVal_2337 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_57| Int) (v_ArrVal_2344 (Array Int Int)) (v_ArrVal_2332 (Array Int Int)) (v_ArrVal_2343 (Array Int Int)) (v_ArrVal_2339 Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse4 (select v_arrayElimArr_37 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) (let ((.cse2 (store (store (store |c_#memory_$Pointer$.base| .cse5 v_arrayElimArr_37) .cse4 v_ArrVal_2338) |v_ULTIMATE.start_main_~item~0#1.base_57| v_ArrVal_2343))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_94|)) (.cse1 (store |c_#valid| .cse4 1)) (.cse3 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_2332) .cse4 v_ArrVal_2337) |v_ULTIMATE.start_main_~item~0#1.base_57| v_ArrVal_2344) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_94|))) (or (= .cse0 |v_ULTIMATE.start_main_~item~0#1.base_57|) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_94|)) (= (select (store .cse1 |v_ULTIMATE.start_main_~item~0#1.base_57| v_ArrVal_2339) (select (select .cse2 .cse0) .cse3)) 1) (not (= (select |c_#valid| .cse4) 0)) (not (= (select .cse1 |v_ULTIMATE.start_main_~item~0#1.base_57|) 0)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_94| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 .cse3))))))) is different from false [2022-07-20 05:11:41,036 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:11:41,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 102 [2022-07-20 05:11:41,044 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:11:41,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 121 treesize of output 105 [2022-07-20 05:11:41,054 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:11:41,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 745 treesize of output 605 [2022-07-20 05:11:41,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:11:41,061 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:11:41,567 INFO L356 Elim1Store]: treesize reduction 192, result has 67.4 percent of original size [2022-07-20 05:11:41,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 8827 treesize of output 7979 [2022-07-20 05:11:41,823 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:11:41,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 7866 treesize of output 6506 [2022-07-20 05:11:41,909 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6376 treesize of output 6146 [2022-07-20 05:11:42,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6170 treesize of output 6040 [2022-07-20 05:11:42,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3189 treesize of output 3109 [2022-07-20 05:11:42,239 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:11:42,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5750 treesize of output 5542 [2022-07-20 05:11:42,404 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:11:42,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 5494 treesize of output 5414