./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 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-buckets-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:47:42,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:47:42,071 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:47:42,120 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:47:42,121 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:47:42,125 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:47:42,127 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:47:42,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:47:42,133 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:47:42,138 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:47:42,139 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:47:42,141 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:47:42,141 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:47:42,144 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:47:42,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:47:42,148 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:47:42,149 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:47:42,150 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:47:42,152 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:47:42,158 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:47:42,160 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:47:42,161 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:47:42,164 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:47:42,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:47:42,173 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:47:42,173 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:47:42,174 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:47:42,176 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:47:42,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:47:42,177 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:47:42,178 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:47:42,179 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:47:42,181 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:47:42,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:47:42,185 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:47:42,185 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:47:42,186 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:47:42,186 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:47:42,186 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:47:42,187 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:47:42,188 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:47:42,189 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-11-02 20:47:42,230 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:47:42,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:47:42,231 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:47:42,231 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:47:42,232 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:47:42,232 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:47:42,233 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:47:42,233 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:47:42,234 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:47:42,234 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:47:42,235 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:47:42,235 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:47:42,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:47:42,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:47:42,236 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:47:42,236 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:47:42,236 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:47:42,237 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:47:42,237 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:47:42,237 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:47:42,237 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:47:42,237 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:47:42,238 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:47:42,238 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:47:42,238 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:47:42,238 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:47:42,239 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:47:42,239 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:47:42,239 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:47:42,239 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc 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-11-02 20:47:42,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:47:42,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:47:42,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:47:42,612 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:47:42,613 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:47:42,615 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/forester-heap/sll-buckets-2.i [2022-11-02 20:47:42,689 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/data/0862069bd/93e412fedb2a4ce0816c64129e64470f/FLAG006d7d30d [2022-11-02 20:47:43,270 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:47:43,271 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/sv-benchmarks/c/forester-heap/sll-buckets-2.i [2022-11-02 20:47:43,285 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/data/0862069bd/93e412fedb2a4ce0816c64129e64470f/FLAG006d7d30d [2022-11-02 20:47:43,544 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/data/0862069bd/93e412fedb2a4ce0816c64129e64470f [2022-11-02 20:47:43,547 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:47:43,548 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:47:43,550 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:47:43,551 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:47:43,554 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:47:43,555 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:47:43" (1/1) ... [2022-11-02 20:47:43,556 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b9cb259 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:43, skipping insertion in model container [2022-11-02 20:47:43,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:47:43" (1/1) ... [2022-11-02 20:47:43,567 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:47:43,604 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:47:43,917 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/sv-benchmarks/c/forester-heap/sll-buckets-2.i[22663,22676] [2022-11-02 20:47:43,921 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/sv-benchmarks/c/forester-heap/sll-buckets-2.i[22734,22747] [2022-11-02 20:47:43,923 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/sv-benchmarks/c/forester-heap/sll-buckets-2.i[22862,22875] [2022-11-02 20:47:43,927 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/sv-benchmarks/c/forester-heap/sll-buckets-2.i[23275,23288] [2022-11-02 20:47:43,929 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/sv-benchmarks/c/forester-heap/sll-buckets-2.i[23364,23377] [2022-11-02 20:47:43,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:47:43,940 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:47:43,975 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/sv-benchmarks/c/forester-heap/sll-buckets-2.i[22663,22676] [2022-11-02 20:47:43,976 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/sv-benchmarks/c/forester-heap/sll-buckets-2.i[22734,22747] [2022-11-02 20:47:43,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/sv-benchmarks/c/forester-heap/sll-buckets-2.i[22862,22875] [2022-11-02 20:47:43,980 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/sv-benchmarks/c/forester-heap/sll-buckets-2.i[23275,23288] [2022-11-02 20:47:43,982 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/sv-benchmarks/c/forester-heap/sll-buckets-2.i[23364,23377] [2022-11-02 20:47:43,984 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:47:44,007 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:47:44,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:44 WrapperNode [2022-11-02 20:47:44,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:47:44,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:47:44,012 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:47:44,012 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:47:44,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:44" (1/1) ... [2022-11-02 20:47:44,054 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:44" (1/1) ... [2022-11-02 20:47:44,076 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 161 [2022-11-02 20:47:44,076 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:47:44,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:47:44,077 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:47:44,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:47:44,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:44" (1/1) ... [2022-11-02 20:47:44,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:44" (1/1) ... [2022-11-02 20:47:44,091 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:44" (1/1) ... [2022-11-02 20:47:44,091 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:44" (1/1) ... [2022-11-02 20:47:44,100 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:44" (1/1) ... [2022-11-02 20:47:44,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:44" (1/1) ... [2022-11-02 20:47:44,107 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:44" (1/1) ... [2022-11-02 20:47:44,109 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:44" (1/1) ... [2022-11-02 20:47:44,112 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:47:44,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:47:44,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:47:44,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:47:44,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:44" (1/1) ... [2022-11-02 20:47:44,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:47:44,136 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:44,148 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:47:44,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:47:44,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 20:47:44,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 20:47:44,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:47:44,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:47:44,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:47:44,204 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:47:44,204 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:47:44,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:47:44,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:47:44,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:47:44,362 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:47:44,366 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:47:44,966 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:47:44,972 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:47:44,973 INFO L300 CfgBuilder]: Removed 15 assume(true) statements. [2022-11-02 20:47:44,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:47:44 BoogieIcfgContainer [2022-11-02 20:47:44,975 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:47:44,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:47:44,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:47:44,992 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:47:44,992 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:47:43" (1/3) ... [2022-11-02 20:47:44,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205d3f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:47:44, skipping insertion in model container [2022-11-02 20:47:44,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:47:44" (2/3) ... [2022-11-02 20:47:44,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@205d3f1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:47:44, skipping insertion in model container [2022-11-02 20:47:44,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:47:44" (3/3) ... [2022-11-02 20:47:44,995 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-buckets-2.i [2022-11-02 20:47:45,014 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:47:45,014 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2022-11-02 20:47:45,065 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:47:45,072 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@51247f8f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:47:45,072 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2022-11-02 20:47:45,077 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-11-02 20:47:45,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:47:45,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:45,085 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:47:45,085 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-11-02 20:47:45,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:45,091 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-02 20:47:45,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:45,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019993462] [2022-11-02 20:47:45,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:45,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:45,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:45,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:45,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019993462] [2022-11-02 20:47:45,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019993462] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:45,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:45,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:47:45,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824495680] [2022-11-02 20:47:45,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:45,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:45,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:45,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:45,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:45,371 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-11-02 20:47:45,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:45,635 INFO L93 Difference]: Finished difference Result 190 states and 198 transitions. [2022-11-02 20:47:45,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:45,637 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-11-02 20:47:45,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:45,646 INFO L225 Difference]: With dead ends: 190 [2022-11-02 20:47:45,646 INFO L226 Difference]: Without dead ends: 186 [2022-11-02 20:47:45,648 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-11-02 20:47:45,651 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 141 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:45,652 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.2s Time] [2022-11-02 20:47:45,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-11-02 20:47:45,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 149. [2022-11-02 20:47:45,700 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-11-02 20:47:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 156 transitions. [2022-11-02 20:47:45,713 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 156 transitions. Word has length 3 [2022-11-02 20:47:45,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:45,713 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 156 transitions. [2022-11-02 20:47:45,714 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-11-02 20:47:45,714 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2022-11-02 20:47:45,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-02 20:47:45,715 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:45,715 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-02 20:47:45,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:47:45,717 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-11-02 20:47:45,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:45,718 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-02 20:47:45,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:45,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670002444] [2022-11-02 20:47:45,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:45,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:45,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:45,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:45,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670002444] [2022-11-02 20:47:45,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670002444] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:45,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:45,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:47:45,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459430283] [2022-11-02 20:47:45,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:45,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:45,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:45,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:45,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:45,834 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-11-02 20:47:45,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:45,996 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2022-11-02 20:47:45,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:45,997 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-11-02 20:47:45,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:46,001 INFO L225 Difference]: With dead ends: 185 [2022-11-02 20:47:46,001 INFO L226 Difference]: Without dead ends: 185 [2022-11-02 20:47:46,001 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-11-02 20:47:46,003 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-11-02 20:47:46,004 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-11-02 20:47:46,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-02 20:47:46,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 145. [2022-11-02 20:47:46,024 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-11-02 20:47:46,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 152 transitions. [2022-11-02 20:47:46,027 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 152 transitions. Word has length 3 [2022-11-02 20:47:46,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:46,027 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 152 transitions. [2022-11-02 20:47:46,028 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-11-02 20:47:46,028 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 152 transitions. [2022-11-02 20:47:46,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:47:46,029 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:46,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:46,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:47:46,033 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-11-02 20:47:46,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:46,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924362, now seen corresponding path program 1 times [2022-11-02 20:47:46,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:46,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055384046] [2022-11-02 20:47:46,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:46,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:46,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:46,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:46,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:46,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055384046] [2022-11-02 20:47:46,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055384046] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:46,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:46,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:47:46,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580800368] [2022-11-02 20:47:46,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:46,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:47:46,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:46,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:47:46,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:47:46,417 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-11-02 20:47:46,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:46,789 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2022-11-02 20:47:46,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:47:46,790 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-11-02 20:47:46,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:46,791 INFO L225 Difference]: With dead ends: 151 [2022-11-02 20:47:46,791 INFO L226 Difference]: Without dead ends: 151 [2022-11-02 20:47:46,791 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-11-02 20:47:46,792 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 97 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:46,793 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.3s Time] [2022-11-02 20:47:46,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-02 20:47:46,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 143. [2022-11-02 20:47:46,799 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-11-02 20:47:46,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 158 transitions. [2022-11-02 20:47:46,800 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 158 transitions. Word has length 10 [2022-11-02 20:47:46,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:46,800 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 158 transitions. [2022-11-02 20:47:46,800 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-11-02 20:47:46,801 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 158 transitions. [2022-11-02 20:47:46,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:47:46,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:46,801 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:46,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:47:46,802 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-11-02 20:47:46,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:46,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924363, now seen corresponding path program 1 times [2022-11-02 20:47:46,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:46,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884569099] [2022-11-02 20:47:46,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:46,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:47,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:47,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:47,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884569099] [2022-11-02 20:47:47,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884569099] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:47,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:47,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:47:47,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238158327] [2022-11-02 20:47:47,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:47,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:47:47,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:47,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:47:47,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:47:47,160 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-11-02 20:47:47,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:47,438 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2022-11-02 20:47:47,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:47:47,438 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-11-02 20:47:47,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:47,439 INFO L225 Difference]: With dead ends: 139 [2022-11-02 20:47:47,439 INFO L226 Difference]: Without dead ends: 139 [2022-11-02 20:47:47,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:47:47,441 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 6 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:47,441 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.2s Time] [2022-11-02 20:47:47,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-02 20:47:47,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-11-02 20:47:47,445 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-11-02 20:47:47,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2022-11-02 20:47:47,451 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 10 [2022-11-02 20:47:47,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:47,451 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2022-11-02 20:47:47,452 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-11-02 20:47:47,452 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2022-11-02 20:47:47,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:47:47,452 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:47,452 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:47,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:47:47,453 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-11-02 20:47:47,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:47,454 INFO L85 PathProgramCache]: Analyzing trace with hash 592229104, now seen corresponding path program 1 times [2022-11-02 20:47:47,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:47,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366240739] [2022-11-02 20:47:47,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:47,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:47,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:47,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:47,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366240739] [2022-11-02 20:47:47,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366240739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:47,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:47,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:47:47,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214089775] [2022-11-02 20:47:47,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:47,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:47:47,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:47,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:47:47,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:47:47,638 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-11-02 20:47:47,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:47,917 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2022-11-02 20:47:47,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:47:47,918 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-11-02 20:47:47,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:47,919 INFO L225 Difference]: With dead ends: 146 [2022-11-02 20:47:47,919 INFO L226 Difference]: Without dead ends: 146 [2022-11-02 20:47:47,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:47:47,920 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 94 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:47,920 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.2s Time] [2022-11-02 20:47:47,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-02 20:47:47,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 138. [2022-11-02 20:47:47,924 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-11-02 20:47:47,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 153 transitions. [2022-11-02 20:47:47,925 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 153 transitions. Word has length 17 [2022-11-02 20:47:47,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:47,925 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 153 transitions. [2022-11-02 20:47:47,925 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-11-02 20:47:47,926 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 153 transitions. [2022-11-02 20:47:47,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-02 20:47:47,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:47,926 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:47:47,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:47:47,927 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-11-02 20:47:47,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:47,927 INFO L85 PathProgramCache]: Analyzing trace with hash 592229105, now seen corresponding path program 1 times [2022-11-02 20:47:47,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:47,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191366955] [2022-11-02 20:47:47,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:47,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:48,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:48,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191366955] [2022-11-02 20:47:48,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191366955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:48,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:48,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:47:48,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248640472] [2022-11-02 20:47:48,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:48,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:47:48,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:48,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:47:48,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:47:48,225 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-11-02 20:47:48,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:48,461 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2022-11-02 20:47:48,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:47:48,462 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-11-02 20:47:48,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:48,463 INFO L225 Difference]: With dead ends: 138 [2022-11-02 20:47:48,463 INFO L226 Difference]: Without dead ends: 138 [2022-11-02 20:47:48,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:47:48,464 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 8 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:48,465 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.2s Time] [2022-11-02 20:47:48,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-02 20:47:48,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2022-11-02 20:47:48,468 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-11-02 20:47:48,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2022-11-02 20:47:48,469 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 17 [2022-11-02 20:47:48,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:48,469 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2022-11-02 20:47:48,469 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-11-02 20:47:48,470 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2022-11-02 20:47:48,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:47:48,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:48,471 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-11-02 20:47:48,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:47:48,471 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-11-02 20:47:48,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:48,472 INFO L85 PathProgramCache]: Analyzing trace with hash 840457529, now seen corresponding path program 1 times [2022-11-02 20:47:48,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:48,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787325209] [2022-11-02 20:47:48,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:48,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:48,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:48,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:48,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:48,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787325209] [2022-11-02 20:47:48,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787325209] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:48,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:48,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:47:48,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989128820] [2022-11-02 20:47:48,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:48,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:48,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:48,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:48,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:48,553 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-11-02 20:47:48,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:48,648 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2022-11-02 20:47:48,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:48,649 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-11-02 20:47:48,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:48,650 INFO L225 Difference]: With dead ends: 141 [2022-11-02 20:47:48,650 INFO L226 Difference]: Without dead ends: 141 [2022-11-02 20:47:48,650 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-11-02 20:47:48,651 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 67 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:48,652 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.1s Time] [2022-11-02 20:47:48,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-02 20:47:48,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2022-11-02 20:47:48,655 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-11-02 20:47:48,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 145 transitions. [2022-11-02 20:47:48,655 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 145 transitions. Word has length 23 [2022-11-02 20:47:48,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:48,656 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 145 transitions. [2022-11-02 20:47:48,656 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-11-02 20:47:48,656 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 145 transitions. [2022-11-02 20:47:48,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-02 20:47:48,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:48,657 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-11-02 20:47:48,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:47:48,658 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-11-02 20:47:48,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:48,658 INFO L85 PathProgramCache]: Analyzing trace with hash 840457530, now seen corresponding path program 1 times [2022-11-02 20:47:48,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:48,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266868370] [2022-11-02 20:47:48,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:48,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:48,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:48,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:48,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266868370] [2022-11-02 20:47:48,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266868370] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:48,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:48,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:47:48,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833022340] [2022-11-02 20:47:48,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:48,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:48,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:48,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:48,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:48,842 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-11-02 20:47:48,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:48,935 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2022-11-02 20:47:48,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:48,936 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-11-02 20:47:48,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:48,937 INFO L225 Difference]: With dead ends: 136 [2022-11-02 20:47:48,937 INFO L226 Difference]: Without dead ends: 136 [2022-11-02 20:47:48,937 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-11-02 20:47:48,938 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 62 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:48,938 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.1s Time] [2022-11-02 20:47:48,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-02 20:47:48,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 125. [2022-11-02 20:47:48,941 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-11-02 20:47:48,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 140 transitions. [2022-11-02 20:47:48,942 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 140 transitions. Word has length 23 [2022-11-02 20:47:48,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:48,943 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 140 transitions. [2022-11-02 20:47:48,943 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-11-02 20:47:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 140 transitions. [2022-11-02 20:47:48,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:47:48,944 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:48,944 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-11-02 20:47:48,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:47:48,945 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-11-02 20:47:48,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:48,945 INFO L85 PathProgramCache]: Analyzing trace with hash 225913191, now seen corresponding path program 1 times [2022-11-02 20:47:48,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:48,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730717717] [2022-11-02 20:47:48,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:48,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:48,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:49,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:49,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:49,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730717717] [2022-11-02 20:47:49,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730717717] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:49,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:49,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:47:49,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816195766] [2022-11-02 20:47:49,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:49,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:47:49,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:49,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:47:49,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:47:49,121 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-11-02 20:47:49,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:49,326 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2022-11-02 20:47:49,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:47:49,327 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-11-02 20:47:49,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:49,328 INFO L225 Difference]: With dead ends: 175 [2022-11-02 20:47:49,328 INFO L226 Difference]: Without dead ends: 175 [2022-11-02 20:47:49,328 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-11-02 20:47:49,328 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.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:49,329 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.2s Time] [2022-11-02 20:47:49,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-11-02 20:47:49,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 132. [2022-11-02 20:47:49,331 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-11-02 20:47:49,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 152 transitions. [2022-11-02 20:47:49,332 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 152 transitions. Word has length 25 [2022-11-02 20:47:49,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:49,332 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 152 transitions. [2022-11-02 20:47:49,333 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-11-02 20:47:49,333 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 152 transitions. [2022-11-02 20:47:49,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-02 20:47:49,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:49,333 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-11-02 20:47:49,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:47:49,334 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-11-02 20:47:49,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:49,335 INFO L85 PathProgramCache]: Analyzing trace with hash 225913192, now seen corresponding path program 1 times [2022-11-02 20:47:49,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:49,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321443846] [2022-11-02 20:47:49,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:49,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:49,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:49,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:49,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321443846] [2022-11-02 20:47:49,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321443846] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:49,651 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:49,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:47:49,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429405836] [2022-11-02 20:47:49,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:49,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:47:49,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:49,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:47:49,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:47:49,653 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-11-02 20:47:50,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:50,054 INFO L93 Difference]: Finished difference Result 226 states and 250 transitions. [2022-11-02 20:47:50,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:47:50,055 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-11-02 20:47:50,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:50,057 INFO L225 Difference]: With dead ends: 226 [2022-11-02 20:47:50,057 INFO L226 Difference]: Without dead ends: 226 [2022-11-02 20:47:50,058 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-11-02 20:47:50,058 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 255 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:50,059 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.3s Time] [2022-11-02 20:47:50,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-11-02 20:47:50,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 170. [2022-11-02 20:47:50,063 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-11-02 20:47:50,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 209 transitions. [2022-11-02 20:47:50,064 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 209 transitions. Word has length 25 [2022-11-02 20:47:50,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:50,064 INFO L495 AbstractCegarLoop]: Abstraction has 170 states and 209 transitions. [2022-11-02 20:47:50,064 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-11-02 20:47:50,064 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 209 transitions. [2022-11-02 20:47:50,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-02 20:47:50,065 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:50,065 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-11-02 20:47:50,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 20:47:50,065 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-11-02 20:47:50,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:50,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1586624732, now seen corresponding path program 1 times [2022-11-02 20:47:50,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:50,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528652139] [2022-11-02 20:47:50,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:50,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:50,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:50,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:50,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528652139] [2022-11-02 20:47:50,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528652139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:50,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:50,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:47:50,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523009626] [2022-11-02 20:47:50,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:50,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:47:50,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:50,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:47:50,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:47:50,149 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-11-02 20:47:50,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:50,252 INFO L93 Difference]: Finished difference Result 210 states and 242 transitions. [2022-11-02 20:47:50,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:47:50,253 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-11-02 20:47:50,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:50,254 INFO L225 Difference]: With dead ends: 210 [2022-11-02 20:47:50,254 INFO L226 Difference]: Without dead ends: 210 [2022-11-02 20:47:50,254 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-11-02 20:47:50,255 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 188 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11-02 20:47:50,255 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-11-02 20:47:50,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-11-02 20:47:50,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 168. [2022-11-02 20:47:50,258 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-11-02 20:47:50,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 205 transitions. [2022-11-02 20:47:50,259 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 205 transitions. Word has length 26 [2022-11-02 20:47:50,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:50,259 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 205 transitions. [2022-11-02 20:47:50,259 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-11-02 20:47:50,260 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 205 transitions. [2022-11-02 20:47:50,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:47:50,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:50,260 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-11-02 20:47:50,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:47:50,261 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-11-02 20:47:50,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:50,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1044883735, now seen corresponding path program 1 times [2022-11-02 20:47:50,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:50,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897688525] [2022-11-02 20:47:50,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:50,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:50,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:51,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:51,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:51,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897688525] [2022-11-02 20:47:51,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897688525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:51,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:51,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-02 20:47:51,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081058454] [2022-11-02 20:47:51,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:51,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-02 20:47:51,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:51,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-02 20:47:51,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:47:51,226 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-11-02 20:47:52,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:52,365 INFO L93 Difference]: Finished difference Result 198 states and 231 transitions. [2022-11-02 20:47:52,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:47:52,366 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-11-02 20:47:52,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:52,367 INFO L225 Difference]: With dead ends: 198 [2022-11-02 20:47:52,367 INFO L226 Difference]: Without dead ends: 198 [2022-11-02 20:47:52,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=240, Invalid=950, Unknown=0, NotChecked=0, Total=1190 [2022-11-02 20:47:52,368 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 192 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:47:52,369 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.6s Time] [2022-11-02 20:47:52,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-11-02 20:47:52,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 174. [2022-11-02 20:47:52,372 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-11-02 20:47:52,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 209 transitions. [2022-11-02 20:47:52,373 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 209 transitions. Word has length 29 [2022-11-02 20:47:52,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:52,373 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 209 transitions. [2022-11-02 20:47:52,373 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-11-02 20:47:52,373 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 209 transitions. [2022-11-02 20:47:52,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-02 20:47:52,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:52,374 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-11-02 20:47:52,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:47:52,375 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-11-02 20:47:52,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:52,375 INFO L85 PathProgramCache]: Analyzing trace with hash 981328753, now seen corresponding path program 1 times [2022-11-02 20:47:52,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:52,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373757396] [2022-11-02 20:47:52,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:52,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:52,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:52,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:52,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373757396] [2022-11-02 20:47:52,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373757396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:52,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:52,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:47:52,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387360255] [2022-11-02 20:47:52,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:52,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:47:52,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:52,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:47:52,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:47:52,430 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-11-02 20:47:52,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:52,454 INFO L93 Difference]: Finished difference Result 172 states and 207 transitions. [2022-11-02 20:47:52,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:47:52,455 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-11-02 20:47:52,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:52,456 INFO L225 Difference]: With dead ends: 172 [2022-11-02 20:47:52,456 INFO L226 Difference]: Without dead ends: 172 [2022-11-02 20:47:52,456 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-11-02 20:47:52,457 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-11-02 20:47:52,457 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-11-02 20:47:52,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-11-02 20:47:52,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2022-11-02 20:47:52,461 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-11-02 20:47:52,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 207 transitions. [2022-11-02 20:47:52,461 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 207 transitions. Word has length 31 [2022-11-02 20:47:52,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:52,462 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 207 transitions. [2022-11-02 20:47:52,462 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-11-02 20:47:52,462 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 207 transitions. [2022-11-02 20:47:52,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-02 20:47:52,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:52,463 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-11-02 20:47:52,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:47:52,463 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-11-02 20:47:52,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:52,464 INFO L85 PathProgramCache]: Analyzing trace with hash 873646240, now seen corresponding path program 1 times [2022-11-02 20:47:52,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:52,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033434688] [2022-11-02 20:47:52,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:52,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:52,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:52,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:52,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:52,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033434688] [2022-11-02 20:47:52,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033434688] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:47:52,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:47:52,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:47:52,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648493645] [2022-11-02 20:47:52,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:47:52,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-02 20:47:52,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:52,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-02 20:47:52,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-02 20:47:52,567 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-11-02 20:47:52,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:47:52,680 INFO L93 Difference]: Finished difference Result 209 states and 238 transitions. [2022-11-02 20:47:52,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:47:52,680 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-11-02 20:47:52,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:47:52,681 INFO L225 Difference]: With dead ends: 209 [2022-11-02 20:47:52,681 INFO L226 Difference]: Without dead ends: 209 [2022-11-02 20:47:52,682 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-11-02 20:47:52,682 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-11-02 20:47:52,683 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-11-02 20:47:52,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-11-02 20:47:52,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 174. [2022-11-02 20:47:52,686 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-11-02 20:47:52,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 209 transitions. [2022-11-02 20:47:52,687 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 209 transitions. Word has length 35 [2022-11-02 20:47:52,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:47:52,687 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 209 transitions. [2022-11-02 20:47:52,687 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-11-02 20:47:52,688 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 209 transitions. [2022-11-02 20:47:52,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:47:52,688 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:47:52,688 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-11-02 20:47:52,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:47:52,689 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-11-02 20:47:52,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:47:52,689 INFO L85 PathProgramCache]: Analyzing trace with hash 124937643, now seen corresponding path program 1 times [2022-11-02 20:47:52,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:47:52,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45404765] [2022-11-02 20:47:52,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:52,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:47:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:53,848 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:53,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:47:53,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45404765] [2022-11-02 20:47:53,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45404765] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:47:53,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098952722] [2022-11-02 20:47:53,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:47:53,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:47:53,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:47:53,852 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:47:53,873 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:47:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:47:54,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-02 20:47:54,039 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:47:54,130 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-11-02 20:47:54,179 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:47:54,180 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-11-02 20:47:54,203 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-11-02 20:47:54,257 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-11-02 20:47:54,287 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-11-02 20:47:54,325 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:47:54,325 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-11-02 20:47:54,397 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-11-02 20:47:54,698 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-02 20:47:54,698 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-11-02 20:47:54,722 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-11-02 20:47:54,860 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-02 20:47:54,860 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-11-02 20:47:54,952 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-02 20:47:54,952 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-11-02 20:47:54,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 16 treesize of output 12 [2022-11-02 20:47:55,061 INFO L356 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-11-02 20:47:55,061 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-11-02 20:47:55,125 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-11-02 20:47:55,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-11-02 20:47:55,328 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:47:55,329 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-11-02 20:47:55,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:55,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:47:55,717 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-11-02 20:47:55,796 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-11-02 20:47:55,863 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-11-02 20:47:55,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-11-02 20:47:56,049 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-11-02 20:47:56,080 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:47:56,080 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-11-02 20:47:56,112 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-11-02 20:47:56,187 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-11-02 20:47:56,225 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-11-02 20:47:56,306 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:47:56,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2022-11-02 20:47:56,314 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:47:56,315 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:47:56,325 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:47:56,326 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-11-02 20:47:56,341 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:47:56,342 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-11-02 20:47:56,485 INFO L356 Elim1Store]: treesize reduction 27, result has 77.7 percent of original size [2022-11-02 20:47:56,486 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-11-02 20:47:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:47:58,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098952722] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:47:58,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:47:58,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 42 [2022-11-02 20:47:58,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144347184] [2022-11-02 20:47:58,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:47:58,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-02 20:47:58,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:47:58,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-02 20:47:58,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1031, Unknown=10, NotChecked=584, Total=1806 [2022-11-02 20:47:58,913 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-11-02 20:48:00,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:00,872 INFO L93 Difference]: Finished difference Result 279 states and 314 transitions. [2022-11-02 20:48:00,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-11-02 20:48:00,872 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-11-02 20:48:00,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:00,873 INFO L225 Difference]: With dead ends: 279 [2022-11-02 20:48:00,874 INFO L226 Difference]: Without dead ends: 279 [2022-11-02 20:48:00,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 60 SyntacticMatches, 9 SemanticMatches, 61 ConstructedPredicates, 8 IntricatePredicates, 1 DeprecatedPredicates, 911 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=496, Invalid=2496, Unknown=10, NotChecked=904, Total=3906 [2022-11-02 20:48:00,879 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 974 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:00,879 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.9s Time] [2022-11-02 20:48:00,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-11-02 20:48:00,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 192. [2022-11-02 20:48:00,885 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-11-02 20:48:00,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 231 transitions. [2022-11-02 20:48:00,886 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 231 transitions. Word has length 37 [2022-11-02 20:48:00,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:00,887 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 231 transitions. [2022-11-02 20:48:00,887 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-11-02 20:48:00,887 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 231 transitions. [2022-11-02 20:48:00,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:48:00,888 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:00,888 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-11-02 20:48:00,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:01,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 20:48:01,089 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-11-02 20:48:01,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:01,090 INFO L85 PathProgramCache]: Analyzing trace with hash 124937644, now seen corresponding path program 1 times [2022-11-02 20:48:01,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:01,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133666172] [2022-11-02 20:48:01,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:01,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:02,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:02,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:02,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133666172] [2022-11-02 20:48:02,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133666172] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:02,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912486343] [2022-11-02 20:48:02,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:02,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:02,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:02,772 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:02,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:48:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:02,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-02 20:48:02,970 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:02,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-11-02 20:48:02,989 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-11-02 20:48:03,024 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-11-02 20:48:03,043 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:48:03,043 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-11-02 20:48:03,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:03,084 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-11-02 20:48:03,092 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-11-02 20:48:03,141 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-11-02 20:48:03,237 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-11-02 20:48:03,267 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-11-02 20:48:03,291 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:48:03,292 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-11-02 20:48:03,367 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-11-02 20:48:03,380 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-11-02 20:48:03,469 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-11-02 20:48:03,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-11-02 20:48:03,627 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-11-02 20:48:03,659 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-11-02 20:48:03,784 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-02 20:48:03,785 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-11-02 20:48:03,831 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-11-02 20:48:03,854 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-11-02 20:48:04,055 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:04,055 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 21 [2022-11-02 20:48:04,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:04,138 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:48:04,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912486343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:48:04,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:48:04,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [17] total 34 [2022-11-02 20:48:04,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587845663] [2022-11-02 20:48:04,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:48:04,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-02 20:48:04,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:04,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-02 20:48:04,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2022-11-02 20:48:04,142 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-11-02 20:48:05,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:05,201 INFO L93 Difference]: Finished difference Result 204 states and 243 transitions. [2022-11-02 20:48:05,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:48:05,202 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-11-02 20:48:05,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:05,203 INFO L225 Difference]: With dead ends: 204 [2022-11-02 20:48:05,203 INFO L226 Difference]: Without dead ends: 203 [2022-11-02 20:48:05,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=255, Invalid=1907, Unknown=0, NotChecked=0, Total=2162 [2022-11-02 20:48:05,204 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 61 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:05,204 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.5s Time] [2022-11-02 20:48:05,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2022-11-02 20:48:05,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 200. [2022-11-02 20:48:05,208 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-11-02 20:48:05,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 239 transitions. [2022-11-02 20:48:05,209 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 239 transitions. Word has length 37 [2022-11-02 20:48:05,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:05,209 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 239 transitions. [2022-11-02 20:48:05,210 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-11-02 20:48:05,210 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 239 transitions. [2022-11-02 20:48:05,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:48:05,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:05,211 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-11-02 20:48:05,253 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:05,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-02 20:48:05,411 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-11-02 20:48:05,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:05,412 INFO L85 PathProgramCache]: Analyzing trace with hash -706370693, now seen corresponding path program 1 times [2022-11-02 20:48:05,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:05,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932446591] [2022-11-02 20:48:05,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:05,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:05,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:06,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:06,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932446591] [2022-11-02 20:48:06,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932446591] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:06,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1478645179] [2022-11-02 20:48:06,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:06,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:06,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:06,259 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:06,280 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:48:06,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:06,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 48 conjunts are in the unsatisfiable core [2022-11-02 20:48:06,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:06,433 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-11-02 20:48:06,451 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:48:06,451 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-11-02 20:48:06,462 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-11-02 20:48:06,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 14 treesize of output 16 [2022-11-02 20:48:06,515 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-11-02 20:48:06,533 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:48:06,533 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-11-02 20:48:06,549 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-11-02 20:48:06,688 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-02 20:48:06,689 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-11-02 20:48:06,701 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-11-02 20:48:06,782 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-02 20:48:06,782 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-11-02 20:48:06,838 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-02 20:48:06,839 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-11-02 20:48:06,856 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-11-02 20:48:06,939 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-02 20:48:06,939 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-11-02 20:48:07,108 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:07,111 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:07,111 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-11-02 20:48:07,131 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-11-02 20:48:07,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:07,136 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:07,422 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1117 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_53| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_53| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1117) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_53|) |c_ULTIMATE.start_main_~bucket~0#1.base|)))) (forall ((v_ArrVal_1117 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_53| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_53| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1117) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) 1)))) is different from false [2022-11-02 20:48:07,498 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1117 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_53| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_53| |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_1117) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_53|) |c_ULTIMATE.start_main_~bucket~0#1.base|)))) (forall ((v_ArrVal_1117 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_53| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_53| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1117) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) 1)))) is different from false [2022-11-02 20:48:07,521 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (and (forall ((v_ArrVal_1117 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_53| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_53| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1117) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) 1))) (forall ((v_ArrVal_1117 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_53| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) (not (= (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1117) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_53|) |c_ULTIMATE.start_main_~bucket~0#1.base|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_53| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))))) is different from false [2022-11-02 20:48:07,559 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:07,561 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 65 treesize of output 69 [2022-11-02 20:48:07,630 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|))) (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse1 |ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_#t~malloc4#1.base|)))) (or (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_1) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_2) |c_ULTIMATE.start_main_~bcki~0#1.base|) (forall ((v_ArrVal_1117 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_53| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1117) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_53|))) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_53| |c_ULTIMATE.start_main_~bucket~0#1.offset|))))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_1117 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_53| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse1 |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_1117) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_53|))) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_53| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_prenex_2 Int) (v_prenex_1 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| (store .cse1 |ULTIMATE.start_main_~bcki~0#1.offset| |c_ULTIMATE.start_main_#t~malloc4#1.base|)) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_prenex_1) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_2) |c_ULTIMATE.start_main_~bcki~0#1.base|) (not (<= v_prenex_2 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_2)))))) is different from false [2022-11-02 20:48:07,839 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:07,840 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-11-02 20:48:07,858 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:07,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:48:07,873 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_1117 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_53| Int)) (let ((.cse0 (select v_arrayElimArr_4 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_4) .cse0 v_ArrVal_1117) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_53|) |c_ULTIMATE.start_main_~bucket~0#1.base|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_53| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select |c_#valid| .cse0) 0))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_prenex_2 Int) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_1 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_3 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_3) .cse1 v_prenex_1) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_2) |c_ULTIMATE.start_main_~bcki~0#1.base|) (not (<= v_prenex_2 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_2)) (not (= (select |c_#valid| .cse1) 0)))))) is different from false [2022-11-02 20:48:07,954 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_1117 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_53| Int)) (let ((.cse0 (select v_arrayElimArr_4 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_4) .cse0 v_ArrVal_1117) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_53|) |c_ULTIMATE.start_main_~bucket~0#1.base|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_53| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select |c_#valid| .cse0) 0))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_prenex_2 Int) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_1 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_3 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (= |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_3) .cse1 v_prenex_1) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_2)) (not (<= v_prenex_2 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_2)) (not (= (select |c_#valid| .cse1) 0)))))) is different from false [2022-11-02 20:48:07,990 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_prenex_2 Int) (v_arrayElimArr_3 (Array Int Int)) (v_prenex_1 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_3 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (not (<= v_prenex_2 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_2)) (not (= (select |c_#valid| .cse0) 0)) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_3) .cse0 v_prenex_1) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_2))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_ArrVal_1117 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_53| Int)) (let ((.cse2 (select v_arrayElimArr_4 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_53|)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_4) .cse2 v_ArrVal_1117) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_53|) |c_ULTIMATE.start_main_~bucket~0#1.base|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_53| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select |c_#valid| .cse2) 0))))))) is different from false [2022-11-02 20:48:08,049 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:08,050 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 82 treesize of output 75 [2022-11-02 20:48:08,072 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:08,072 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 3 case distinctions, treesize of input 237 treesize of output 245 [2022-11-02 20:48:08,095 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 216 treesize of output 212 [2022-11-02 20:48:08,104 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 212 treesize of output 204 [2022-11-02 20:48:08,119 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:08,120 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 204 treesize of output 195 [2022-11-02 20:48:08,148 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:08,149 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 193 treesize of output 213 [2022-11-02 20:48:08,169 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:08,170 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 201 treesize of output 195 [2022-11-02 20:48:08,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:08,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1478645179] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:48:08,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:48:08,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 17] total 36 [2022-11-02 20:48:08,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961281990] [2022-11-02 20:48:08,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:08,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-11-02 20:48:08,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:08,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-11-02 20:48:08,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=765, Unknown=8, NotChecked=434, Total=1332 [2022-11-02 20:48:08,645 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-11-02 20:48:10,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:10,285 INFO L93 Difference]: Finished difference Result 220 states and 253 transitions. [2022-11-02 20:48:10,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-02 20:48:10,286 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-11-02 20:48:10,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:10,287 INFO L225 Difference]: With dead ends: 220 [2022-11-02 20:48:10,287 INFO L226 Difference]: Without dead ends: 220 [2022-11-02 20:48:10,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 60 SyntacticMatches, 9 SemanticMatches, 48 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=267, Invalid=1558, Unknown=9, NotChecked=616, Total=2450 [2022-11-02 20:48:10,288 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 226 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 2552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1488 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:10,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 994 Invalid, 2552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1026 Invalid, 0 Unknown, 1488 Unchecked, 0.8s Time] [2022-11-02 20:48:10,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-02 20:48:10,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 210. [2022-11-02 20:48:10,293 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-11-02 20:48:10,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 251 transitions. [2022-11-02 20:48:10,294 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 251 transitions. Word has length 38 [2022-11-02 20:48:10,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:10,294 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 251 transitions. [2022-11-02 20:48:10,294 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-11-02 20:48:10,294 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 251 transitions. [2022-11-02 20:48:10,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:48:10,295 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:10,295 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-11-02 20:48:10,323 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-02 20:48:10,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-02 20:48:10,510 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-11-02 20:48:10,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:10,510 INFO L85 PathProgramCache]: Analyzing trace with hash -706370692, now seen corresponding path program 1 times [2022-11-02 20:48:10,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:10,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293290106] [2022-11-02 20:48:10,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:10,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:10,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:11,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:11,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:11,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293290106] [2022-11-02 20:48:11,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293290106] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:11,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365110557] [2022-11-02 20:48:11,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:11,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:11,621 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:11,622 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:11,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:48:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:11,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 67 conjunts are in the unsatisfiable core [2022-11-02 20:48:11,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:11,823 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-11-02 20:48:11,855 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:48:11,856 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-11-02 20:48:11,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:48:11,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:48:12,072 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:48:12,073 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-11-02 20:48:12,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:12,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, 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-11-02 20:48:12,157 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:48:12,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-11-02 20:48:12,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:12,174 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-11-02 20:48:12,203 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:48:12,204 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-11-02 20:48:12,229 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-11-02 20:48:12,229 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-11-02 20:48:12,322 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-02 20:48:12,323 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-11-02 20:48:12,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:12,345 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-11-02 20:48:12,625 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:48:12,626 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-11-02 20:48:12,653 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:48:12,654 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-11-02 20:48:12,662 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-11-02 20:48:12,748 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:48:12,749 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-11-02 20:48:12,776 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:48:12,776 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-11-02 20:48:12,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 5 treesize of output 3 [2022-11-02 20:48:12,863 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:48:12,864 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-11-02 20:48:12,871 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-11-02 20:48:13,191 INFO L356 Elim1Store]: treesize reduction 54, result has 28.0 percent of original size [2022-11-02 20:48:13,191 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-11-02 20:48:13,264 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-02 20:48:13,264 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-11-02 20:48:13,574 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:13,579 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 20:48:13,580 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-11-02 20:48:13,589 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:13,590 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-11-02 20:48:13,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:13,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:14,081 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int) (v_ArrVal_1273 (Array Int Int))) (or (<= 0 (+ (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|) 4)) (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|)))) (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int 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|)) (<= (+ (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|) 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|)))))) is different from false [2022-11-02 20:48:14,154 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int 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|)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1273) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|))))) (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int) (v_ArrVal_1273 (Array Int 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|)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1273) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) 4))))) is different from false [2022-11-02 20:48:14,182 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int) (v_ArrVal_1273 (Array Int 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|)) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1273) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) 4)))) (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int) (v_ArrVal_1274 (Array Int Int)) (v_ArrVal_1273 (Array Int 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|)) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1273) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|))))))) is different from false [2022-11-02 20:48:14,574 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:14,574 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-11-02 20:48:14,790 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:14,790 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 142 treesize of output 146 [2022-11-02 20:48:14,905 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-11-02 20:48:15,011 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_prenex_5 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_6 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (forall ((v_ArrVal_1274 (Array Int Int))) (not (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_6) .cse0 v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_5)))) (not (= (select |c_#valid| .cse0) 0))))) (not (<= v_prenex_5 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_5)))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (forall ((v_ArrVal_1267 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int) (v_ArrVal_1273 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_12| 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|)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1267) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_1273) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) 4)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_12|) 0)))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_5 Int)) (or (not (<= v_prenex_5 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_6 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (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_6) .cse1 v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_5) |c_ULTIMATE.start_main_~bcki~0#1.base|)) (not (= (select |c_#valid| .cse1) 0))))) (not (<= 0 v_prenex_5)))))) (forall ((v_prenex_5 Int) (v_prenex_4 (Array Int Int)) (v_prenex_6 (Array Int Int)) (v_arrayElimCell_118 Int)) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_prenex_4) v_arrayElimCell_118 v_prenex_6) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_5) 5) (not (<= v_prenex_5 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_5)) (not (= 0 (select |c_#valid| v_arrayElimCell_118)))))) is different from false [2022-11-02 20:48:15,114 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1267 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int) (v_ArrVal_1273 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_12| Int)) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_59| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_ArrVal_1267) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_1273) |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 (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_12|) 0)))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_5 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_6 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (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_6) .cse0 v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_5))) (not (= (select |c_#valid| .cse0) 0))))) (not (<= v_prenex_5 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_5)))))) (forall ((v_prenex_5 Int) (v_prenex_4 (Array Int Int)) (v_prenex_6 (Array Int Int)) (v_arrayElimCell_118 Int)) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_prenex_4) v_arrayElimCell_118 v_prenex_6) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_5) 5) (not (<= v_prenex_5 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_5)) (not (= 0 (select |c_#valid| v_arrayElimCell_118))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_5 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_6 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (forall ((v_ArrVal_1274 (Array Int Int))) (not (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_6) .cse1 v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_5)))) (not (= (select |c_#valid| .cse1) 0))))) (not (<= v_prenex_5 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_5))))))) is different from false [2022-11-02 20:48:15,226 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_5 Int)) (or (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_6 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (forall ((v_ArrVal_1274 (Array Int Int))) (not (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_6) .cse0 v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_5)))) (not (= (select |c_#valid| .cse0) 0))))) (not (<= v_prenex_5 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_5)))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_prenex_5 Int)) (or (not (<= v_prenex_5 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (forall ((v_arrayElimArr_6 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_6 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (forall ((v_ArrVal_1274 (Array Int Int))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_6) .cse2 v_ArrVal_1274) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_5))) (not (= (select |c_#valid| .cse2) 0))))) (not (<= 0 v_prenex_5)))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (forall ((v_ArrVal_1267 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int) (v_ArrVal_1273 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_12| 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|)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1267) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_ArrVal_1273) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) 4)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_12|) 0)))) (forall ((v_prenex_5 Int) (v_prenex_4 (Array Int Int)) (v_prenex_6 (Array Int Int)) (v_arrayElimCell_118 Int)) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_prenex_4) v_arrayElimCell_118 v_prenex_6) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_5) 5) (not (<= v_prenex_5 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_5)) (not (= 0 (select |c_#valid| v_arrayElimCell_118))))))) is different from false [2022-11-02 20:48:15,370 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:15,370 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-11-02 20:48:15,374 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:15,381 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:15,382 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-11-02 20:48:15,399 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:15,399 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-11-02 20:48:15,433 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:15,433 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-11-02 20:48:15,437 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:15,445 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:15,445 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 37 treesize of output 37 [2022-11-02 20:48:15,457 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:15,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2022-11-02 20:48:15,540 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:15,540 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 21 treesize of output 22 [2022-11-02 20:48:15,545 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:15,552 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:15,553 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-11-02 20:48:15,561 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-11-02 20:48:15,612 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:15,612 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-11-02 20:48:15,617 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:15,626 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:15,626 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-11-02 20:48:15,642 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-11-02 20:48:15,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:15,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365110557] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:48:15,997 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:48:15,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 44 [2022-11-02 20:48:15,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579278224] [2022-11-02 20:48:15,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:15,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-11-02 20:48:15,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:15,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-11-02 20:48:16,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1318, Unknown=9, NotChecked=474, Total=1980 [2022-11-02 20:48:16,000 INFO L87 Difference]: Start difference. First operand 210 states and 251 transitions. Second operand has 45 states, 44 states have (on average 2.522727272727273) internal successors, (111), 45 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-11-02 20:48:17,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:17,727 INFO L93 Difference]: Finished difference Result 260 states and 296 transitions. [2022-11-02 20:48:17,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 20:48:17,728 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.522727272727273) internal successors, (111), 45 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-11-02 20:48:17,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:17,729 INFO L225 Difference]: With dead ends: 260 [2022-11-02 20:48:17,729 INFO L226 Difference]: Without dead ends: 260 [2022-11-02 20:48:17,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 52 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=349, Invalid=2316, Unknown=11, NotChecked=630, Total=3306 [2022-11-02 20:48:17,731 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 214 mSDsluCounter, 1088 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 2138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1553 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:17,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1169 Invalid, 2138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 546 Invalid, 0 Unknown, 1553 Unchecked, 0.5s Time] [2022-11-02 20:48:17,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-11-02 20:48:17,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 233. [2022-11-02 20:48:17,735 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-11-02 20:48:17,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 288 transitions. [2022-11-02 20:48:17,736 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 288 transitions. Word has length 38 [2022-11-02 20:48:17,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:17,737 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 288 transitions. [2022-11-02 20:48:17,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.522727272727273) internal successors, (111), 45 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-11-02 20:48:17,737 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 288 transitions. [2022-11-02 20:48:17,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:48:17,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:17,738 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-11-02 20:48:17,762 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-02 20:48:17,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-02 20:48:17,946 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-11-02 20:48:17,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:17,946 INFO L85 PathProgramCache]: Analyzing trace with hash 448725100, now seen corresponding path program 1 times [2022-11-02 20:48:17,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:17,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278120208] [2022-11-02 20:48:17,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:17,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:19,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:19,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278120208] [2022-11-02 20:48:19,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278120208] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:19,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873827529] [2022-11-02 20:48:19,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:19,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:19,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:19,304 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:19,305 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:48:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:19,492 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-02 20:48:19,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:19,514 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-11-02 20:48:19,545 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:48:19,545 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-11-02 20:48:19,593 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-11-02 20:48:19,598 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-11-02 20:48:19,777 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:48:19,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:48:19,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 5 treesize of output 3 [2022-11-02 20:48:19,800 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:48:19,800 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-11-02 20:48:19,897 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:48:19,897 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-11-02 20:48:19,908 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-11-02 20:48:19,920 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:48:19,920 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-11-02 20:48:19,982 INFO L356 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-11-02 20:48:19,982 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-11-02 20:48:20,002 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-11-02 20:48:20,087 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-02 20:48:20,087 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-11-02 20:48:20,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, 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-11-02 20:48:20,421 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:48:20,421 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-11-02 20:48:20,476 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:48:20,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-11-02 20:48:20,480 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-11-02 20:48:20,571 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:48:20,571 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-11-02 20:48:20,604 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:48:20,604 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-11-02 20:48:20,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 5 treesize of output 3 [2022-11-02 20:48:20,702 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:48:20,702 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-11-02 20:48:20,711 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-11-02 20:48:20,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:48:20,872 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-11-02 20:48:20,896 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-02 20:48:20,896 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-11-02 20:48:20,991 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-11-02 20:48:21,009 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:48:21,010 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-11-02 20:48:21,144 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:48:21,144 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-11-02 20:48:21,167 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-11-02 20:48:21,463 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:21,469 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 20:48:21,470 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-11-02 20:48:21,481 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:21,483 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-11-02 20:48:21,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:21,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:21,837 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int) (v_ArrVal_1452 (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|)) (<= 0 (+ 8 (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|))))) (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|)) (<= (+ 12 (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|)) (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|))) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_65|))))) is different from false [2022-11-02 20:48:22,198 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_ArrVal_1446 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int) (v_ArrVal_1452 (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|)) (<= 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 (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_41|) 0)))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1446 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1448 Int)) (or (<= (+ (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|))) (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 (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_41|) 0))))) is different from false [2022-11-02 20:48:22,324 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1446 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1448 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|)) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#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_#t~mem5#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|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_41|) 0)))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_ArrVal_1446 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int) (v_ArrVal_1452 (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|)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#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 (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_41|) 0))))) is different from false [2022-11-02 20:48:22,365 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_ArrVal_1446 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int) (v_ArrVal_1452 (Array Int Int))) (or (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 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|))) (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 (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_41|) 0)))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1446 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1451 (Array Int Int)) (v_ArrVal_1448 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|)) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 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|)) (select (store |c_#length| |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1448) (select (select (store (store |c_#memory_$Pointer$.base| .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|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_41|) 0)))))) is different from false [2022-11-02 20:48:22,904 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:22,904 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-11-02 20:48:24,376 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:24,377 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 320 treesize of output 324 [2022-11-02 20:48:24,600 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-11-02 20:48:24,874 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_10 Int)) (or (not (<= 0 v_prenex_10)) (forall ((v_arrayElimArr_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse0 (store |c_#valid| .cse1 1))) (or (not (= (select .cse0 |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)) (not (= (select |c_#valid| .cse1) 0)) (forall ((v_prenex_8 Int)) (or (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (not (= .cse1 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_11) .cse1 v_ArrVal_1447) v_prenex_8 v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10)))) (not (= (select .cse0 v_prenex_8) 0)))))))) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_ArrVal_1446 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int) (|v_ULTIMATE.start_main_#t~malloc4#1.base_15| Int) (v_ArrVal_1441 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (let ((.cse2 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_15| 1))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_65| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select .cse2 |v_ULTIMATE.start_main_~item~0#1.base_41|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_65|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_15|) 0)) (not (= (select .cse2 |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1441) |v_ULTIMATE.start_main_#t~malloc4#1.base_15| 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))))) (forall ((v_prenex_9 (Array Int Int)) (v_arrayElimCell_174 Int) (v_prenex_12 (Array Int Int)) (v_prenex_10 Int) (v_prenex_11 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse3 (store |c_#valid| v_arrayElimCell_174 1))) (or (not (<= 0 v_prenex_10)) (not (= (select .cse3 v_prenex_8) 0)) (< (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_prenex_11) v_arrayElimCell_174 v_prenex_9) v_prenex_8 v_prenex_12) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10) 1) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select .cse3 |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)) (not (= (select |c_#valid| v_arrayElimCell_174) 0))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_10 Int)) (or (not (<= 0 v_prenex_10)) (forall ((v_arrayElimArr_11 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse4 (store |c_#valid| .cse5 1))) (or (forall ((v_prenex_8 Int)) (or (not (= (select .cse4 v_prenex_8) 0)) (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (= |c_ULTIMATE.start_main_~bcki~0#1.base| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_11) .cse5 v_ArrVal_1447) v_prenex_8 v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10))))) (not (= (select .cse4 |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)) (not (= (select |c_#valid| .cse5) 0)))))) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_prenex_10 Int)) (or (not (<= 0 v_prenex_10)) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (forall ((v_arrayElimArr_11 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse7 (store |c_#valid| .cse6 1))) (or (forall ((v_prenex_8 Int)) (or (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_11) .cse6 v_ArrVal_1447) v_prenex_8 v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10) v_prenex_8))) (not (= (select .cse7 v_prenex_8) 0)))) (not (= (select .cse7 |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)) (not (= (select |c_#valid| .cse6) 0)))))))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|))))) is different from false [2022-11-02 20:48:25,087 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_prenex_10 Int)) (or (not (<= 0 v_prenex_10)) (forall ((v_arrayElimArr_11 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse0 (store |c_#valid| .cse1 1))) (or (not (= (select .cse0 |c_ULTIMATE.start_main_#t~mem3#1.base|) 1)) (not (= (select |c_#valid| .cse1) 0)) (forall ((v_prenex_8 Int)) (or (not (= (select .cse0 v_prenex_8) 0)) (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (not (= .cse1 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_11) .cse1 v_ArrVal_1447) v_prenex_8 v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10)))))))))) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (forall ((v_prenex_9 (Array Int Int)) (v_arrayElimCell_174 Int) (v_prenex_12 (Array Int Int)) (v_prenex_10 Int) (v_prenex_11 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse2 (store |c_#valid| v_arrayElimCell_174 1))) (or (not (= (select .cse2 |c_ULTIMATE.start_main_#t~mem3#1.base|) 1)) (not (<= 0 v_prenex_10)) (not (= (select .cse2 v_prenex_8) 0)) (< (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_prenex_11) v_arrayElimCell_174 v_prenex_9) v_prenex_8 v_prenex_12) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10) 1) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select |c_#valid| v_arrayElimCell_174) 0))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_ArrVal_1446 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int) (|v_ULTIMATE.start_main_#t~malloc4#1.base_15| Int) (v_ArrVal_1441 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (let ((.cse3 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_15| 1))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_65| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select .cse3 |v_ULTIMATE.start_main_~item~0#1.base_41|) 0)) (not (= (select .cse3 |c_ULTIMATE.start_main_#t~mem3#1.base|) 1)) (<= 0 (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_ArrVal_1441) |v_ULTIMATE.start_main_#t~malloc4#1.base_15| 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|))) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_65|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_15|) 0))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_10 Int)) (or (not (<= 0 v_prenex_10)) (forall ((v_arrayElimArr_11 (Array Int Int))) (let ((.cse5 (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse4 (store |c_#valid| .cse5 1))) (or (not (= (select .cse4 |c_ULTIMATE.start_main_#t~mem3#1.base|) 1)) (not (= (select |c_#valid| .cse5) 0)) (forall ((v_prenex_8 Int)) (or (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (not (= v_prenex_8 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_11) .cse5 v_ArrVal_1447) v_prenex_8 v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10)))) (not (= (select .cse4 v_prenex_8) 0)))))))) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_10 Int)) (or (not (<= 0 v_prenex_10)) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (forall ((v_arrayElimArr_11 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse6 (store |c_#valid| .cse7 1))) (or (not (= (select .cse6 |c_ULTIMATE.start_main_#t~mem3#1.base|) 1)) (not (= (select |c_#valid| .cse7) 0)) (forall ((v_prenex_8 Int)) (or (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_11) .cse7 v_ArrVal_1447) v_prenex_8 v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10))) (not (= (select .cse6 v_prenex_8) 0))))))))))))) is different from false [2022-11-02 20:48:25,325 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (and (forall ((v_prenex_9 (Array Int Int)) (v_arrayElimCell_174 Int) (v_prenex_12 (Array Int Int)) (v_prenex_10 Int) (v_prenex_11 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse0 (store |c_#valid| v_arrayElimCell_174 1))) (or (not (<= 0 v_prenex_10)) (not (= (select .cse0 .cse1) 1)) (< (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_prenex_11) v_arrayElimCell_174 v_prenex_9) v_prenex_8 v_prenex_12) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10) 1) (not (= (select .cse0 v_prenex_8) 0)) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select |c_#valid| v_arrayElimCell_174) 0))))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_ArrVal_1446 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int) (|v_ULTIMATE.start_main_#t~malloc4#1.base_15| Int) (v_ArrVal_1441 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (let ((.cse2 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_15| 1))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_65| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select .cse2 |v_ULTIMATE.start_main_~item~0#1.base_41|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_65|)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_15|) 0)) (not (= (select .cse2 .cse1) 1)) (<= 0 (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1441) |v_ULTIMATE.start_main_#t~malloc4#1.base_15| 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|)))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_10 Int)) (or (not (<= 0 v_prenex_10)) (forall ((v_arrayElimArr_11 (Array Int Int))) (let ((.cse4 (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse3 (store |c_#valid| .cse4 1))) (or (not (= (select .cse3 .cse1) 1)) (forall ((v_prenex_8 Int)) (or (not (= (select .cse3 v_prenex_8) 0)) (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (not (= .cse4 (select (select (store (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_11) .cse4 v_ArrVal_1447) v_prenex_8 v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10)))))) (not (= (select |c_#valid| .cse4) 0)))))) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_10 Int)) (or (not (<= 0 v_prenex_10)) (forall ((v_arrayElimArr_11 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse5 (store |c_#valid| .cse6 1))) (or (not (= (select .cse5 .cse1) 1)) (forall ((v_prenex_8 Int)) (or (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_11) .cse6 v_ArrVal_1447) v_prenex_8 v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10) .cse1)) (not (= (select .cse5 v_prenex_8) 0)))) (not (= (select |c_#valid| .cse6) 0)))))) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_prenex_10 Int)) (or (not (<= 0 v_prenex_10)) (forall ((v_arrayElimArr_11 (Array Int Int))) (let ((.cse8 (select v_arrayElimArr_11 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse7 (store |c_#valid| .cse8 1))) (or (not (= (select .cse7 .cse1) 1)) (forall ((v_prenex_8 Int)) (or (not (= (select .cse7 v_prenex_8) 0)) (forall ((v_ArrVal_1447 (Array Int Int)) (v_ArrVal_1451 (Array Int Int))) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_11) .cse8 v_ArrVal_1447) v_prenex_8 v_ArrVal_1451) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_10) v_prenex_8))))) (not (= (select |c_#valid| .cse8) 0)))))) (not (<= v_prenex_10 |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))))) is different from false [2022-11-02 20:48:25,652 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:25,652 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-11-02 20:48:25,657 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:25,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:25,667 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:25,667 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-11-02 20:48:25,681 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-11-02 20:48:25,718 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:25,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, 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-11-02 20:48:25,724 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:25,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:25,736 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:25,736 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-11-02 20:48:25,752 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:25,752 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 40 treesize of output 40 [2022-11-02 20:48:25,799 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:25,799 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-11-02 20:48:25,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:25,807 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:25,819 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:25,819 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-11-02 20:48:25,836 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:25,836 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 51 treesize of output 51 [2022-11-02 20:48:25,954 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:25,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-02 20:48:25,960 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:25,961 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:25,973 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:25,973 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 37 treesize of output 37 [2022-11-02 20:48:25,990 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:25,991 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 55 treesize of output 51 [2022-11-02 20:48:26,099 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:26,100 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-11-02 20:48:26,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:26,106 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:26,118 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:26,118 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-11-02 20:48:26,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 11 treesize of output 9 [2022-11-02 20:48:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:26,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873827529] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:48:26,650 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:48:26,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 47 [2022-11-02 20:48:26,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556122553] [2022-11-02 20:48:26,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:26,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-02 20:48:26,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:26,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-02 20:48:26,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1432, Unknown=10, NotChecked=588, Total=2256 [2022-11-02 20:48:26,653 INFO L87 Difference]: Start difference. First operand 233 states and 288 transitions. Second operand has 48 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 48 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-11-02 20:48:29,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:29,052 INFO L93 Difference]: Finished difference Result 288 states and 330 transitions. [2022-11-02 20:48:29,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-02 20:48:29,052 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 48 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-11-02 20:48:29,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:29,054 INFO L225 Difference]: With dead ends: 288 [2022-11-02 20:48:29,054 INFO L226 Difference]: Without dead ends: 288 [2022-11-02 20:48:29,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 59 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=417, Invalid=2461, Unknown=12, NotChecked=770, Total=3660 [2022-11-02 20:48:29,056 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 214 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 2576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1737 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:29,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1625 Invalid, 2576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 808 Invalid, 0 Unknown, 1737 Unchecked, 0.7s Time] [2022-11-02 20:48:29,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2022-11-02 20:48:29,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 247. [2022-11-02 20:48:29,061 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-11-02 20:48:29,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 304 transitions. [2022-11-02 20:48:29,062 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 304 transitions. Word has length 38 [2022-11-02 20:48:29,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:29,063 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 304 transitions. [2022-11-02 20:48:29,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 48 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-11-02 20:48:29,063 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 304 transitions. [2022-11-02 20:48:29,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:48:29,064 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:29,064 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-11-02 20:48:29,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:29,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:29,274 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-11-02 20:48:29,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:29,274 INFO L85 PathProgramCache]: Analyzing trace with hash -372876340, now seen corresponding path program 1 times [2022-11-02 20:48:29,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:29,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512175315] [2022-11-02 20:48:29,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:29,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:30,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:30,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:30,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512175315] [2022-11-02 20:48:30,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512175315] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:30,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103276413] [2022-11-02 20:48:30,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:30,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:30,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:30,657 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:30,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:48:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:30,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-02 20:48:30,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:30,845 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-11-02 20:48:30,888 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:48:30,888 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-11-02 20:48:30,950 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-11-02 20:48:30,961 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-11-02 20:48:31,187 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:48:31,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-02 20:48:31,198 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-11-02 20:48:31,217 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:48:31,218 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-11-02 20:48:31,336 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:48:31,337 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-11-02 20:48:31,342 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-11-02 20:48:31,366 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:48:31,367 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-11-02 20:48:31,428 INFO L356 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-11-02 20:48:31,428 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-11-02 20:48:31,454 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-11-02 20:48:31,556 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:48:31,556 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-11-02 20:48:31,568 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-11-02 20:48:31,601 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-02 20:48:31,601 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-11-02 20:48:31,984 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:48:31,984 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-11-02 20:48:32,024 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:48:32,025 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-11-02 20:48:32,043 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-11-02 20:48:32,140 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:48:32,141 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-11-02 20:48:32,190 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:48:32,190 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-11-02 20:48:32,198 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-11-02 20:48:32,298 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:48:32,298 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-11-02 20:48:32,309 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-11-02 20:48:32,520 INFO L356 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-11-02 20:48:32,521 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-11-02 20:48:32,532 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-11-02 20:48:32,641 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:48:32,642 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-11-02 20:48:32,667 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-11-02 20:48:32,804 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-02 20:48:32,804 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-11-02 20:48:32,812 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-11-02 20:48:33,130 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:33,135 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-02 20:48:33,135 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-11-02 20:48:33,141 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:33,143 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-11-02 20:48:33,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:33,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:33,492 WARN L833 $PredicateComparison]: unable to prove that (and (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|)) (<= (+ (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|) 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|))) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)))) (forall ((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|)) (<= 0 (+ (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|) 8)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_71|))))) is different from false [2022-11-02 20:48:35,879 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~item~0#1.base_44| Int) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int))) (or (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1625 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_71| Int) (v_ArrVal_1622 Int)) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_71| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (<= (+ 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|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_44|) 0)))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_44| Int) (v_ArrVal_1620 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_44|) 0)) (forall ((v_ArrVal_1625 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_71| Int)) (or (<= 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|))) (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|))))))) is different from false [2022-11-02 20:48:36,014 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~item~0#1.base_44| Int) (v_ArrVal_1620 (Array Int Int))) (or (forall ((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|)) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#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|))) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_44|) 0)))) (forall ((|v_ULTIMATE.start_main_~item~0#1.base_44| Int) (v_ArrVal_1621 (Array Int Int)) (v_ArrVal_1620 (Array Int Int))) (or (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1625 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_71| Int) (v_ArrVal_1622 Int)) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_71| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#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_#t~mem5#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|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_44|) 0))))) is different from false [2022-11-02 20:48:36,062 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~item~0#1.base_44| Int) (v_ArrVal_1620 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_44|) 0)) (forall ((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|)) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 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_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)) (forall ((v_ArrVal_1626 (Array Int Int)) (v_ArrVal_1625 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_71| Int) (v_ArrVal_1622 Int)) (or (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 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|) 12) (select (store |c_#length| |v_ULTIMATE.start_main_~item~0#1.base_44| v_ArrVal_1622) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 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 (<= |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|)))))))) is different from false [2022-11-02 20:48:36,641 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:36,642 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-11-02 20:48:39,686 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:39,686 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 589 treesize of output 576 [2022-11-02 20:48:39,957 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-11-02 20:48:40,357 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_27 Int) (v_ArrVal_1626 (Array Int Int)) (v_prenex_26 Int) (v_ArrVal_1621 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_17 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse1 (store |c_#valid| .cse0 1))) (or (not (<= v_prenex_26 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_17) .cse0 v_ArrVal_1621) v_prenex_27 v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_26) |c_ULTIMATE.start_main_~bcki~0#1.base|) (not (= (select .cse1 |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)) (not (<= 0 v_prenex_26)) (not (= (select |c_#valid| .cse0) 0)) (not (= (select .cse1 v_prenex_27) 0)))))))) (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_arrayElimCell_235 Int) (v_prenex_28 (Array Int Int))) (let ((.cse2 (store |c_#valid| v_arrayElimCell_235 1))) (or (not (= (select |c_#valid| v_arrayElimCell_235) 0)) (not (= (select .cse2 v_prenex_27) 0)) (not (= (select .cse2 |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)) (not (<= v_prenex_26 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_26)) (< (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_prenex_24) v_arrayElimCell_235 v_prenex_28) v_prenex_27 v_prenex_25) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_26) 1)))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_27 Int) (v_ArrVal_1626 (Array Int Int)) (v_prenex_26 Int) (v_ArrVal_1621 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_17 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse4 (store |c_#valid| .cse3 1))) (or (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_17) .cse3 v_ArrVal_1621) v_prenex_27 v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_26) v_prenex_27)) (not (<= v_prenex_26 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select .cse4 |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)) (not (<= 0 v_prenex_26)) (not (= (select |c_#valid| .cse3) 0)) (not (= (select .cse4 v_prenex_27) 0)))))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_prenex_27 Int) (v_ArrVal_1626 (Array Int Int)) (v_prenex_26 Int) (v_ArrVal_1621 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_17 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse5 (store |c_#valid| .cse6 1))) (or (not (<= v_prenex_26 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select .cse5 |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)) (not (<= 0 v_prenex_26)) (not (= (select |c_#valid| .cse6) 0)) (not (= (select .cse5 v_prenex_27) 0)) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_17) .cse6 v_ArrVal_1621) v_prenex_27 v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_26) .cse6)))))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (forall ((v_ArrVal_1614 (Array Int Int)) (v_ArrVal_1625 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_71| Int) (|v_ULTIMATE.start_main_~item~0#1.base_44| Int) (v_ArrVal_1620 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_18| Int)) (let ((.cse7 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_18| 1))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_18|))) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_71| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select .cse7 |c_ULTIMATE.start_main_~bcki~0#1.base|) 1)) (<= 0 (+ 8 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1614) |v_ULTIMATE.start_main_#t~malloc4#1.base_18| 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|))) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)) (not (= (select .cse7 |v_ULTIMATE.start_main_~item~0#1.base_44|) 0)))))) is different from false [2022-11-02 20:48:40,539 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_27 Int) (v_ArrVal_1626 (Array Int Int)) (v_prenex_26 Int) (v_ArrVal_1621 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_17 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse1 (store |c_#valid| .cse0 1))) (or (not (<= v_prenex_26 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= v_prenex_27 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_17) .cse0 v_ArrVal_1621) v_prenex_27 v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_26))) (not (<= 0 v_prenex_26)) (not (= (select |c_#valid| .cse0) 0)) (not (= (select .cse1 |c_ULTIMATE.start_main_#t~mem3#1.base|) 1)) (not (= (select .cse1 v_prenex_27) 0)))))))) (forall ((v_ArrVal_1614 (Array Int Int)) (v_ArrVal_1625 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_71| Int) (|v_ULTIMATE.start_main_~item~0#1.base_44| Int) (v_ArrVal_1620 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_18| Int)) (let ((.cse2 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_18| 1))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_18|))) (not (= (select .cse2 |c_ULTIMATE.start_main_#t~mem3#1.base|) 1)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_71| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_ArrVal_1614) |v_ULTIMATE.start_main_#t~malloc4#1.base_18| 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)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)) (not (= (select .cse2 |v_ULTIMATE.start_main_~item~0#1.base_44|) 0))))) (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_arrayElimCell_235 Int) (v_prenex_28 (Array Int Int))) (let ((.cse3 (store |c_#valid| v_arrayElimCell_235 1))) (or (not (= (select |c_#valid| v_arrayElimCell_235) 0)) (not (= (select .cse3 v_prenex_27) 0)) (not (<= v_prenex_26 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select .cse3 |c_ULTIMATE.start_main_#t~mem3#1.base|) 1)) (not (<= 0 v_prenex_26)) (< (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_prenex_24) v_arrayElimCell_235 v_prenex_28) v_prenex_27 v_prenex_25) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_26) 1)))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_27 Int) (v_ArrVal_1626 (Array Int Int)) (v_prenex_26 Int) (v_ArrVal_1621 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int))) (let ((.cse4 (select v_arrayElimArr_17 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse5 (store |c_#valid| .cse4 1))) (or (not (= .cse4 (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_17) .cse4 v_ArrVal_1621) v_prenex_27 v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_26))) (not (<= v_prenex_26 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_26)) (not (= (select |c_#valid| .cse4) 0)) (not (= (select .cse5 |c_ULTIMATE.start_main_#t~mem3#1.base|) 1)) (not (= (select .cse5 v_prenex_27) 0)))))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_27 Int) (v_ArrVal_1626 (Array Int Int)) (v_prenex_26 Int) (v_ArrVal_1621 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int))) (let ((.cse6 (select v_arrayElimArr_17 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse7 (store |c_#valid| .cse6 1))) (or (not (<= v_prenex_26 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (= |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_17) .cse6 v_ArrVal_1621) v_prenex_27 v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_26)) (not (<= 0 v_prenex_26)) (not (= (select |c_#valid| .cse6) 0)) (not (= (select .cse7 |c_ULTIMATE.start_main_#t~mem3#1.base|) 1)) (not (= (select .cse7 v_prenex_27) 0))))))))) is different from false [2022-11-02 20:48:40,705 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (and (forall ((v_prenex_27 Int) (v_prenex_26 Int) (v_prenex_25 (Array Int Int)) (v_prenex_24 (Array Int Int)) (v_arrayElimCell_235 Int) (v_prenex_28 (Array Int Int))) (let ((.cse0 (store |c_#valid| v_arrayElimCell_235 1))) (or (not (= (select |c_#valid| v_arrayElimCell_235) 0)) (not (= (select .cse0 v_prenex_27) 0)) (not (<= v_prenex_26 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_26)) (not (= (select .cse0 .cse1) 1)) (< (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_prenex_24) v_arrayElimCell_235 v_prenex_28) v_prenex_27 v_prenex_25) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_26) 1)))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_prenex_27 Int) (v_ArrVal_1626 (Array Int Int)) (v_prenex_26 Int) (v_ArrVal_1621 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int))) (let ((.cse2 (select v_arrayElimArr_17 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse3 (store |c_#valid| .cse2 1))) (or (not (<= v_prenex_26 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_26)) (not (= (select |c_#valid| .cse2) 0)) (not (= (select .cse3 .cse1) 1)) (not (= (select .cse3 v_prenex_27) 0)) (not (= .cse2 (select (select (store (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_17) .cse2 v_ArrVal_1621) v_prenex_27 v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_26))))))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_27 Int) (v_ArrVal_1626 (Array Int Int)) (v_prenex_26 Int) (v_ArrVal_1621 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int))) (let ((.cse4 (select v_arrayElimArr_17 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse5 (store |c_#valid| .cse4 1))) (or (not (= v_prenex_27 (select (select (store (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_17) .cse4 v_ArrVal_1621) v_prenex_27 v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_26))) (not (<= v_prenex_26 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_26)) (not (= (select |c_#valid| .cse4) 0)) (not (= (select .cse5 .cse1) 1)) (not (= (select .cse5 v_prenex_27) 0)))))))) (forall ((v_ArrVal_1614 (Array Int Int)) (v_ArrVal_1625 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_71| Int) (|v_ULTIMATE.start_main_~item~0#1.base_44| Int) (v_ArrVal_1620 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_18| Int)) (let ((.cse6 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_18| 1))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_18|))) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_71| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select .cse6 .cse1) 1)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_71|)) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1614) |v_ULTIMATE.start_main_#t~malloc4#1.base_18| 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)) (not (= (select .cse6 |v_ULTIMATE.start_main_~item~0#1.base_44|) 0))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_prenex_27 Int) (v_ArrVal_1626 (Array Int Int)) (v_prenex_26 Int) (v_ArrVal_1621 (Array Int Int)) (v_arrayElimArr_17 (Array Int Int))) (let ((.cse7 (select v_arrayElimArr_17 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse8 (store |c_#valid| .cse7 1))) (or (= .cse1 (select (select (store (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_17) .cse7 v_ArrVal_1621) v_prenex_27 v_ArrVal_1626) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_26)) (not (<= v_prenex_26 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_26)) (not (= (select |c_#valid| .cse7) 0)) (not (= (select .cse8 .cse1) 1)) (not (= (select .cse8 v_prenex_27) 0)))))))))) is different from false [2022-11-02 20:48:40,940 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:40,940 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-11-02 20:48:40,957 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:40,958 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 550 treesize of output 538 [2022-11-02 20:48:40,977 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 526 treesize of output 494 [2022-11-02 20:48:40,993 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 494 treesize of output 486 [2022-11-02 20:48:41,006 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 486 treesize of output 470 [2022-11-02 20:48:41,317 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:41,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-02 20:48:41,334 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:41,335 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 647 treesize of output 635 [2022-11-02 20:48:41,362 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:41,363 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 653 treesize of output 519 [2022-11-02 20:48:41,376 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 486 treesize of output 454 [2022-11-02 20:48:41,389 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 454 treesize of output 438 [2022-11-02 20:48:41,645 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:41,645 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-11-02 20:48:41,661 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:41,662 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 291 treesize of output 287 [2022-11-02 20:48:41,700 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:41,700 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 305 treesize of output 271 [2022-11-02 20:48:41,711 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 238 treesize of output 230 [2022-11-02 20:48:41,721 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 230 treesize of output 214 [2022-11-02 20:48:41,949 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:41,949 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-11-02 20:48:41,964 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:41,965 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 974 treesize of output 946 [2022-11-02 20:48:41,988 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 934 treesize of output 902 [2022-11-02 20:48:42,003 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 902 treesize of output 886 [2022-11-02 20:48:42,027 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 886 treesize of output 822 [2022-11-02 20:48:43,060 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:43,060 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-11-02 20:48:43,081 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:43,081 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 128 treesize of output 128 [2022-11-02 20:48:43,095 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 116 treesize of output 108 [2022-11-02 20:48:43,104 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 108 treesize of output 104 [2022-11-02 20:48:43,120 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:43,126 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 134 treesize of output 126 [2022-11-02 20:48:43,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:43,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103276413] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:48:44,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:48:44,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 47 [2022-11-02 20:48:44,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086926396] [2022-11-02 20:48:44,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:44,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-02 20:48:44,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:44,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-02 20:48:44,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1427, Unknown=10, NotChecked=588, Total=2256 [2022-11-02 20:48:44,002 INFO L87 Difference]: Start difference. First operand 247 states and 304 transitions. Second operand has 48 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 48 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-11-02 20:48:46,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:46,133 INFO L93 Difference]: Finished difference Result 265 states and 323 transitions. [2022-11-02 20:48:46,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:48:46,134 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 48 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-11-02 20:48:46,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:46,136 INFO L225 Difference]: With dead ends: 265 [2022-11-02 20:48:46,136 INFO L226 Difference]: Without dead ends: 265 [2022-11-02 20:48:46,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 52 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 7 IntricatePredicates, 2 DeprecatedPredicates, 799 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=364, Invalid=2202, Unknown=12, NotChecked=728, Total=3306 [2022-11-02 20:48:46,138 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 158 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1387 SdHoareTripleChecker+Invalid, 1370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1051 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:46,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1387 Invalid, 1370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 318 Invalid, 0 Unknown, 1051 Unchecked, 0.3s Time] [2022-11-02 20:48:46,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2022-11-02 20:48:46,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 247. [2022-11-02 20:48:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 218 states have (on average 1.389908256880734) internal successors, (303), 246 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:46,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 303 transitions. [2022-11-02 20:48:46,144 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 303 transitions. Word has length 38 [2022-11-02 20:48:46,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:46,144 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 303 transitions. [2022-11-02 20:48:46,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.3191489361702127) internal successors, (109), 48 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-11-02 20:48:46,145 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 303 transitions. [2022-11-02 20:48:46,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-02 20:48:46,145 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:46,145 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-11-02 20:48:46,178 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:46,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:46,370 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-11-02 20:48:46,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:46,370 INFO L85 PathProgramCache]: Analyzing trace with hash -422654064, now seen corresponding path program 1 times [2022-11-02 20:48:46,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:46,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998668589] [2022-11-02 20:48:46,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:46,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:46,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:47,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:47,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:47,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998668589] [2022-11-02 20:48:47,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998668589] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:47,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615670757] [2022-11-02 20:48:47,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:47,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:47,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:47,085 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:47,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:48:47,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:47,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-02 20:48:47,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:47,320 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-11-02 20:48:47,363 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:48:47,363 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-11-02 20:48:47,378 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-11-02 20:48:47,502 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:48:47,502 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-11-02 20:48:47,525 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:48:47,525 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-11-02 20:48:47,554 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:48:47,555 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-11-02 20:48:47,609 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-02 20:48:47,610 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-11-02 20:48:47,802 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-02 20:48:47,803 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-11-02 20:48:47,817 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-11-02 20:48:47,899 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-02 20:48:47,899 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-11-02 20:48:47,967 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-11-02 20:48:47,968 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-11-02 20:48:47,985 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-11-02 20:48:48,106 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-02 20:48:48,107 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-11-02 20:48:48,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:48,202 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:48,202 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-11-02 20:48:48,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:48,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:48,379 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-11-02 20:48:48,411 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-11-02 20:48:48,425 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-11-02 20:48:48,449 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-11-02 20:48:48,532 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:48,532 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-11-02 20:48:48,551 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_arrayElimArr_23 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_76| Int) (v_ArrVal_1770 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_23 |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 |c_#valid| .cse0) 0)) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_arrayElimArr_23) .cse0 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-11-02 20:48:48,588 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_arrayElimArr_23 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_76| Int) (v_ArrVal_1770 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_23 |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_23) .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-11-02 20:48:48,606 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_arrayElimArr_23 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_76| Int) (v_ArrVal_1770 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_23 |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_23) .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-11-02 20:48:48,634 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:48,634 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-11-02 20:48:48,638 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:48,646 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:48,646 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-11-02 20:48:48,657 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:48,658 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-11-02 20:48:48,671 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:48:48,671 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-11-02 20:48:48,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:48,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615670757] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:48:48,845 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:48:48,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 16] total 38 [2022-11-02 20:48:48,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594929207] [2022-11-02 20:48:48,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:48,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-02 20:48:48,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:48,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-02 20:48:48,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=781, Unknown=7, NotChecked=448, Total=1406 [2022-11-02 20:48:48,847 INFO L87 Difference]: Start difference. First operand 247 states and 303 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-11-02 20:48:51,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:51,407 INFO L93 Difference]: Finished difference Result 258 states and 303 transitions. [2022-11-02 20:48:51,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:48:51,407 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-11-02 20:48:51,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:51,408 INFO L225 Difference]: With dead ends: 258 [2022-11-02 20:48:51,409 INFO L226 Difference]: Without dead ends: 258 [2022-11-02 20:48:51,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 61 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 7 IntricatePredicates, 1 DeprecatedPredicates, 515 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=317, Invalid=1510, Unknown=7, NotChecked=616, Total=2450 [2022-11-02 20:48:51,410 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 176 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 1836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1391 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:51,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 984 Invalid, 1836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 423 Invalid, 0 Unknown, 1391 Unchecked, 0.4s Time] [2022-11-02 20:48:51,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-11-02 20:48:51,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 247. [2022-11-02 20:48:51,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 218 states have (on average 1.385321100917431) internal successors, (302), 246 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:48:51,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 302 transitions. [2022-11-02 20:48:51,416 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 302 transitions. Word has length 39 [2022-11-02 20:48:51,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:51,417 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 302 transitions. [2022-11-02 20:48:51,417 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-11-02 20:48:51,417 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 302 transitions. [2022-11-02 20:48:51,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:48:51,418 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:51,418 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:48:51,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:51,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-02 20:48:51,642 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-02 20:48:51,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:51,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1573558672, now seen corresponding path program 1 times [2022-11-02 20:48:51,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:51,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955980206] [2022-11-02 20:48:51,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:51,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:52,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:52,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:48:52,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955980206] [2022-11-02 20:48:52,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955980206] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:48:52,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2528545] [2022-11-02 20:48:52,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:52,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:48:52,567 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:48:52,567 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:48:52,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:48:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:48:52,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-02 20:48:52,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:48:52,764 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-11-02 20:48:52,788 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:48:52,788 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-11-02 20:48:52,824 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-11-02 20:48:52,833 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-11-02 20:48:52,885 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-11-02 20:48:52,996 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-11-02 20:48:53,014 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-11-02 20:48:53,052 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:48:53,052 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-11-02 20:48:53,127 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-11-02 20:48:53,137 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-11-02 20:48:53,222 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-11-02 20:48:53,334 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-11-02 20:48:53,347 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-11-02 20:48:53,383 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-11-02 20:48:53,488 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-02 20:48:53,488 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-11-02 20:48:53,531 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-11-02 20:48:53,561 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-11-02 20:48:53,647 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:53,650 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:53,650 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 15 treesize of output 10 [2022-11-02 20:48:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:53,737 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:48:53,782 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 8 treesize of output 6 [2022-11-02 20:48:53,923 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_81| Int) (v_ArrVal_1936 (Array Int Int))) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_1936) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_81|) 1)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_81|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_81| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) is different from false [2022-11-02 20:48:54,063 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1934 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_81| Int) (v_ArrVal_1936 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_50|) 0)) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1934) |v_ULTIMATE.start_main_~item~0#1.base_50| v_ArrVal_1936) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_81|) 1)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_81|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_81| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) is different from false [2022-11-02 20:48:54,132 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1934 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_81| Int) (v_ArrVal_1936 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_50|) 0)) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1934) |v_ULTIMATE.start_main_~item~0#1.base_50| v_ArrVal_1936) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_81|) 1)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_81|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_81| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) is different from false [2022-11-02 20:48:54,154 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1934 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_81| Int) (v_ArrVal_1936 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_50|) 0)) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1934) |v_ULTIMATE.start_main_~item~0#1.base_50| v_ArrVal_1936) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_81|) 1)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_81|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_81| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) is different from false [2022-11-02 20:48:54,195 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_81| Int) (v_ArrVal_1936 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_50| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~item~0#1.base_50|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_81|)) (< 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1930) |c_ULTIMATE.start_main_#t~malloc4#1.base| v_ArrVal_1934) |v_ULTIMATE.start_main_~item~0#1.base_50| v_ArrVal_1936) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_81|) 1)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_81| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) is different from false [2022-11-02 20:48:54,224 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_24| Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_81| Int) (v_ArrVal_1936 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_50| Int)) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_24| 1) |v_ULTIMATE.start_main_~item~0#1.base_50|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_24|) 0)) (< 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_1930) |v_ULTIMATE.start_main_#t~malloc4#1.base_24| v_ArrVal_1934) |v_ULTIMATE.start_main_~item~0#1.base_50| v_ArrVal_1936) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_81|) 1)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_81|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_81| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) is different from false [2022-11-02 20:48:54,303 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_24| Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_81| Int) (v_ArrVal_1936 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_50| Int)) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_24| 1) |v_ULTIMATE.start_main_~item~0#1.base_50|) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_24|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_81|)) (< 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_ArrVal_1930) |v_ULTIMATE.start_main_#t~malloc4#1.base_24| v_ArrVal_1934) |v_ULTIMATE.start_main_~item~0#1.base_50| v_ArrVal_1936) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_81|) 1)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_81| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) is different from false [2022-11-02 20:48:54,337 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1930 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_24| Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_81| Int) (v_ArrVal_1936 (Array Int Int)) (|v_ULTIMATE.start_main_~item~0#1.base_50| Int)) (or (not (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_24| 1) |v_ULTIMATE.start_main_~item~0#1.base_50|) 0)) (< 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_1930) |v_ULTIMATE.start_main_#t~malloc4#1.base_24| v_ArrVal_1934) |v_ULTIMATE.start_main_~item~0#1.base_50| v_ArrVal_1936) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_81|) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_24|) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_81|)) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_81| |c_ULTIMATE.start_main_~bucket~0#1.offset|)))) is different from false [2022-11-02 20:48:54,396 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:54,397 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-11-02 20:48:54,402 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:54,403 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:48:54,413 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:48:54,413 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-11-02 20:48:54,432 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-11-02 20:48:54,432 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 22 treesize of output 22 [2022-11-02 20:48:54,439 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-11-02 20:48:54,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:48:54,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2528545] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:48:54,628 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:48:54,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 47 [2022-11-02 20:48:54,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693837105] [2022-11-02 20:48:54,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:48:54,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-02 20:48:54,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:48:54,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-02 20:48:54,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1365, Unknown=9, NotChecked=664, Total=2256 [2022-11-02 20:48:54,630 INFO L87 Difference]: Start difference. First operand 247 states and 302 transitions. Second operand has 48 states, 47 states have (on average 2.5319148936170213) internal successors, (119), 48 states have internal predecessors, (119), 0 states have call successors, (0), 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-11-02 20:48:59,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:48:59,117 INFO L93 Difference]: Finished difference Result 467 states and 530 transitions. [2022-11-02 20:48:59,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-11-02 20:48:59,120 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.5319148936170213) internal successors, (119), 48 states have internal predecessors, (119), 0 states have call successors, (0), 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-11-02 20:48:59,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:48:59,122 INFO L225 Difference]: With dead ends: 467 [2022-11-02 20:48:59,123 INFO L226 Difference]: Without dead ends: 467 [2022-11-02 20:48:59,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 73 SyntacticMatches, 17 SemanticMatches, 80 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1652 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=853, Invalid=4572, Unknown=9, NotChecked=1208, Total=6642 [2022-11-02 20:48:59,125 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 1878 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 1859 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1878 SdHoareTripleChecker+Valid, 1623 SdHoareTripleChecker+Invalid, 4422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 1859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2282 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:48:59,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1878 Valid, 1623 Invalid, 4422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 1859 Invalid, 0 Unknown, 2282 Unchecked, 1.7s Time] [2022-11-02 20:48:59,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2022-11-02 20:48:59,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 261. [2022-11-02 20:48:59,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 232 states have (on average 1.3879310344827587) internal successors, (322), 260 states have internal predecessors, (322), 0 states have call successors, (0), 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-11-02 20:48:59,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 322 transitions. [2022-11-02 20:48:59,133 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 322 transitions. Word has length 41 [2022-11-02 20:48:59,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:48:59,133 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 322 transitions. [2022-11-02 20:48:59,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.5319148936170213) internal successors, (119), 48 states have internal predecessors, (119), 0 states have call successors, (0), 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-11-02 20:48:59,133 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 322 transitions. [2022-11-02 20:48:59,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-02 20:48:59,134 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:48:59,134 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-11-02 20:48:59,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:48:59,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-02 20:48:59,354 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-02 20:48:59,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:48:59,354 INFO L85 PathProgramCache]: Analyzing trace with hash -27982635, now seen corresponding path program 1 times [2022-11-02 20:48:59,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:48:59,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709642723] [2022-11-02 20:48:59,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:48:59,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:48:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:00,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:00,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:00,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709642723] [2022-11-02 20:49:00,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709642723] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:49:00,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:49:00,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-11-02 20:49:00,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509235222] [2022-11-02 20:49:00,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:49:00,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-02 20:49:00,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:49:00,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-02 20:49:00,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:49:00,494 INFO L87 Difference]: Start difference. First operand 261 states and 322 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-11-02 20:49:01,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:49:01,993 INFO L93 Difference]: Finished difference Result 317 states and 380 transitions. [2022-11-02 20:49:01,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-02 20:49:01,993 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-11-02 20:49:01,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:49:01,995 INFO L225 Difference]: With dead ends: 317 [2022-11-02 20:49:01,995 INFO L226 Difference]: Without dead ends: 317 [2022-11-02 20:49:01,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=281, Invalid=979, Unknown=0, NotChecked=0, Total=1260 [2022-11-02 20:49:01,996 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 406 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:49:01,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 498 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-02 20:49:01,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-11-02 20:49:02,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 265. [2022-11-02 20:49:02,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 236 states have (on average 1.38135593220339) internal successors, (326), 264 states have internal predecessors, (326), 0 states have call successors, (0), 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-11-02 20:49:02,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 326 transitions. [2022-11-02 20:49:02,003 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 326 transitions. Word has length 41 [2022-11-02 20:49:02,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:49:02,003 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 326 transitions. [2022-11-02 20:49:02,004 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-11-02 20:49:02,004 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 326 transitions. [2022-11-02 20:49:02,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-02 20:49:02,004 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:49:02,005 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-11-02 20:49:02,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:49:02,005 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2022-11-02 20:49:02,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:49:02,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1534306045, now seen corresponding path program 1 times [2022-11-02 20:49:02,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:49:02,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117873406] [2022-11-02 20:49:02,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:02,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:49:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:04,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:04,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:49:04,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117873406] [2022-11-02 20:49:04,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117873406] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:49:04,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400154540] [2022-11-02 20:49:04,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:49:04,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:49:04,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:49:04,032 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:49:04,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2893da77-7b34-45ca-a6fa-e6e7c04108b4/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:49:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:49:04,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-02 20:49:04,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:49:04,241 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-11-02 20:49:04,276 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:49:04,277 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-11-02 20:49:04,338 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-11-02 20:49:04,352 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-11-02 20:49:04,544 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:49:04,544 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-11-02 20:49:04,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:49:04,587 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:49:04,588 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-11-02 20:49:04,678 INFO L356 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-11-02 20:49:04,678 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-11-02 20:49:04,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2022-11-02 20:49:04,826 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-02 20:49:04,826 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-11-02 20:49:04,924 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-11-02 20:49:04,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:04,953 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-11-02 20:49:05,206 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:49:05,207 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-11-02 20:49:05,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:05,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:05,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:05,231 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-11-02 20:49:05,274 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:49:05,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, 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-11-02 20:49:05,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:05,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:05,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:05,288 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-11-02 20:49:05,334 INFO L356 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-02 20:49:05,335 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-11-02 20:49:05,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:05,344 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-11-02 20:49:05,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:05,621 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-02 20:49:05,622 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 40 [2022-11-02 20:49:05,672 INFO L356 Elim1Store]: treesize reduction 70, result has 31.4 percent of original size [2022-11-02 20:49:05,672 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-11-02 20:49:06,295 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:49:06,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:06,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:49:06,298 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:49:06,310 INFO L356 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2022-11-02 20:49:06,310 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-11-02 20:49:06,318 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:49:06,324 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:49:06,324 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-11-02 20:49:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:49:06,366 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:49:10,910 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_87| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_87| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (forall ((v_ArrVal_2180 Int)) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2177))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base|))) (select (store .cse0 |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse1 (+ |v_ULTIMATE.start_main_~bcki~0#1.offset_87| 4) v_ArrVal_2180)) (select .cse1 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_87|))) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)))) (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_87| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_87| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)) (forall ((v_ArrVal_2179 Int)) (= (let ((.cse2 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2178))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base|))) (select (select (store .cse2 |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse3 (+ |v_ULTIMATE.start_main_~bcki~0#1.offset_87| 4) v_ArrVal_2179)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base| v_ArrVal_2177) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)) (+ 4 (select .cse3 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|))))) 0))))) is different from false [2022-11-02 20:49:10,983 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_87| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_87| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (forall ((v_ArrVal_2179 Int)) (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2178))) (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_87| 4) v_ArrVal_2179)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2177) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)) (+ (select .cse1 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|) 4)))) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)))) (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_87| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_87| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)) (forall ((v_ArrVal_2180 Int)) (= (select (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2177))) (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_87| 4) v_ArrVal_2180)) (select .cse3 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_2178) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_87|) 4)) 0))))) is different from false [2022-11-02 20:49:11,008 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bcki~0#1.base|) |c_ULTIMATE.start_main_~bcki~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_87| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_87| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (forall ((v_ArrVal_2179 Int)) (= (let ((.cse0 (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2178))) (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_87| 4) v_ArrVal_2179)) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2177) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)) (+ (select .cse1 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|) 4)))) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)))) (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_87| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_87| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (forall ((v_ArrVal_2180 Int)) (= (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_2177))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base|))) (select (store .cse3 |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse4 (+ |v_ULTIMATE.start_main_~bcki~0#1.offset_87| 4) v_ArrVal_2180)) (select .cse4 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)))) (+ (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_2178) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_87|) 4)) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)))))) is different from false [2022-11-02 20:49:12,414 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:49:12,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-11-02 20:49:12,432 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:49:12,432 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-11-02 20:49:12,481 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:49:12,481 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-11-02 20:49:12,497 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:49:12,497 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 67 treesize of output 74 [2022-11-02 20:49:13,289 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (.cse4 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (and (forall ((v_arrayElimArr_26 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_89| Int) (v_ArrVal_2179 Int) (v_arrayElimArr_27 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_87| Int) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_27 |v_ULTIMATE.start_main_~bcki~0#1.offset_89|)) (.cse5 (+ |v_ULTIMATE.start_main_~bcki~0#1.offset_89| 4))) (or (= (let ((.cse0 (store (store |c_#memory_$Pointer$.offset| .cse2 v_arrayElimArr_26) .cse3 v_ArrVal_2178))) (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_87| 4) v_ArrVal_2179)) (select (select (store (store |c_#memory_$Pointer$.base| .cse2 v_arrayElimArr_27) .cse3 v_ArrVal_2177) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)) (+ (select .cse1 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|) 4)))) 0) (< .cse4 |v_ULTIMATE.start_main_~bcki~0#1.offset_89|) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_87| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select |c_#valid| .cse3) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_89|)) (not (= (select v_arrayElimArr_27 .cse5) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)) (not (= (select v_arrayElimArr_26 .cse5) 0))))) (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_89| Int) (v_arrayElimArr_28 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_87| Int) (v_arrayElimArr_29 (Array Int Int)) (v_ArrVal_2178 (Array Int Int)) (v_ArrVal_2177 (Array Int Int)) (v_ArrVal_2180 Int)) (let ((.cse9 (+ |v_ULTIMATE.start_main_~bcki~0#1.offset_89| 4)) (.cse8 (select v_arrayElimArr_28 |v_ULTIMATE.start_main_~bcki~0#1.offset_89|))) (or (= (select (let ((.cse6 (store (store |c_#memory_$Pointer$.base| .cse2 v_arrayElimArr_28) .cse8 v_ArrVal_2177))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_~bucket~0#1.base|))) (select (store .cse6 |c_ULTIMATE.start_main_~bucket~0#1.base| (store .cse7 (+ |v_ULTIMATE.start_main_~bcki~0#1.offset_87| 4) v_ArrVal_2180)) (select .cse7 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)))) (+ 4 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_arrayElimArr_29) .cse8 v_ArrVal_2178) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_87|))) 0) (not (= (select v_arrayElimArr_29 .cse9) 0)) (< .cse4 |v_ULTIMATE.start_main_~bcki~0#1.offset_89|) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_87| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= (select v_arrayElimArr_28 .cse9) 0)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_89|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_87|)) (not (= (select |c_#valid| .cse8) 0))))))) is different from false [2022-11-02 20:49:13,429 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:49:13,430 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-11-02 20:49:13,441 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:49:13,442 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-11-02 20:49:13,447 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:49:13,480 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:49:13,481 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 1926 treesize of output 1770 [2022-11-02 20:49:13,516 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:49:13,534 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:49:13,535 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 2386 treesize of output 2198 [2022-11-02 20:49:13,599 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:49:13,600 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 2194 treesize of output 2104 [2022-11-02 20:49:13,671 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:49:13,671 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 2090 treesize of output 2002 [2022-11-02 20:49:13,808 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:49:13,809 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 2160 treesize of output 2016 [2022-11-02 20:49:14,389 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:49:14,389 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 318 treesize of output 310