./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_remove_all.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b594cdd667b896d6ce097f6fd96950290806f015d929f3b2b06ffea35d861f89 --- 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-03 01:43:46,928 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 01:43:46,931 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 01:43:46,980 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 01:43:46,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 01:43:46,985 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 01:43:46,987 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 01:43:46,991 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 01:43:46,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 01:43:46,998 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 01:43:47,000 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 01:43:47,001 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 01:43:47,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 01:43:47,007 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 01:43:47,008 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 01:43:47,011 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 01:43:47,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 01:43:47,020 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 01:43:47,022 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 01:43:47,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 01:43:47,031 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 01:43:47,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 01:43:47,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 01:43:47,039 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 01:43:47,043 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 01:43:47,048 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 01:43:47,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 01:43:47,049 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 01:43:47,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 01:43:47,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 01:43:47,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 01:43:47,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 01:43:47,055 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 01:43:47,056 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 01:43:47,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 01:43:47,058 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 01:43:47,060 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 01:43:47,061 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 01:43:47,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 01:43:47,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 01:43:47,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 01:43:47,063 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-03 01:43:47,107 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 01:43:47,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 01:43:47,110 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 01:43:47,110 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 01:43:47,111 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 01:43:47,111 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 01:43:47,112 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 01:43:47,112 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 01:43:47,112 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 01:43:47,112 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 01:43:47,113 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 01:43:47,114 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 01:43:47,114 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 01:43:47,114 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 01:43:47,114 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 01:43:47,115 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 01:43:47,115 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 01:43:47,115 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 01:43:47,116 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-03 01:43:47,116 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-03 01:43:47,116 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 01:43:47,116 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 01:43:47,117 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-03 01:43:47,117 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 01:43:47,117 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 01:43:47,117 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 01:43:47,117 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-03 01:43:47,118 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-03 01:43:47,118 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-03 01:43:47,118 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 01:43:47,119 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-03 01:43:47,119 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 01:43:47,119 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 01:43:47,119 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 01:43:47,119 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 01:43:47,120 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:43:47,120 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 01:43:47,120 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 01:43:47,120 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 01:43:47,121 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 01:43:47,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 01:43:47,121 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 01:43:47,121 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_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/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_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> b594cdd667b896d6ce097f6fd96950290806f015d929f3b2b06ffea35d861f89 [2022-11-03 01:43:47,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 01:43:47,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 01:43:47,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 01:43:47,497 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 01:43:47,497 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 01:43:47,499 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/list-simple/dll2n_remove_all.i [2022-11-03 01:43:47,574 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/data/48060ccb9/40578b7503f648bbba126d181fc4156c/FLAGb51af060e [2022-11-03 01:43:48,174 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 01:43:48,175 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/sv-benchmarks/c/list-simple/dll2n_remove_all.i [2022-11-03 01:43:48,187 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/data/48060ccb9/40578b7503f648bbba126d181fc4156c/FLAGb51af060e [2022-11-03 01:43:48,473 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/data/48060ccb9/40578b7503f648bbba126d181fc4156c [2022-11-03 01:43:48,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 01:43:48,477 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 01:43:48,478 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 01:43:48,478 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 01:43:48,482 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 01:43:48,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:43:48" (1/1) ... [2022-11-03 01:43:48,484 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e12029 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:48, skipping insertion in model container [2022-11-03 01:43:48,484 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:43:48" (1/1) ... [2022-11-03 01:43:48,492 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 01:43:48,530 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 01:43:48,870 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_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/sv-benchmarks/c/list-simple/dll2n_remove_all.i[24090,24103] [2022-11-03 01:43:48,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:43:48,894 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 01:43:48,956 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_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/sv-benchmarks/c/list-simple/dll2n_remove_all.i[24090,24103] [2022-11-03 01:43:48,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 01:43:49,007 INFO L208 MainTranslator]: Completed translation [2022-11-03 01:43:49,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:49 WrapperNode [2022-11-03 01:43:49,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 01:43:49,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 01:43:49,009 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 01:43:49,009 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 01:43:49,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:49" (1/1) ... [2022-11-03 01:43:49,034 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:49" (1/1) ... [2022-11-03 01:43:49,060 INFO L138 Inliner]: procedures = 126, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2022-11-03 01:43:49,061 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 01:43:49,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 01:43:49,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 01:43:49,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 01:43:49,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:49" (1/1) ... [2022-11-03 01:43:49,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:49" (1/1) ... [2022-11-03 01:43:49,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:49" (1/1) ... [2022-11-03 01:43:49,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:49" (1/1) ... [2022-11-03 01:43:49,080 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:49" (1/1) ... [2022-11-03 01:43:49,084 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:49" (1/1) ... [2022-11-03 01:43:49,086 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:49" (1/1) ... [2022-11-03 01:43:49,087 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:49" (1/1) ... [2022-11-03 01:43:49,089 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 01:43:49,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 01:43:49,090 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 01:43:49,091 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 01:43:49,091 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:49" (1/1) ... [2022-11-03 01:43:49,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 01:43:49,117 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:43:49,130 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 01:43:49,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 01:43:49,196 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-03 01:43:49,196 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-03 01:43:49,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 01:43:49,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-03 01:43:49,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 01:43:49,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 01:43:49,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 01:43:49,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-03 01:43:49,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 01:43:49,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-03 01:43:49,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 01:43:49,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 01:43:49,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 01:43:49,340 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 01:43:49,343 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 01:43:49,383 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-03 01:43:49,666 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 01:43:49,707 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 01:43:49,708 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-03 01:43:49,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:43:49 BoogieIcfgContainer [2022-11-03 01:43:49,714 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 01:43:49,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 01:43:49,717 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 01:43:49,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 01:43:49,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:43:48" (1/3) ... [2022-11-03 01:43:49,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63391bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:43:49, skipping insertion in model container [2022-11-03 01:43:49,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:43:49" (2/3) ... [2022-11-03 01:43:49,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63391bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:43:49, skipping insertion in model container [2022-11-03 01:43:49,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:43:49" (3/3) ... [2022-11-03 01:43:49,725 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all.i [2022-11-03 01:43:49,744 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 01:43:49,744 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-11-03 01:43:49,811 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 01:43:49,821 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;@3968380b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 01:43:49,821 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-11-03 01:43:49,834 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 25 states have (on average 2.24) internal successors, (56), 50 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:49,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-03 01:43:49,841 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:49,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-03 01:43:49,843 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:43:49,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:49,850 INFO L85 PathProgramCache]: Analyzing trace with hash 4276196, now seen corresponding path program 1 times [2022-11-03 01:43:49,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:49,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47828986] [2022-11-03 01:43:49,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:49,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:50,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:43:50,192 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:50,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47828986] [2022-11-03 01:43:50,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47828986] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:43:50,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:43:50,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:43:50,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606119876] [2022-11-03 01:43:50,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:43:50,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:43:50,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:50,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:43:50,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:43:50,239 INFO L87 Difference]: Start difference. First operand has 52 states, 25 states have (on average 2.24) internal successors, (56), 50 states have internal predecessors, (56), 1 states have call successors, (1), 1 states have call predecessors, (1), 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 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 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-03 01:43:50,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:50,389 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-11-03 01:43:50,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:43:50,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-03 01:43:50,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:50,400 INFO L225 Difference]: With dead ends: 76 [2022-11-03 01:43:50,400 INFO L226 Difference]: Without dead ends: 72 [2022-11-03 01:43:50,402 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-03 01:43:50,406 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 40 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:50,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 67 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:43:50,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-03 01:43:50,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 45. [2022-11-03 01:43:50,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 44 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:50,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2022-11-03 01:43:50,452 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 4 [2022-11-03 01:43:50,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:50,453 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2022-11-03 01:43:50,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 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-03 01:43:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2022-11-03 01:43:50,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-03 01:43:50,455 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:50,456 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-03 01:43:50,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 01:43:50,456 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:43:50,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:50,457 INFO L85 PathProgramCache]: Analyzing trace with hash 4276197, now seen corresponding path program 1 times [2022-11-03 01:43:50,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:50,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013737656] [2022-11-03 01:43:50,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:50,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:50,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:50,603 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-03 01:43:50,603 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:50,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013737656] [2022-11-03 01:43:50,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013737656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:43:50,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:43:50,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:43:50,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539342297] [2022-11-03 01:43:50,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:43:50,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:43:50,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:50,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:43:50,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:43:50,607 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 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-03 01:43:50,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:50,682 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2022-11-03 01:43:50,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:43:50,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-03 01:43:50,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:50,684 INFO L225 Difference]: With dead ends: 74 [2022-11-03 01:43:50,684 INFO L226 Difference]: Without dead ends: 74 [2022-11-03 01:43:50,685 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-03 01:43:50,686 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 42 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:50,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 71 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:43:50,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-03 01:43:50,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 42. [2022-11-03 01:43:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:50,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-11-03 01:43:50,692 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 4 [2022-11-03 01:43:50,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:50,692 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-11-03 01:43:50,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 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-03 01:43:50,693 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-11-03 01:43:50,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-03 01:43:50,693 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:50,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-03 01:43:50,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 01:43:50,694 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:43:50,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:50,695 INFO L85 PathProgramCache]: Analyzing trace with hash 4376208, now seen corresponding path program 1 times [2022-11-03 01:43:50,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:50,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922157348] [2022-11-03 01:43:50,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:50,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:50,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:50,748 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-03 01:43:50,748 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:50,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922157348] [2022-11-03 01:43:50,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922157348] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:43:50,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:43:50,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:43:50,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483363673] [2022-11-03 01:43:50,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:43:50,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:43:50,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:50,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:43:50,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:43:50,751 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 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-03 01:43:50,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:50,772 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-11-03 01:43:50,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:43:50,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-03 01:43:50,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:50,773 INFO L225 Difference]: With dead ends: 52 [2022-11-03 01:43:50,774 INFO L226 Difference]: Without dead ends: 52 [2022-11-03 01:43:50,774 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-03 01:43:50,775 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:50,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 76 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:43:50,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-03 01:43:50,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2022-11-03 01:43:50,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 1.9166666666666667) internal successors, (46), 42 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:50,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2022-11-03 01:43:50,781 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 4 [2022-11-03 01:43:50,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:50,782 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2022-11-03 01:43:50,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 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-03 01:43:50,782 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2022-11-03 01:43:50,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-03 01:43:50,783 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:50,783 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:43:50,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 01:43:50,783 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:43:50,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:50,784 INFO L85 PathProgramCache]: Analyzing trace with hash 2081771880, now seen corresponding path program 1 times [2022-11-03 01:43:50,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:50,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241381691] [2022-11-03 01:43:50,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:50,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:50,910 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-03 01:43:50,912 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:50,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241381691] [2022-11-03 01:43:50,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241381691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:43:50,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:43:50,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 01:43:50,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320641345] [2022-11-03 01:43:50,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:43:50,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 01:43:50,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:50,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 01:43:50,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 01:43:50,917 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:50,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:50,965 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-11-03 01:43:50,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 01:43:50,966 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-03 01:43:50,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:50,968 INFO L225 Difference]: With dead ends: 49 [2022-11-03 01:43:50,968 INFO L226 Difference]: Without dead ends: 49 [2022-11-03 01:43:50,969 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-03 01:43:50,980 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:50,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 71 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:43:50,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-03 01:43:50,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2022-11-03 01:43:50,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 47 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:50,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2022-11-03 01:43:50,986 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 8 [2022-11-03 01:43:50,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:50,986 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2022-11-03 01:43:50,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:50,987 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2022-11-03 01:43:50,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:43:50,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:50,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:43:50,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 01:43:50,988 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:43:50,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:50,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1256794505, now seen corresponding path program 1 times [2022-11-03 01:43:50,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:50,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776093384] [2022-11-03 01:43:50,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:50,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:51,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:43:51,070 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:51,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776093384] [2022-11-03 01:43:51,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776093384] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:43:51,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:43:51,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:43:51,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107450148] [2022-11-03 01:43:51,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:43:51,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:43:51,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:51,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:43:51,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:43:51,073 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:51,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:51,103 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-11-03 01:43:51,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-03 01:43:51,103 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 01:43:51,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:51,104 INFO L225 Difference]: With dead ends: 71 [2022-11-03 01:43:51,104 INFO L226 Difference]: Without dead ends: 71 [2022-11-03 01:43:51,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-03 01:43:51,106 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 83 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:51,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 78 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:43:51,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-03 01:43:51,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 49. [2022-11-03 01:43:51,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 48 states have internal predecessors, (52), 0 states have call successors, (0), 0 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-03 01:43:51,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2022-11-03 01:43:51,115 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 11 [2022-11-03 01:43:51,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:51,115 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2022-11-03 01:43:51,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:51,116 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2022-11-03 01:43:51,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-03 01:43:51,116 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:51,117 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:43:51,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 01:43:51,117 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:43:51,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:51,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1256796369, now seen corresponding path program 1 times [2022-11-03 01:43:51,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:51,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421133650] [2022-11-03 01:43:51,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:51,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:51,228 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-03 01:43:51,228 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:51,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421133650] [2022-11-03 01:43:51,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421133650] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:43:51,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [942908382] [2022-11-03 01:43:51,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:51,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:43:51,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:43:51,233 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:43:51,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-03 01:43:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:51,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-03 01:43:51,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:43:51,399 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-03 01:43:51,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:43:51,425 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-03 01:43:51,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [942908382] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:43:51,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [137951959] [2022-11-03 01:43:51,444 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-03 01:43:51,445 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:43:51,449 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:43:51,455 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:43:51,455 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:43:51,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:51,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:51,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 22 [2022-11-03 01:43:51,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:51,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:51,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:51,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:51,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:51,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-03 01:43:51,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:51,669 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 26 treesize of output 28 [2022-11-03 01:43:51,690 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 15 treesize of output 1 [2022-11-03 01:43:51,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:43:51,752 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 13 treesize of output 9 [2022-11-03 01:43:51,769 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 13 treesize of output 9 [2022-11-03 01:43:51,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:51,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:51,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-03 01:43:51,867 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 23 treesize of output 22 [2022-11-03 01:43:51,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:51,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:51,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-03 01:43:51,907 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 23 treesize of output 22 [2022-11-03 01:43:52,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2022-11-03 01:43:52,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,083 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 34 treesize of output 25 [2022-11-03 01:43:52,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,102 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 34 treesize of output 25 [2022-11-03 01:43:52,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,129 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 01:43:52,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,185 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 32 treesize of output 34 [2022-11-03 01:43:52,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,204 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 32 treesize of output 34 [2022-11-03 01:43:52,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:43:52,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:52,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:52,452 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-03 01:43:52,453 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 389 treesize of output 388 [2022-11-03 01:43:52,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,482 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:52,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:52,502 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-03 01:43:52,503 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 389 treesize of output 388 [2022-11-03 01:43:52,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,535 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:52,536 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:52,545 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:43:52,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 395 treesize of output 376 [2022-11-03 01:43:52,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2022-11-03 01:43:52,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,829 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 34 treesize of output 25 [2022-11-03 01:43:52,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,847 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 34 treesize of output 25 [2022-11-03 01:43:52,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 01:43:52,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,942 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 32 treesize of output 34 [2022-11-03 01:43:52,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,974 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:43:52,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:52,997 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 32 treesize of output 34 [2022-11-03 01:43:53,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:53,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:53,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:53,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:53,121 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:53,130 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:43:53,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 395 treesize of output 376 [2022-11-03 01:43:53,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:53,156 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:53,157 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:53,178 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-03 01:43:53,178 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 389 treesize of output 388 [2022-11-03 01:43:53,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:53,208 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:53,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:43:53,227 INFO L356 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-03 01:43:53,228 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 389 treesize of output 388 [2022-11-03 01:43:53,676 INFO L356 Elim1Store]: treesize reduction 92, result has 21.4 percent of original size [2022-11-03 01:43:53,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 313 treesize of output 320 [2022-11-03 01:43:54,086 INFO L356 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2022-11-03 01:43:54,087 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 3 case distinctions, treesize of input 396 treesize of output 387 [2022-11-03 01:43:54,141 INFO L356 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2022-11-03 01:43:54,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 392 treesize of output 389 [2022-11-03 01:43:54,193 INFO L356 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2022-11-03 01:43:54,194 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 3 case distinctions, treesize of input 396 treesize of output 387 [2022-11-03 01:43:54,291 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:43:57,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [137951959] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:43:57,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:43:57,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3, 3, 3] total 10 [2022-11-03 01:43:57,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899944559] [2022-11-03 01:43:57,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:43:57,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 01:43:57,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:43:57,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 01:43:57,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:43:57,771 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:58,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:43:58,878 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-11-03 01:43:58,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:43:58,879 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-03 01:43:58,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:43:58,880 INFO L225 Difference]: With dead ends: 60 [2022-11-03 01:43:58,880 INFO L226 Difference]: Without dead ends: 60 [2022-11-03 01:43:58,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:43:58,881 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 5 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:43:58,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 70 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 01:43:58,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-11-03 01:43:58,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2022-11-03 01:43:58,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.6216216216216217) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 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-03 01:43:58,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-11-03 01:43:58,886 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 11 [2022-11-03 01:43:58,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:43:58,886 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-11-03 01:43:58,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:43:58,886 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-11-03 01:43:58,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-03 01:43:58,887 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:43:58,887 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-03 01:43:58,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-03 01:43:59,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:43:59,088 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:43:59,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:43:59,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2029972017, now seen corresponding path program 1 times [2022-11-03 01:43:59,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:43:59,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045553094] [2022-11-03 01:43:59,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:59,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:43:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:59,254 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:43:59,255 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:43:59,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045553094] [2022-11-03 01:43:59,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045553094] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:43:59,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297175226] [2022-11-03 01:43:59,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:43:59,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:43:59,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:43:59,257 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:43:59,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-03 01:43:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:43:59,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-03 01:43:59,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:43:59,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:43:59,406 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-03 01:43:59,407 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-03 01:43:59,419 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:43:59,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:43:59,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:43:59,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [297175226] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:43:59,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1000804542] [2022-11-03 01:43:59,519 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-03 01:43:59,519 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:43:59,520 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:43:59,520 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:43:59,520 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:43:59,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 22 [2022-11-03 01:43:59,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-03 01:43:59,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,658 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 26 treesize of output 28 [2022-11-03 01:43:59,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:43:59,685 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 15 treesize of output 1 [2022-11-03 01:43:59,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-03 01:43:59,733 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 13 treesize of output 9 [2022-11-03 01:43:59,745 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 13 treesize of output 9 [2022-11-03 01:43:59,781 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 23 treesize of output 22 [2022-11-03 01:43:59,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-03 01:43:59,836 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 23 treesize of output 22 [2022-11-03 01:43:59,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,884 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-03 01:43:59,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,947 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 30 treesize of output 21 [2022-11-03 01:43:59,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 01:43:59,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:43:59,989 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 30 treesize of output 21 [2022-11-03 01:44:00,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,023 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-03 01:44:00,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:44:00,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,064 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-03 01:44:00,156 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:00,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,158 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:00,187 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 01:44:00,188 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 380 [2022-11-03 01:44:00,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:00,240 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:44:00,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 387 treesize of output 368 [2022-11-03 01:44:00,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:00,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,260 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:00,276 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 01:44:00,276 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 380 [2022-11-03 01:44:00,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,414 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-03 01:44:00,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 01:44:00,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,497 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 30 treesize of output 21 [2022-11-03 01:44:00,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,520 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 30 treesize of output 21 [2022-11-03 01:44:00,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:44:00,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,592 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-03 01:44:00,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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-03 01:44:00,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:00,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:00,728 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 01:44:00,728 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 380 [2022-11-03 01:44:00,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,753 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:00,762 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:44:00,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 387 treesize of output 368 [2022-11-03 01:44:00,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:00,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:00,782 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:00,805 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 01:44:00,806 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 380 [2022-11-03 01:44:01,188 INFO L356 Elim1Store]: treesize reduction 92, result has 21.4 percent of original size [2022-11-03 01:44:01,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 310 treesize of output 317 [2022-11-03 01:44:01,513 INFO L356 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-03 01:44:01,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 392 treesize of output 389 [2022-11-03 01:44:01,539 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:44:01,540 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 1 case distinctions, treesize of input 396 treesize of output 387 [2022-11-03 01:44:01,560 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:44:01,561 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 1 case distinctions, treesize of input 396 treesize of output 387 [2022-11-03 01:44:01,629 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:44:05,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1000804542] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:05,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:44:05,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 3, 4] total 13 [2022-11-03 01:44:05,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304179924] [2022-11-03 01:44:05,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:05,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 01:44:05,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:44:05,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 01:44:05,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-11-03 01:44:05,449 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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-03 01:44:06,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:06,306 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-11-03 01:44:06,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 01:44:06,309 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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 15 [2022-11-03 01:44:06,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:06,309 INFO L225 Difference]: With dead ends: 58 [2022-11-03 01:44:06,309 INFO L226 Difference]: Without dead ends: 58 [2022-11-03 01:44:06,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-11-03 01:44:06,313 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:06,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 60 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 01:44:06,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-03 01:44:06,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2022-11-03 01:44:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.605263157894737) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 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-03 01:44:06,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2022-11-03 01:44:06,325 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 15 [2022-11-03 01:44:06,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:06,325 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2022-11-03 01:44:06,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.25) internal successors, (10), 8 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-03 01:44:06,326 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2022-11-03 01:44:06,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 01:44:06,327 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:06,327 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:06,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:06,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:44:06,551 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:44:06,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:06,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1373263003, now seen corresponding path program 1 times [2022-11-03 01:44:06,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:44:06,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074415450] [2022-11-03 01:44:06,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:06,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:44:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:06,922 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:44:06,923 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:44:06,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074415450] [2022-11-03 01:44:06,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074415450] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:44:06,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028816873] [2022-11-03 01:44:06,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:06,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:44:06,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:44:06,925 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:44:06,946 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-03 01:44:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:07,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-03 01:44:07,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:07,050 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-03 01:44:07,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,073 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-03 01:44:07,101 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:44:07,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-03 01:44:07,121 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 01:44:07,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:44:07,179 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-03 01:44:07,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028816873] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:44:07,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1644581814] [2022-11-03 01:44:07,184 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-03 01:44:07,184 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:44:07,185 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:44:07,185 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:44:07,185 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:44:07,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 22 [2022-11-03 01:44:07,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-03 01:44:07,267 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 15 treesize of output 1 [2022-11-03 01:44:07,278 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 15 treesize of output 1 [2022-11-03 01:44:07,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,294 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 26 treesize of output 28 [2022-11-03 01:44:07,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, 1 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-03 01:44:07,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,328 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-03 01:44:07,340 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 13 treesize of output 9 [2022-11-03 01:44:07,364 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 23 treesize of output 22 [2022-11-03 01:44:07,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-03 01:44:07,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-03 01:44:07,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-03 01:44:07,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,527 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 30 treesize of output 21 [2022-11-03 01:44:07,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,541 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 30 treesize of output 21 [2022-11-03 01:44:07,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 01:44:07,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,597 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-03 01:44:07,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,612 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-03 01:44:07,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:44:07,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,732 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:07,740 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:44:07,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 387 treesize of output 368 [2022-11-03 01:44:07,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:07,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,768 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:07,786 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 01:44:07,787 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 380 [2022-11-03 01:44:07,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:07,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:07,808 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:07,824 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 01:44:07,824 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 380 [2022-11-03 01:44:07,988 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:07,989 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:07,990 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:08,016 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-03 01:44:08,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 390 treesize of output 385 [2022-11-03 01:44:08,038 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:08,040 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:08,041 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:08,060 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-03 01:44:08,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 386 treesize of output 381 [2022-11-03 01:44:08,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:08,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:08,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:08,107 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:08,117 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-03 01:44:08,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 379 treesize of output 360 [2022-11-03 01:44:08,605 INFO L356 Elim1Store]: treesize reduction 184, result has 14.8 percent of original size [2022-11-03 01:44:08,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 596 treesize of output 590 [2022-11-03 01:44:08,879 INFO L356 Elim1Store]: treesize reduction 200, result has 14.5 percent of original size [2022-11-03 01:44:08,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 647 treesize of output 539 [2022-11-03 01:44:08,953 INFO L356 Elim1Store]: treesize reduction 200, result has 13.8 percent of original size [2022-11-03 01:44:08,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 647 treesize of output 617 [2022-11-03 01:44:09,016 INFO L356 Elim1Store]: treesize reduction 130, result has 17.7 percent of original size [2022-11-03 01:44:09,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 643 treesize of output 639 [2022-11-03 01:44:09,177 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:09,246 INFO L356 Elim1Store]: treesize reduction 200, result has 17.0 percent of original size [2022-11-03 01:44:09,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 645 treesize of output 548 [2022-11-03 01:44:09,272 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:09,339 INFO L356 Elim1Store]: treesize reduction 222, result has 16.9 percent of original size [2022-11-03 01:44:09,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 645 treesize of output 626 [2022-11-03 01:44:09,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:09,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:09,406 INFO L356 Elim1Store]: treesize reduction 125, result has 5.3 percent of original size [2022-11-03 01:44:09,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 658 treesize of output 642 [2022-11-03 01:44:09,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:09,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:09,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:09,578 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 01:44:09,578 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 380 [2022-11-03 01:44:09,599 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:09,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:09,601 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:09,618 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 01:44:09,619 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 381 treesize of output 380 [2022-11-03 01:44:09,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:09,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:09,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:09,650 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:44:09,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 387 treesize of output 368 [2022-11-03 01:44:09,810 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:09,811 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:09,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:09,836 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-03 01:44:09,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 390 treesize of output 385 [2022-11-03 01:44:09,856 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:09,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:09,858 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:09,882 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-03 01:44:09,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 386 treesize of output 381 [2022-11-03 01:44:09,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:09,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:09,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:09,911 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:09,919 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:44:09,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 379 treesize of output 360 [2022-11-03 01:44:10,331 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 9 [2022-11-03 01:44:10,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:44:10,356 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-03 01:44:10,363 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 15 treesize of output 1 [2022-11-03 01:44:10,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:44:10,389 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:44:14,339 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1143#(and (<= 1 |ULTIMATE.start_dll_create_~data#1|) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (= |ULTIMATE.start_dll_create_~head~0#1.offset| |ULTIMATE.start_dll_create_#res#1.offset|) (<= |ULTIMATE.start_dll_create_~data#1| 1) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_#res#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_create_#res#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_dll_remove_first_#in~head#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_dll_create_~len#1|) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (= |ULTIMATE.start_dll_remove_first_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (not (= (select |#valid| |ULTIMATE.start_dll_remove_first_~head#1.base|) 1)) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_dll_remove_first_#in~head#1.base|) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| |ULTIMATE.start_dll_remove_first_#in~head#1.offset|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-03 01:44:14,340 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:44:14,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:44:14,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 7 [2022-11-03 01:44:14,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287275686] [2022-11-03 01:44:14,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:44:14,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 01:44:14,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:44:14,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 01:44:14,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2022-11-03 01:44:14,341 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 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-03 01:44:14,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:14,443 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2022-11-03 01:44:14,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:44:14,444 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 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 19 [2022-11-03 01:44:14,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:14,444 INFO L225 Difference]: With dead ends: 73 [2022-11-03 01:44:14,444 INFO L226 Difference]: Without dead ends: 73 [2022-11-03 01:44:14,445 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2022-11-03 01:44:14,446 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 115 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:14,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 69 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 113 Invalid, 0 Unknown, 20 Unchecked, 0.1s Time] [2022-11-03 01:44:14,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-03 01:44:14,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2022-11-03 01:44:14,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 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-03 01:44:14,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-11-03 01:44:14,450 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 19 [2022-11-03 01:44:14,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:14,450 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-11-03 01:44:14,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.875) internal successors, (31), 8 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-03 01:44:14,451 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-11-03 01:44:14,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-03 01:44:14,451 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:14,452 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:14,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:14,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-03 01:44:14,666 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:44:14,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:14,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1373263004, now seen corresponding path program 1 times [2022-11-03 01:44:14,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:44:14,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316646720] [2022-11-03 01:44:14,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:14,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:44:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:15,299 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:44:15,299 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:44:15,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316646720] [2022-11-03 01:44:15,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316646720] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:44:15,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997645649] [2022-11-03 01:44:15,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:15,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:44:15,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:44:15,301 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:44:15,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-03 01:44:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:15,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-03 01:44:15,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:15,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:44:15,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:15,451 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 14 treesize of output 16 [2022-11-03 01:44:15,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:15,506 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 14 treesize of output 16 [2022-11-03 01:44:15,592 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:44:15,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:44:17,832 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| Int)) (or (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| |c_#StackHeapBarrier|)) (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_31| Int) (v_ArrVal_381 Int)) (or (forall ((v_ArrVal_382 Int)) (<= (+ |c_ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store (store |c_#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| v_ArrVal_381) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_31| v_ArrVal_382) |c_ULTIMATE.start_main_~#s~0#1.base|))) (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)))))) (<= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from false [2022-11-03 01:44:17,834 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 01:44:17,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997645649] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:44:17,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1286399801] [2022-11-03 01:44:17,837 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-03 01:44:17,837 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:44:17,837 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:44:17,837 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:44:17,837 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:44:17,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:17,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:17,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 22 [2022-11-03 01:44:17,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:17,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:17,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:17,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:17,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:17,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-03 01:44:17,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:17,927 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 26 treesize of output 28 [2022-11-03 01:44:17,941 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 15 treesize of output 1 [2022-11-03 01:44:17,951 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 15 treesize of output 1 [2022-11-03 01:44:17,973 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 13 treesize of output 9 [2022-11-03 01:44:17,981 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 13 treesize of output 9 [2022-11-03 01:44:17,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:17,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:17,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-03 01:44:18,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-03 01:44:18,032 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 23 treesize of output 22 [2022-11-03 01:44:18,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-03 01:44:18,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,131 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-03 01:44:18,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 01:44:18,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,199 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 30 treesize of output 21 [2022-11-03 01:44:18,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,215 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 30 treesize of output 21 [2022-11-03 01:44:18,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,259 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-03 01:44:18,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,276 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-03 01:44:18,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,301 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:44:18,403 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:18,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,405 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:18,428 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 01:44:18,428 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 384 treesize of output 383 [2022-11-03 01:44:18,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,451 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:18,459 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:44:18,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 390 treesize of output 371 [2022-11-03 01:44:18,475 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:18,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,477 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:18,493 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 01:44:18,494 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 384 treesize of output 383 [2022-11-03 01:44:18,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:18,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:18,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:18,668 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-03 01:44:18,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 393 treesize of output 388 [2022-11-03 01:44:18,690 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:18,691 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:18,692 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:18,713 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-03 01:44:18,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 389 treesize of output 384 [2022-11-03 01:44:18,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:18,741 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:18,750 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-03 01:44:18,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 382 treesize of output 363 [2022-11-03 01:44:19,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:19,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:19,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:19,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:19,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:19,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:19,146 INFO L356 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-03 01:44:19,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 51 [2022-11-03 01:44:19,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:19,212 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 34 treesize of output 25 [2022-11-03 01:44:19,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:19,230 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 34 treesize of output 25 [2022-11-03 01:44:19,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:19,251 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:19,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:19,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 01:44:19,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:19,292 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 32 treesize of output 34 [2022-11-03 01:44:19,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:19,310 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 32 treesize of output 34 [2022-11-03 01:44:19,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:19,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:19,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:19,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:19,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:44:19,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:19,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:19,423 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:19,432 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-03 01:44:19,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 390 treesize of output 371 [2022-11-03 01:44:19,448 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:19,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:19,450 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:19,469 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 01:44:19,469 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 384 treesize of output 383 [2022-11-03 01:44:19,500 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:19,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:19,502 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:19,518 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-03 01:44:19,519 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 384 treesize of output 383 [2022-11-03 01:44:19,679 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:19,680 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:19,681 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:19,702 INFO L356 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-03 01:44:19,703 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 393 treesize of output 388 [2022-11-03 01:44:19,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:19,725 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:19,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 384 [2022-11-03 01:44:19,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:19,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:19,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:19,752 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:19,760 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-03 01:44:19,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 382 treesize of output 363 [2022-11-03 01:44:20,139 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 9 [2022-11-03 01:44:20,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:44:20,172 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-03 01:44:20,180 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 15 treesize of output 1 [2022-11-03 01:44:20,187 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:44:20,202 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:44:24,217 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1405#(and (<= 1 |ULTIMATE.start_dll_create_~data#1|) (not (<= (+ |ULTIMATE.start_dll_remove_first_~head#1.offset| 4) (select |#length| |ULTIMATE.start_dll_remove_first_~head#1.base|))) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (= |ULTIMATE.start_dll_create_~head~0#1.offset| |ULTIMATE.start_dll_create_#res#1.offset|) (<= |ULTIMATE.start_dll_create_~data#1| 1) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_#res#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_create_#res#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_dll_remove_first_#in~head#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_dll_create_~len#1|) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (= |ULTIMATE.start_dll_remove_first_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_dll_remove_first_#in~head#1.base|) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| |ULTIMATE.start_dll_remove_first_#in~head#1.offset|) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-03 01:44:24,217 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:44:24,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:44:24,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 4] total 10 [2022-11-03 01:44:24,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025557870] [2022-11-03 01:44:24,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:44:24,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-03 01:44:24,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:44:24,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-03 01:44:24,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=317, Unknown=1, NotChecked=38, Total=462 [2022-11-03 01:44:24,219 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-03 01:44:24,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:24,369 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2022-11-03 01:44:24,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-03 01:44:24,375 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-11-03 01:44:24,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:24,375 INFO L225 Difference]: With dead ends: 53 [2022-11-03 01:44:24,375 INFO L226 Difference]: Without dead ends: 53 [2022-11-03 01:44:24,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=131, Invalid=378, Unknown=1, NotChecked=42, Total=552 [2022-11-03 01:44:24,379 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 232 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:24,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 18 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 42 Invalid, 0 Unknown, 41 Unchecked, 0.1s Time] [2022-11-03 01:44:24,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-03 01:44:24,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-03 01:44:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.4615384615384615) internal successors, (57), 52 states have internal predecessors, (57), 0 states have call successors, (0), 0 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-03 01:44:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2022-11-03 01:44:24,386 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 19 [2022-11-03 01:44:24,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:24,386 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2022-11-03 01:44:24,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 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-03 01:44:24,387 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2022-11-03 01:44:24,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 01:44:24,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:24,387 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:24,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:24,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:44:24,590 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:44:24,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:24,591 INFO L85 PathProgramCache]: Analyzing trace with hash -378519837, now seen corresponding path program 1 times [2022-11-03 01:44:24,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:44:24,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827422508] [2022-11-03 01:44:24,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:24,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:44:24,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:24,735 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:44:24,735 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:44:24,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827422508] [2022-11-03 01:44:24,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827422508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:24,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:24,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:44:24,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926233001] [2022-11-03 01:44:24,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:24,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:44:24,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:44:24,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:44:24,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:44:24,737 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:44:24,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:24,917 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2022-11-03 01:44:24,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:44:24,918 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-03 01:44:24,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:24,918 INFO L225 Difference]: With dead ends: 73 [2022-11-03 01:44:24,918 INFO L226 Difference]: Without dead ends: 73 [2022-11-03 01:44:24,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:44:24,919 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 78 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:24,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 72 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:44:24,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-03 01:44:24,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2022-11-03 01:44:24,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.45) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 0 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-03 01:44:24,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-11-03 01:44:24,923 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 20 [2022-11-03 01:44:24,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:24,924 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-11-03 01:44:24,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:44:24,924 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-11-03 01:44:24,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-03 01:44:24,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:24,925 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:24,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 01:44:24,925 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:44:24,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:24,926 INFO L85 PathProgramCache]: Analyzing trace with hash -378519836, now seen corresponding path program 1 times [2022-11-03 01:44:24,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:44:24,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144169825] [2022-11-03 01:44:24,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:24,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:44:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:25,203 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:44:25,203 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:44:25,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144169825] [2022-11-03 01:44:25,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144169825] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:25,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:25,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:44:25,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167091553] [2022-11-03 01:44:25,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:25,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:44:25,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:44:25,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:44:25,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:44:25,205 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:44:25,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:25,402 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2022-11-03 01:44:25,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:44:25,403 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-03 01:44:25,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:25,403 INFO L225 Difference]: With dead ends: 66 [2022-11-03 01:44:25,403 INFO L226 Difference]: Without dead ends: 66 [2022-11-03 01:44:25,403 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-03 01:44:25,404 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 120 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:25,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 66 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:44:25,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-03 01:44:25,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 51. [2022-11-03 01:44:25,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 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-03 01:44:25,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-11-03 01:44:25,407 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 20 [2022-11-03 01:44:25,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:25,407 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-11-03 01:44:25,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:44:25,407 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-11-03 01:44:25,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 01:44:25,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:25,408 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:25,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 01:44:25,408 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:44:25,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:25,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1314706967, now seen corresponding path program 1 times [2022-11-03 01:44:25,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:44:25,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331114074] [2022-11-03 01:44:25,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:25,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:44:25,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:25,961 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:44:25,962 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:44:25,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331114074] [2022-11-03 01:44:25,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331114074] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:44:25,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095423908] [2022-11-03 01:44:25,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:25,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:44:25,963 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:44:25,964 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:44:25,986 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-03 01:44:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:26,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-03 01:44:26,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:26,110 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-03 01:44:26,175 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:44:26,176 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-03 01:44:26,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-03 01:44:26,247 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-03 01:44:26,269 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:44:26,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-11-03 01:44:26,406 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 49 treesize of output 37 [2022-11-03 01:44:26,462 INFO L356 Elim1Store]: treesize reduction 3, result has 78.6 percent of original size [2022-11-03 01:44:26,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 27 [2022-11-03 01:44:26,470 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:44:26,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:44:26,561 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 28 treesize of output 20 [2022-11-03 01:44:26,667 INFO L356 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2022-11-03 01:44:26,667 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 28 treesize of output 27 [2022-11-03 01:44:26,676 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_580 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_580))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) is different from false [2022-11-03 01:44:26,695 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_580 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_578 Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_578)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_580))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse0 .cse1) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) is different from false [2022-11-03 01:44:26,708 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:44:26,709 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 2 case distinctions, treesize of input 76 treesize of output 51 [2022-11-03 01:44:26,750 INFO L356 Elim1Store]: treesize reduction 36, result has 48.6 percent of original size [2022-11-03 01:44:26,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 124 [2022-11-03 01:44:26,763 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:44:26,764 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 108 treesize of output 104 [2022-11-03 01:44:26,899 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 01:44:26,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095423908] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:44:26,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1868388052] [2022-11-03 01:44:26,901 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:44:26,902 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:44:26,902 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:44:26,902 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:44:26,902 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:44:26,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:26,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:26,923 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 22 [2022-11-03 01:44:26,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:26,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:26,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:26,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:26,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:26,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-03 01:44:26,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:26,978 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 26 treesize of output 28 [2022-11-03 01:44:26,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:44:26,997 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 15 treesize of output 1 [2022-11-03 01:44:27,019 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 13 treesize of output 9 [2022-11-03 01:44:27,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-03 01:44:27,044 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:44:27,065 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 23 treesize of output 22 [2022-11-03 01:44:27,076 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 23 treesize of output 22 [2022-11-03 01:44:27,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-03 01:44:27,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,166 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-03 01:44:27,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,235 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 30 treesize of output 21 [2022-11-03 01:44:27,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,251 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 30 treesize of output 21 [2022-11-03 01:44:27,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,269 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 01:44:27,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:44:27,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,333 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-03 01:44:27,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,352 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-03 01:44:27,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 01:44:27,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,412 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:44:27,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-03 01:44:27,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,481 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:27,482 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-11-03 01:44:27,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,504 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:27,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 47 [2022-11-03 01:44:27,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:44:27,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,813 INFO L356 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-03 01:44:27,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 51 [2022-11-03 01:44:27,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 01:44:27,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,922 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 34 treesize of output 25 [2022-11-03 01:44:27,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,944 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 34 treesize of output 25 [2022-11-03 01:44:27,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:27,986 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 32 treesize of output 34 [2022-11-03 01:44:28,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:28,004 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 32 treesize of output 34 [2022-11-03 01:44:28,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:28,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:28,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:28,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:28,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:44:28,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:28,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-03 01:44:28,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:28,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-03 01:44:28,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:28,112 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:28,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:28,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:28,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:28,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:44:28,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:28,178 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-03 01:44:28,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:28,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:28,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:28,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:28,199 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:44:28,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:28,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-03 01:44:28,288 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 9 [2022-11-03 01:44:28,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:44:28,309 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 15 treesize of output 1 [2022-11-03 01:44:28,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:44:28,324 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-03 01:44:28,336 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 13 treesize of output 9 [2022-11-03 01:44:28,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:28,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 01:44:28,355 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 13 treesize of output 9 [2022-11-03 01:44:28,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:28,370 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 27 treesize of output 11 [2022-11-03 01:44:28,378 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 23 treesize of output 22 [2022-11-03 01:44:28,389 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 23 treesize of output 22 [2022-11-03 01:44:28,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:28,415 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 27 treesize of output 11 [2022-11-03 01:44:28,424 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:28,433 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 01:44:28,434 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 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-03 01:44:28,445 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:28,457 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:44:28,457 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 1 case distinctions, treesize of input 32 treesize of output 38 [2022-11-03 01:44:28,522 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 9 [2022-11-03 01:44:28,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:44:28,546 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 15 treesize of output 1 [2022-11-03 01:44:28,552 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 15 treesize of output 1 [2022-11-03 01:44:28,561 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-03 01:44:28,572 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 13 treesize of output 9 [2022-11-03 01:44:28,579 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 13 treesize of output 9 [2022-11-03 01:44:28,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:28,589 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 27 treesize of output 11 [2022-11-03 01:44:28,607 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 23 treesize of output 22 [2022-11-03 01:44:28,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:28,616 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 27 treesize of output 11 [2022-11-03 01:44:28,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, 2 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-03 01:44:28,654 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:28,666 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:44:28,666 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 1 case distinctions, treesize of input 32 treesize of output 38 [2022-11-03 01:44:28,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:28,680 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 27 treesize of output 11 [2022-11-03 01:44:28,697 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:28,707 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 01:44:28,707 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 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-03 01:44:28,874 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 9 [2022-11-03 01:44:28,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:44:28,899 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 15 treesize of output 1 [2022-11-03 01:44:28,905 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-03 01:44:28,914 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 15 treesize of output 1 [2022-11-03 01:44:29,000 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-03 01:44:29,010 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-03 01:44:29,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:29,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:29,025 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:29,033 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:44:29,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 230 treesize of output 216 [2022-11-03 01:44:29,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-03 01:44:29,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:29,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:29,132 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:29,139 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:44:29,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 230 treesize of output 216 [2022-11-03 01:44:29,172 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-03 01:44:29,214 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:44:33,571 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1959#(and (<= 1 |ULTIMATE.start_dll_create_~data#1|) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= (+ |ULTIMATE.start_dll_remove_first_~head#1.offset| 4) (select |#length| |ULTIMATE.start_dll_remove_first_~head#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| |ULTIMATE.start_dll_create_#res#1.offset|) (not (= (select |#valid| |ULTIMATE.start_dll_remove_first_~temp~1#1.base|) 1)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|))) (<= |ULTIMATE.start_dll_create_~data#1| 1) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_#res#1.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|) 4)) |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_create_#res#1.offset|) (<= 0 (+ |ULTIMATE.start_dll_create_~len#1| 1)) (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_dll_remove_first_#in~head#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (= |ULTIMATE.start_dll_remove_first_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_dll_remove_first_~temp~1#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|) 4))) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (or (not (= 0 |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|)) (not (= |ULTIMATE.start_dll_remove_first_~temp~1#1.base| 0))) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_dll_remove_first_#in~head#1.base|) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_dll_remove_first_~head#1.base|) 1) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| |ULTIMATE.start_dll_remove_first_#in~head#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|)) 1) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-03 01:44:33,572 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:44:33,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:44:33,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 31 [2022-11-03 01:44:33,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258966221] [2022-11-03 01:44:33,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:44:33,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-03 01:44:33,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:44:33,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-03 01:44:33,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1620, Unknown=2, NotChecked=166, Total=1980 [2022-11-03 01:44:33,574 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 32 states, 31 states have (on average 1.967741935483871) internal successors, (61), 32 states have internal predecessors, (61), 0 states have call successors, (0), 0 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-03 01:44:33,766 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select .cse4 .cse3))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (forall ((v_ArrVal_580 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_578 Int)) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse4 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_578)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_580))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse1 .cse2) .cse3) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (= (select |c_#valid| .cse0) 1)))) is different from false [2022-11-03 01:44:33,771 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_580 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_580))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse1 .cse2) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))))) is different from false [2022-11-03 01:44:33,775 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_ArrVal_580 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_580))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= (select (select .cse1 .cse2) .cse0) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))))) is different from false [2022-11-03 01:44:34,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:34,551 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2022-11-03 01:44:34,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-03 01:44:34,552 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 1.967741935483871) internal successors, (61), 32 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-03 01:44:34,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:34,552 INFO L225 Difference]: With dead ends: 104 [2022-11-03 01:44:34,552 INFO L226 Difference]: Without dead ends: 104 [2022-11-03 01:44:34,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=310, Invalid=2357, Unknown=5, NotChecked=520, Total=3192 [2022-11-03 01:44:34,554 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 90 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 261 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:34,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 436 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 852 Invalid, 0 Unknown, 261 Unchecked, 0.5s Time] [2022-11-03 01:44:34,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-03 01:44:34,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 64. [2022-11-03 01:44:34,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 63 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:44:34,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2022-11-03 01:44:34,558 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 22 [2022-11-03 01:44:34,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:34,558 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2022-11-03 01:44:34,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 1.967741935483871) internal successors, (61), 32 states have internal predecessors, (61), 0 states have call successors, (0), 0 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-03 01:44:34,558 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-11-03 01:44:34,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-03 01:44:34,559 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:34,559 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:34,606 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:34,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:44:34,759 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:44:34,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:34,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1314706968, now seen corresponding path program 1 times [2022-11-03 01:44:34,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:44:34,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941028289] [2022-11-03 01:44:34,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:34,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:44:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:35,732 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:44:35,733 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:44:35,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941028289] [2022-11-03 01:44:35,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941028289] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:44:35,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625548963] [2022-11-03 01:44:35,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:35,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:44:35,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:44:35,734 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:44:35,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-03 01:44:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:35,870 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-03 01:44:35,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:35,894 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-03 01:44:35,987 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:44:35,987 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-03 01:44:36,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-03 01:44:36,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-03 01:44:36,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 23 treesize of output 22 [2022-11-03 01:44:36,097 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 23 treesize of output 22 [2022-11-03 01:44:36,181 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:44:36,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 60 [2022-11-03 01:44:36,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 50 treesize of output 48 [2022-11-03 01:44:36,526 INFO L356 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-03 01:44:36,527 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 143 treesize of output 70 [2022-11-03 01:44:36,553 INFO L356 Elim1Store]: treesize reduction 14, result has 57.6 percent of original size [2022-11-03 01:44:36,553 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 45 [2022-11-03 01:44:36,623 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:44:36,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:44:37,247 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:44:37,248 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 265 treesize of output 329 [2022-11-03 01:44:38,343 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1))) (and (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_687))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_686) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse0 .cse1) (+ .cse2 4)) 8)) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6)) (.cse6 (select (select .cse7 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse5 (+ 4 .cse6)) (.cse4 (select (select .cse3 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= 0 (select (select .cse3 .cse4) .cse5)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse6)) (< (select (select .cse7 .cse4) .cse5) .cse8) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4))))))) (forall ((v_prenex_4 Int) (v_prenex_6 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse12 (select (select .cse14 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse10 (select (select .cse11 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse13 (+ 4 .cse10))) (let ((.cse9 (select (select .cse14 .cse12) .cse13))) (or (= 0 .cse9) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse10)) (< (select (select .cse11 .cse12) .cse13) .cse8) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse9))))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse12)))))) (forall ((v_prenex_4 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse16 (select (select .cse21 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse18 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse17 (select (select .cse18 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse19 (+ .cse16 4))) (let ((.cse15 (select (select .cse21 .cse17) .cse19))) (or (= .cse15 0) (not (= .cse16 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< .cse15 .cse8) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse17)) (= (select (select .cse18 .cse17) .cse19) (select (let ((.cse20 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (select .cse20 (select (select .cse20 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse25 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse24 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse23 (select (select .cse25 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse22 (select (select .cse25 .cse24) (+ .cse23 4)))) (or (= .cse22 0) (not (= .cse23 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< .cse22 .cse8) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse24))))))) (forall ((v_prenex_4 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse27 (select (select .cse28 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse29 (select (select .cse32 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse30 (+ 4 .cse27))) (let ((.cse26 (select (select .cse32 .cse29) .cse30))) (or (= 0 .cse26) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse27)) (< (select (select .cse28 .cse29) .cse30) .cse8) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse29)) (= (select (let ((.cse31 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse31 (select (select .cse31 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse26))))))) (or (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse33 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse33 (select (select .cse33 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse37 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse36 (select (select .cse37 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse35 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse34 (select (select .cse37 .cse36) (+ 4 .cse35)))) (or (= 0 .cse34) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse35)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse34) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse36)))))))) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse38 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse41 (select (select .cse38 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse44 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse39 (select (select .cse44 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse40 (+ .cse41 4))) (let ((.cse42 (select (select .cse44 .cse39) .cse40))) (or (= (select (select .cse38 .cse39) .cse40) 0) (not (= .cse41 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= .cse42 (select (let ((.cse43 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (select .cse43 (select (select .cse43 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse39)) (= .cse42 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (forall ((v_prenex_4 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse49 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse47 (select (select .cse49 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse46 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse45 (select (select .cse49 .cse47) (+ 4 .cse46)))) (or (= 0 .cse45) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse46)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse45) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse47)) (= (select (let ((.cse48 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse48 (select (select .cse48 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse45)))))) (or (and (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int))) (let ((.cse53 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse52 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse51 (select (select .cse52 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse50 (select (select .cse52 .cse53) (+ .cse51 4)))) (or (= .cse50 0) (not (= .cse51 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< .cse50 .cse8)))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse53))))) (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int))) (let ((.cse58 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse54 (select (select .cse58 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse54)) (forall ((v_prenex_2 (Array Int Int))) (let ((.cse55 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse57 (select (select .cse55 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse56 (+ .cse57 4))) (or (= (select (select .cse55 .cse54) .cse56) 0) (not (= .cse57 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (select .cse58 .cse54) .cse56) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))))))) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (let ((.cse59 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (select .cse59 (select (select .cse59 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse65 (select (let ((.cse67 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse67 (select (select .cse67 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse62 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse61 (select (select .cse62 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse66 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse63 (select (select .cse66 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse64 (+ 4 .cse61))) (let ((.cse60 (select (select .cse66 .cse63) .cse64))) (or (= 0 .cse60) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse61)) (< (select (select .cse62 .cse63) .cse64) .cse8) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse63)) (= .cse65 .cse60))))))) (= .cse65 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) is different from false [2022-11-03 01:44:40,834 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse70 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse4 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1)) (.cse8 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse70 0))) (.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse70 0)))) (and (forall ((v_prenex_4 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse2 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse1 (select (select .cse2 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse9 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse0 (select (select .cse9 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ .cse1 4))) (let ((.cse5 (select (select .cse9 .cse0) .cse3))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse1)) (< (select (select .cse2 .cse0) .cse3) .cse4) (= .cse5 0) (= .cse5 (select (let ((.cse6 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse6 (select (select .cse6 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))))) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse15 (select (let ((.cse17 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse17 (select (select .cse17 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse12 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse11 (select (select .cse12 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse16 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse10 (select (select .cse16 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (+ .cse11 4))) (let ((.cse14 (select (select .cse16 .cse10) .cse13))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse10)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse11)) (< (select (select .cse12 .cse10) .cse13) .cse4) (= .cse14 0) (= .cse14 .cse15))))))) (= .cse15 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse21 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse18 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse20 (select (select .cse21 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse19 (select (select .cse21 .cse18) (+ .cse20 4)))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse18)) (= .cse19 0) (not (= .cse20 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< .cse19 .cse4)))))) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse22 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_687))) (let ((.cse24 (select (select .cse22 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse23 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_686) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse22 .cse23) (+ .cse24 4)) 8)) (not (= .cse24 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse23 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (forall ((v_prenex_4 Int) (v_prenex_6 (Array Int Int))) (let ((.cse30 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse25 (select (select .cse30 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse25)) (forall ((v_prenex_5 (Array Int Int))) (let ((.cse28 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse27 (select (select .cse28 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse29 (+ .cse27 4))) (let ((.cse26 (select (select .cse30 .cse25) .cse29))) (or (= .cse26 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse27)) (< (select (select .cse28 .cse25) .cse29) .cse4) (= .cse26 0))))))))))) (forall ((v_prenex_4 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse37 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse33 (select (select .cse37 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse35 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse31 (select (select .cse35 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse36 (+ .cse33 4))) (let ((.cse32 (select (select .cse37 .cse31) .cse36))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse31)) (= .cse32 0) (not (= .cse33 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (let ((.cse34 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (select .cse34 (select (select .cse34 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (select (select .cse35 .cse31) .cse36)) (< .cse32 .cse4))))))) (or (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse38 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (select .cse38 (select (select .cse38 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (and (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int))) (let ((.cse40 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse39 (select (select .cse40 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse39)) (forall ((v_prenex_2 (Array Int Int))) (let ((.cse42 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse43 (select (select .cse42 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse41 (+ .cse43 4))) (or (= (select (select .cse40 .cse39) .cse41) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select .cse42 .cse39) .cse41) 0) (not (= .cse43 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))))))) (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int))) (let ((.cse44 (select (select (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse44)) (forall ((v_prenex_2 (Array Int Int))) (let ((.cse47 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse46 (select (select .cse47 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse45 (select (select .cse47 .cse44) (+ .cse46 4)))) (or (= .cse45 0) (not (= .cse46 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< .cse45 .cse4))))))))))) (forall ((v_prenex_4 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse52 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse48 (select (select .cse52 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse50 (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse49 (select (select .cse52 .cse48) (+ .cse50 4)))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse48)) (= .cse49 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse50)) (= .cse49 0) (= .cse49 (select (let ((.cse51 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse51 (select (select .cse51 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))))) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse55 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse54 (select (select .cse55 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse57 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse53 (select (select .cse57 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse56 (+ .cse54 4))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse53)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse54)) (< (select (select .cse55 .cse53) .cse56) .cse4) (= (select (select .cse57 .cse53) .cse56) 0)))))) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse61 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse63 (select (select .cse61 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse64 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse59 (select (select .cse64 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse62 (+ .cse63 4))) (let ((.cse58 (select (select .cse64 .cse59) .cse62))) (or (= .cse58 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse59)) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse60 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (select .cse60 (select (select .cse60 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse58)) (= (select (select .cse61 .cse59) .cse62) 0) (not (= .cse63 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (or (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse65 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse65 (select (select .cse65 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse69 (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse66 (select (select .cse69 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse68 (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse67 (select (select .cse69 .cse66) (+ .cse68 4)))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse66)) (= .cse67 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse68)) (= .cse67 0)))))))))) is different from false [2022-11-03 01:44:40,972 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:44:40,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 171 treesize of output 131 [2022-11-03 01:44:41,390 INFO L356 Elim1Store]: treesize reduction 232, result has 36.8 percent of original size [2022-11-03 01:44:41,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 21 case distinctions, treesize of input 533 treesize of output 547 [2022-11-03 01:44:41,431 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:44:41,431 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 372 treesize of output 244 [2022-11-03 01:44:41,764 INFO L356 Elim1Store]: treesize reduction 204, result has 43.0 percent of original size [2022-11-03 01:44:41,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 872 treesize of output 897 [2022-11-03 01:44:41,864 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:44:41,864 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 813 treesize of output 767 [2022-11-03 01:44:41,928 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:44:41,928 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 566 treesize of output 552 [2022-11-03 01:44:42,039 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:44:42,039 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 369 treesize of output 365 [2022-11-03 01:44:44,287 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:44:44,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 90 [2022-11-03 01:44:44,299 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:44:44,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 60 [2022-11-03 01:44:44,338 INFO L356 Elim1Store]: treesize reduction 4, result has 90.2 percent of original size [2022-11-03 01:44:44,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 118 [2022-11-03 01:44:44,728 INFO L356 Elim1Store]: treesize reduction 232, result has 46.2 percent of original size [2022-11-03 01:44:44,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 322 treesize of output 440 [2022-11-03 01:44:44,779 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:44:44,780 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 325 treesize of output 317 [2022-11-03 01:44:44,814 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 148 treesize of output 128 [2022-11-03 01:44:47,226 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-03 01:44:47,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 1 [2022-11-03 01:44:47,245 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-03 01:44:47,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 465 treesize of output 1 [2022-11-03 01:44:47,259 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-03 01:44:47,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 1 [2022-11-03 01:44:47,273 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-03 01:44:47,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 310 treesize of output 1 [2022-11-03 01:44:47,286 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-03 01:44:47,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 240 treesize of output 1 [2022-11-03 01:44:47,298 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-03 01:44:47,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 381 treesize of output 1 [2022-11-03 01:44:47,308 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-03 01:44:47,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 242 treesize of output 1 [2022-11-03 01:44:47,319 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-03 01:44:47,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 310 treesize of output 1 [2022-11-03 01:44:47,329 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-11-03 01:44:47,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 171 treesize of output 1 [2022-11-03 01:44:47,536 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 01:44:47,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625548963] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:44:47,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1392318042] [2022-11-03 01:44:47,539 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-03 01:44:47,539 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:44:47,540 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:44:47,540 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:44:47,540 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:44:47,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 22 [2022-11-03 01:44:47,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-03 01:44:47,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,613 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 26 treesize of output 28 [2022-11-03 01:44:47,624 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 15 treesize of output 1 [2022-11-03 01:44:47,632 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 15 treesize of output 1 [2022-11-03 01:44:47,653 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 13 treesize of output 9 [2022-11-03 01:44:47,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-03 01:44:47,677 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 13 treesize of output 9 [2022-11-03 01:44:47,699 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 23 treesize of output 22 [2022-11-03 01:44:47,708 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 23 treesize of output 22 [2022-11-03 01:44:47,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-03 01:44:47,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2022-11-03 01:44:47,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,859 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 34 treesize of output 25 [2022-11-03 01:44:47,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,874 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 34 treesize of output 25 [2022-11-03 01:44:47,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 01:44:47,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,932 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 32 treesize of output 34 [2022-11-03 01:44:47,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,946 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 32 treesize of output 34 [2022-11-03 01:44:47,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:47,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:44:48,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:44:48,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-03 01:44:48,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-03 01:44:48,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-03 01:44:48,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-03 01:44:48,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,145 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:44:48,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,446 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2022-11-03 01:44:48,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 01:44:48,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,517 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 34 treesize of output 25 [2022-11-03 01:44:48,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,532 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 34 treesize of output 25 [2022-11-03 01:44:48,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,567 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 32 treesize of output 34 [2022-11-03 01:44:48,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,589 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 32 treesize of output 34 [2022-11-03 01:44:48,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:44:48,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-03 01:44:48,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-03 01:44:48,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:44:48,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:44:48,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-03 01:44:48,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:48,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-03 01:44:49,080 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 9 [2022-11-03 01:44:49,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:44:49,101 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 15 treesize of output 1 [2022-11-03 01:44:49,107 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-03 01:44:49,116 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:44:49,181 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-03 01:44:49,190 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-03 01:44:49,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:49,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:49,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:49,226 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:44:49,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 230 treesize of output 216 [2022-11-03 01:44:49,296 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-03 01:44:49,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:49,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:49,311 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:44:49,318 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:44:49,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 230 treesize of output 216 [2022-11-03 01:44:49,352 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-03 01:44:49,393 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:44:54,538 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2329#(and (<= 1 |ULTIMATE.start_dll_create_~data#1|) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= (+ |ULTIMATE.start_dll_remove_first_~head#1.offset| 4) (select |#length| |ULTIMATE.start_dll_remove_first_~head#1.base|)) (= |ULTIMATE.start_dll_create_~head~0#1.offset| |ULTIMATE.start_dll_create_#res#1.offset|) (or (not (<= (+ 12 |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|) (select |#length| |ULTIMATE.start_dll_remove_first_~temp~1#1.base|))) (not (<= 0 (+ 8 |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|)))) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|))) (<= |ULTIMATE.start_dll_create_~data#1| 1) (= |ULTIMATE.start_dll_create_#res#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (= |ULTIMATE.start_dll_create_~head~0#1.base| |ULTIMATE.start_dll_create_#res#1.base|) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|) 4)) |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |ULTIMATE.start_dll_create_#res#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_dll_remove_first_#in~head#1.offset|) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_dll_create_~len#1|) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (= |ULTIMATE.start_dll_remove_first_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_dll_remove_first_~temp~1#1.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|) 4))) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (or (not (= 0 |ULTIMATE.start_dll_remove_first_~temp~1#1.offset|)) (not (= |ULTIMATE.start_dll_remove_first_~temp~1#1.base| 0))) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |ULTIMATE.start_dll_remove_first_~head#1.base| |ULTIMATE.start_dll_remove_first_#in~head#1.base|) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (= (select |#valid| |ULTIMATE.start_dll_remove_first_~head#1.base|) 1) (= |ULTIMATE.start_dll_remove_first_~head#1.offset| |ULTIMATE.start_dll_remove_first_#in~head#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_remove_first_~head#1.base|) |ULTIMATE.start_dll_remove_first_~head#1.offset|)) 1) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~len~0#1| (+ |ULTIMATE.start_main_~i~0#1| 1)) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-03 01:44:54,538 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:44:54,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:44:54,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 37 [2022-11-03 01:44:54,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016985974] [2022-11-03 01:44:54,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:44:54,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-03 01:44:54,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:44:54,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-03 01:44:54,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=2134, Unknown=2, NotChecked=190, Total=2550 [2022-11-03 01:44:54,540 INFO L87 Difference]: Start difference. First operand 64 states and 72 transitions. Second operand has 38 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 38 states have internal predecessors, (65), 0 states have call successors, (0), 0 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-03 01:44:54,857 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse76 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse77 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse75 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse78 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse79 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse2 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (.cse3 (<= .cse79 12)) (.cse1 (= .cse79 12)) (.cse0 (= (select .cse75 .cse78) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse22 (select .cse77 .cse78)) (.cse8 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1)) (.cse12 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse77 .cse76 0))) (.cse11 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse75 .cse76 0)))) (and (or .cse0 (not .cse1)) .cse2 .cse3 (or (and .cse2 .cse3) .cse1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (forall ((v_prenex_4 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse6 (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse5 (select (select .cse6 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse4 (select (select .cse13 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (+ .cse5 4))) (let ((.cse9 (select (select .cse13 .cse4) .cse7))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse5)) (< (select (select .cse6 .cse4) .cse7) .cse8) (= .cse9 0) (= .cse9 (select (let ((.cse10 (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse10 (select (select .cse10 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))))) .cse0 (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse19 (select (let ((.cse21 (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse21 (select (select .cse21 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse16 (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse15 (select (select .cse16 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse20 (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse14 (select (select .cse20 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse17 (+ .cse15 4))) (let ((.cse18 (select (select .cse20 .cse14) .cse17))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse14)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse15)) (< (select (select .cse16 .cse14) .cse17) .cse8) (= .cse18 0) (= .cse18 .cse19))))))) (= .cse19 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (= .cse22 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse26 (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse23 (select (select (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse25 (select (select .cse26 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse24 (select (select .cse26 .cse23) (+ .cse25 4)))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse23)) (= .cse24 0) (not (= .cse25 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< .cse24 .cse8)))))) (<= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse27 (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_687))) (let ((.cse29 (select (select .cse27 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse28 (select (select (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_686) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse27 .cse28) (+ .cse29 4)) 8)) (not (= .cse29 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= .cse28 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse22) (forall ((v_prenex_4 Int) (v_prenex_6 (Array Int Int))) (let ((.cse35 (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse30 (select (select .cse35 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse30)) (forall ((v_prenex_5 (Array Int Int))) (let ((.cse33 (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse32 (select (select .cse33 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse34 (+ .cse32 4))) (let ((.cse31 (select (select .cse35 .cse30) .cse34))) (or (= .cse31 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse32)) (< (select (select .cse33 .cse30) .cse34) .cse8) (= .cse31 0))))))))))) (forall ((v_prenex_4 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse42 (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse38 (select (select .cse42 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse40 (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse36 (select (select .cse40 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse41 (+ .cse38 4))) (let ((.cse37 (select (select .cse42 .cse36) .cse41))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse36)) (= .cse37 0) (not (= .cse38 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (let ((.cse39 (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (select .cse39 (select (select .cse39 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (select (select .cse40 .cse36) .cse41)) (< .cse37 .cse8))))))) (or (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse43 (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (select .cse43 (select (select .cse43 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (and (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int))) (let ((.cse45 (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse44 (select (select .cse45 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse44)) (forall ((v_prenex_2 (Array Int Int))) (let ((.cse47 (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse48 (select (select .cse47 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse46 (+ .cse48 4))) (or (= (select (select .cse45 .cse44) .cse46) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select .cse47 .cse44) .cse46) 0) (not (= .cse48 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))))))) (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int))) (let ((.cse49 (select (select (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse49)) (forall ((v_prenex_2 (Array Int Int))) (let ((.cse52 (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse51 (select (select .cse52 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse50 (select (select .cse52 .cse49) (+ .cse51 4)))) (or (= .cse50 0) (not (= .cse51 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< .cse50 .cse8))))))))))) (forall ((v_prenex_4 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse57 (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse53 (select (select .cse57 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse55 (select (select (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse54 (select (select .cse57 .cse53) (+ .cse55 4)))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse53)) (= .cse54 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse55)) (= .cse54 0) (= .cse54 (select (let ((.cse56 (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse56 (select (select .cse56 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))))))) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse60 (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse59 (select (select .cse60 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse62 (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse58 (select (select .cse62 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse61 (+ .cse59 4))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse58)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse59)) (< (select (select .cse60 .cse58) .cse61) .cse8) (= (select (select .cse62 .cse58) .cse61) 0)))))) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse66 (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse68 (select (select .cse66 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse69 (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse64 (select (select .cse69 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse67 (+ .cse68 4))) (let ((.cse63 (select (select .cse69 .cse64) .cse67))) (or (= .cse63 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse64)) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= (select (let ((.cse65 (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (select .cse65 (select (select .cse65 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse63)) (= (select (select .cse66 .cse64) .cse67) 0) (not (= .cse68 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (or (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse70 (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse70 (select (select .cse70 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse74 (store .cse11 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse71 (select (select .cse74 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse73 (select (select (store .cse12 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse72 (select (select .cse74 .cse71) (+ .cse73 4)))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse71)) (= .cse72 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse73)) (= .cse72 0)))))))))) is different from false [2022-11-03 01:44:54,911 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse67 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse76 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse6 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse2 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (.cse1 (= .cse6 12)) (.cse0 (= (select .cse7 .cse76) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse9 (select .cse67 .cse76)) (.cse8 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse15 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1))) (and (or .cse0 (not .cse1)) .cse2 (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_687))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_686) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse3 .cse4) (+ .cse5 4)) 8)) (not (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (or (and .cse2 (<= .cse6 12)) .cse1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) .cse0 (= (select .cse7 .cse8) 0) (= .cse9 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= (select |c_#length| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 12) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6)) (.cse13 (select (select .cse14 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (+ 4 .cse13)) (.cse11 (select (select .cse10 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= 0 (select (select .cse10 .cse11) .cse12)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse13)) (< (select (select .cse14 .cse11) .cse12) .cse15) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse11))))))) (forall ((v_prenex_4 Int) (v_prenex_6 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse19 (select (select .cse21 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse17 (select (select .cse18 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse20 (+ 4 .cse17))) (let ((.cse16 (select (select .cse21 .cse19) .cse20))) (or (= 0 .cse16) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse17)) (< (select (select .cse18 .cse19) .cse20) .cse15) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse16))))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse19)))))) (forall ((v_prenex_4 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse23 (select (select .cse28 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse25 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse24 (select (select .cse25 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse26 (+ .cse23 4))) (let ((.cse22 (select (select .cse28 .cse24) .cse26))) (or (= .cse22 0) (not (= .cse23 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< .cse22 .cse15) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse24)) (= (select (select .cse25 .cse24) .cse26) (select (let ((.cse27 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (select .cse27 (select (select .cse27 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse9) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse31 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse30 (select (select .cse32 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse29 (select (select .cse32 .cse31) (+ .cse30 4)))) (or (= .cse29 0) (not (= .cse30 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< .cse29 .cse15) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse31))))))) (forall ((v_prenex_4 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse34 (select (select .cse35 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse36 (select (select .cse39 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse37 (+ 4 .cse34))) (let ((.cse33 (select (select .cse39 .cse36) .cse37))) (or (= 0 .cse33) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse34)) (< (select (select .cse35 .cse36) .cse37) .cse15) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse36)) (= (select (let ((.cse38 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse38 (select (select .cse38 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse33))))))) (or (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse40 (select (select .cse40 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse44 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse43 (select (select .cse44 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse42 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse41 (select (select .cse44 .cse43) (+ 4 .cse42)))) (or (= 0 .cse41) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse42)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse41) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse43)))))))) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse45 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse48 (select (select .cse45 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse51 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse46 (select (select .cse51 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse47 (+ .cse48 4))) (let ((.cse49 (select (select .cse51 .cse46) .cse47))) (or (= (select (select .cse45 .cse46) .cse47) 0) (not (= .cse48 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= .cse49 (select (let ((.cse50 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (select .cse50 (select (select .cse50 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse46)) (= .cse49 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (forall ((v_prenex_4 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse56 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse54 (select (select .cse56 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse53 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse52 (select (select .cse56 .cse54) (+ 4 .cse53)))) (or (= 0 .cse52) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse53)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse52) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse54)) (= (select (let ((.cse55 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse55 (select (select .cse55 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse52)))))) (or (and (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int))) (let ((.cse60 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse59 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse58 (select (select .cse59 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse57 (select (select .cse59 .cse60) (+ .cse58 4)))) (or (= .cse57 0) (not (= .cse58 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< .cse57 .cse15)))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse60))))) (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int))) (let ((.cse65 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse61 (select (select .cse65 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse61)) (forall ((v_prenex_2 (Array Int Int))) (let ((.cse62 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse64 (select (select .cse62 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse63 (+ .cse64 4))) (or (= (select (select .cse62 .cse61) .cse63) 0) (not (= .cse64 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (select .cse65 .cse61) .cse63) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))))))) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (let ((.cse66 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (select .cse66 (select (select .cse66 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (= (select .cse67 .cse8) 0) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse73 (select (let ((.cse75 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse75 (select (select .cse75 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse70 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse69 (select (select .cse70 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse74 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse71 (select (select .cse74 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse72 (+ 4 .cse69))) (let ((.cse68 (select (select .cse74 .cse71) .cse72))) (or (= 0 .cse68) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse69)) (< (select (select .cse70 .cse71) .cse72) .cse15) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse71)) (= .cse73 .cse68))))))) (= .cse73 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) is different from false [2022-11-03 01:44:54,985 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse67 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse76 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse6 (select |c_#length| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse2 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0)) (.cse1 (= .cse6 12)) (.cse0 (= (select .cse7 .cse76) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (.cse9 (select .cse67 .cse76)) (.cse8 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse15 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 1))) (and (or .cse0 (not .cse1)) .cse2 (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_687 (Array Int Int)) (v_ArrVal_686 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_687))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_686) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse3 .cse4) (+ .cse5 4)) 8)) (not (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (or (and .cse2 (<= .cse6 12)) .cse1) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse0 (= (select .cse7 .cse8) 0) (= .cse9 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse10 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6)) (.cse13 (select (select .cse14 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse12 (+ 4 .cse13)) (.cse11 (select (select .cse10 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= 0 (select (select .cse10 .cse11) .cse12)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse13)) (< (select (select .cse14 .cse11) .cse12) .cse15) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse11))))))) (forall ((v_prenex_4 Int) (v_prenex_6 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse19 (select (select .cse21 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_5 (Array Int Int))) (let ((.cse18 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse17 (select (select .cse18 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse20 (+ 4 .cse17))) (let ((.cse16 (select (select .cse21 .cse19) .cse20))) (or (= 0 .cse16) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse17)) (< (select (select .cse18 .cse19) .cse20) .cse15) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse16))))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse19)))))) (forall ((v_prenex_4 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse23 (select (select .cse28 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse25 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse24 (select (select .cse25 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse26 (+ .cse23 4))) (let ((.cse22 (select (select .cse28 .cse24) .cse26))) (or (= .cse22 0) (not (= .cse23 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< .cse22 .cse15) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse24)) (= (select (select .cse25 .cse24) .cse26) (select (let ((.cse27 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (select .cse27 (select (select .cse27 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))))))) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| .cse9) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse31 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse30 (select (select .cse32 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse29 (select (select .cse32 .cse31) (+ .cse30 4)))) (or (= .cse29 0) (not (= .cse30 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< .cse29 .cse15) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse31))))))) (forall ((v_prenex_4 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse34 (select (select .cse35 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse39 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse36 (select (select .cse39 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse37 (+ 4 .cse34))) (let ((.cse33 (select (select .cse39 .cse36) .cse37))) (or (= 0 .cse33) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse34)) (< (select (select .cse35 .cse36) .cse37) .cse15) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse36)) (= (select (let ((.cse38 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse38 (select (select .cse38 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse33))))))) (or (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (let ((.cse40 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse40 (select (select .cse40 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse44 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse43 (select (select .cse44 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse42 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse41 (select (select .cse44 .cse43) (+ 4 .cse42)))) (or (= 0 .cse41) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse42)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse41) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse43)))))))) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse45 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse48 (select (select .cse45 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse51 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse46 (select (select .cse51 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse47 (+ .cse48 4))) (let ((.cse49 (select (select .cse51 .cse46) .cse47))) (or (= (select (select .cse45 .cse46) .cse47) 0) (not (= .cse48 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= .cse49 (select (let ((.cse50 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (select .cse50 (select (select .cse50 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse46)) (= .cse49 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (forall ((v_prenex_4 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse56 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse54 (select (select .cse56 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse53 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse52 (select (select .cse56 .cse54) (+ 4 .cse53)))) (or (= 0 .cse52) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse53)) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse52) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse54)) (= (select (let ((.cse55 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse55 (select (select .cse55 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse52)))))) (or (and (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int))) (let ((.cse60 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (forall ((v_prenex_2 (Array Int Int))) (let ((.cse59 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse58 (select (select .cse59 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse57 (select (select .cse59 .cse60) (+ .cse58 4)))) (or (= .cse57 0) (not (= .cse58 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (< .cse57 .cse15)))))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse60))))) (forall ((v_prenex_1 Int) (v_prenex_3 (Array Int Int))) (let ((.cse65 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (let ((.cse61 (select (select .cse65 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse61)) (forall ((v_prenex_2 (Array Int Int))) (let ((.cse62 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse64 (select (select .cse62 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse63 (+ .cse64 4))) (or (= (select (select .cse62 .cse61) .cse63) 0) (not (= .cse64 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (select .cse65 .cse61) .cse63) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))))))) (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= |c_ULTIMATE.start_dll_create_~head~0#1.base| (select (let ((.cse66 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (select .cse66 (select (select .cse66 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) (= (select .cse67 .cse8) 0) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (let ((.cse73 (select (let ((.cse75 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_3))) (select .cse75 (select (select .cse75 v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_1) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (forall ((v_prenex_4 Int) (v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse70 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse69 (select (select .cse70 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse74 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_6))) (let ((.cse71 (select (select .cse74 v_prenex_4) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse72 (+ 4 .cse69))) (let ((.cse68 (select (select .cse74 .cse71) .cse72))) (or (= 0 .cse68) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse69)) (< (select (select .cse70 .cse71) .cse72) .cse15) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse71)) (= .cse73 .cse68))))))) (= .cse73 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) is different from false [2022-11-03 01:44:56,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:56,781 INFO L93 Difference]: Finished difference Result 176 states and 185 transitions. [2022-11-03 01:44:56,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-03 01:44:56,782 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 38 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-03 01:44:56,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:56,784 INFO L225 Difference]: With dead ends: 176 [2022-11-03 01:44:56,784 INFO L226 Difference]: Without dead ends: 176 [2022-11-03 01:44:56,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 876 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=429, Invalid=3876, Unknown=5, NotChecked=660, Total=4970 [2022-11-03 01:44:56,786 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 300 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 906 SdHoareTripleChecker+Invalid, 1247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 455 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:56,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 906 Invalid, 1247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 780 Invalid, 0 Unknown, 455 Unchecked, 0.7s Time] [2022-11-03 01:44:56,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-11-03 01:44:56,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 64. [2022-11-03 01:44:56,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 63 states have internal predecessors, (71), 0 states have call successors, (0), 0 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-03 01:44:56,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2022-11-03 01:44:56,790 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 22 [2022-11-03 01:44:56,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:56,790 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2022-11-03 01:44:56,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 38 states have internal predecessors, (65), 0 states have call successors, (0), 0 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-03 01:44:56,791 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2022-11-03 01:44:56,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-03 01:44:56,792 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:56,792 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:56,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:56,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:44:56,992 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:44:56,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:56,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2101215349, now seen corresponding path program 1 times [2022-11-03 01:44:56,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:44:56,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689805150] [2022-11-03 01:44:56,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:56,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:44:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:44:57,135 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:44:57,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689805150] [2022-11-03 01:44:57,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689805150] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:57,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:57,136 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:44:57,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786205060] [2022-11-03 01:44:57,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:57,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:44:57,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:44:57,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:44:57,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:44:57,138 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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-03 01:44:57,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:57,267 INFO L93 Difference]: Finished difference Result 76 states and 84 transitions. [2022-11-03 01:44:57,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:44:57,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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-03 01:44:57,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:57,268 INFO L225 Difference]: With dead ends: 76 [2022-11-03 01:44:57,268 INFO L226 Difference]: Without dead ends: 76 [2022-11-03 01:44:57,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:44:57,269 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 124 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:57,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 73 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:44:57,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-03 01:44:57,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 68. [2022-11-03 01:44:57,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 67 states have internal predecessors, (78), 0 states have call successors, (0), 0 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-03 01:44:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-11-03 01:44:57,271 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 23 [2022-11-03 01:44:57,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:57,272 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-11-03 01:44:57,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 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-03 01:44:57,272 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-11-03 01:44:57,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-03 01:44:57,272 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:57,272 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:57,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 01:44:57,273 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:44:57,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:57,273 INFO L85 PathProgramCache]: Analyzing trace with hash 713166488, now seen corresponding path program 1 times [2022-11-03 01:44:57,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:44:57,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472019230] [2022-11-03 01:44:57,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:57,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:44:57,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:57,422 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:44:57,422 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:44:57,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472019230] [2022-11-03 01:44:57,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472019230] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:57,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:57,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 01:44:57,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917638554] [2022-11-03 01:44:57,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:57,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:44:57,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:44:57,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:44:57,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-03 01:44:57,424 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-03 01:44:57,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:57,584 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-11-03 01:44:57,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:44:57,585 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-11-03 01:44:57,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:57,585 INFO L225 Difference]: With dead ends: 77 [2022-11-03 01:44:57,585 INFO L226 Difference]: Without dead ends: 77 [2022-11-03 01:44:57,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:44:57,586 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 110 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:57,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 56 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:44:57,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-03 01:44:57,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2022-11-03 01:44:57,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 59 states have (on average 1.3728813559322033) internal successors, (81), 70 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:44:57,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-11-03 01:44:57,588 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 24 [2022-11-03 01:44:57,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:57,589 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-11-03 01:44:57,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-03 01:44:57,589 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-11-03 01:44:57,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:44:57,589 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:57,589 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:57,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-03 01:44:57,590 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:44:57,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:57,594 INFO L85 PathProgramCache]: Analyzing trace with hash 628524500, now seen corresponding path program 1 times [2022-11-03 01:44:57,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:44:57,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141773460] [2022-11-03 01:44:57,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:57,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:44:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:58,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:44:58,075 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:44:58,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141773460] [2022-11-03 01:44:58,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141773460] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:58,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:58,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 01:44:58,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060548095] [2022-11-03 01:44:58,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:58,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 01:44:58,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:44:58,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 01:44:58,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-03 01:44:58,077 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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-03 01:44:58,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:58,331 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2022-11-03 01:44:58,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 01:44:58,332 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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-03 01:44:58,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:58,332 INFO L225 Difference]: With dead ends: 78 [2022-11-03 01:44:58,332 INFO L226 Difference]: Without dead ends: 78 [2022-11-03 01:44:58,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-11-03 01:44:58,333 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 110 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:58,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 79 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:44:58,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-03 01:44:58,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2022-11-03 01:44:58,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 68 states have internal predecessors, (79), 0 states have call successors, (0), 0 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-03 01:44:58,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2022-11-03 01:44:58,335 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 25 [2022-11-03 01:44:58,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:58,336 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-11-03 01:44:58,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 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-03 01:44:58,336 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-11-03 01:44:58,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-03 01:44:58,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:58,342 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:58,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-03 01:44:58,343 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:44:58,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:58,343 INFO L85 PathProgramCache]: Analyzing trace with hash 633324759, now seen corresponding path program 1 times [2022-11-03 01:44:58,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:44:58,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253605736] [2022-11-03 01:44:58,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:58,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:44:58,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:58,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 01:44:58,423 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:44:58,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253605736] [2022-11-03 01:44:58,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253605736] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:58,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:58,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-03 01:44:58,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891186476] [2022-11-03 01:44:58,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:58,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:44:58,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:44:58,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:44:58,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-03 01:44:58,426 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:44:58,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:58,506 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2022-11-03 01:44:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:44:58,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-03 01:44:58,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:58,507 INFO L225 Difference]: With dead ends: 78 [2022-11-03 01:44:58,507 INFO L226 Difference]: Without dead ends: 78 [2022-11-03 01:44:58,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:44:58,508 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:58,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 62 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:44:58,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-03 01:44:58,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-11-03 01:44:58,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 64 states have (on average 1.375) internal successors, (88), 75 states have internal predecessors, (88), 0 states have call successors, (0), 0 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-03 01:44:58,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2022-11-03 01:44:58,513 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 25 [2022-11-03 01:44:58,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:58,514 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2022-11-03 01:44:58,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:44:58,515 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2022-11-03 01:44:58,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 01:44:58,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:58,519 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:58,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-03 01:44:58,520 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:44:58,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:58,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1990576869, now seen corresponding path program 1 times [2022-11-03 01:44:58,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:44:58,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520093451] [2022-11-03 01:44:58,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:58,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:44:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:58,836 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-03 01:44:58,836 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:44:58,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520093451] [2022-11-03 01:44:58,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520093451] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:58,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:44:58,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-03 01:44:58,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626807489] [2022-11-03 01:44:58,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:58,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-03 01:44:58,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:44:58,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-03 01:44:58,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-03 01:44:58,838 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-03 01:44:59,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:59,128 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2022-11-03 01:44:59,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-03 01:44:59,129 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 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-03 01:44:59,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:59,129 INFO L225 Difference]: With dead ends: 81 [2022-11-03 01:44:59,129 INFO L226 Difference]: Without dead ends: 81 [2022-11-03 01:44:59,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-11-03 01:44:59,130 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 64 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:59,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 89 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-03 01:44:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-11-03 01:44:59,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2022-11-03 01:44:59,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.3934426229508197) internal successors, (85), 72 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:44:59,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2022-11-03 01:44:59,138 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 26 [2022-11-03 01:44:59,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:59,138 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2022-11-03 01:44:59,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 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-03 01:44:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-11-03 01:44:59,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-03 01:44:59,143 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:59,143 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:59,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-03 01:44:59,143 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:44:59,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:59,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1841768837, now seen corresponding path program 1 times [2022-11-03 01:44:59,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:44:59,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104956233] [2022-11-03 01:44:59,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:59,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:44:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:44:59,347 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:44:59,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104956233] [2022-11-03 01:44:59,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104956233] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:44:59,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940304373] [2022-11-03 01:44:59,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:59,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:44:59,348 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:44:59,349 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:44:59,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-03 01:44:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:44:59,518 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-03 01:44:59,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:44:59,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:44:59,621 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-03 01:44:59,624 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 01:44:59,624 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:44:59,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940304373] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:44:59,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:44:59,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-03 01:44:59,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259765242] [2022-11-03 01:44:59,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:44:59,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-03 01:44:59,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:44:59,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-03 01:44:59,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-03 01:44:59,627 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:44:59,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:44:59,724 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-11-03 01:44:59,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-03 01:44:59,725 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-11-03 01:44:59,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:44:59,725 INFO L225 Difference]: With dead ends: 72 [2022-11-03 01:44:59,725 INFO L226 Difference]: Without dead ends: 72 [2022-11-03 01:44:59,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-03 01:44:59,726 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 51 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:44:59,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 42 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 01:44:59,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-03 01:44:59,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-11-03 01:44:59,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 71 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-03 01:44:59,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2022-11-03 01:44:59,728 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 26 [2022-11-03 01:44:59,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:44:59,728 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2022-11-03 01:44:59,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:44:59,729 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2022-11-03 01:44:59,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-03 01:44:59,729 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:44:59,729 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:44:59,767 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-03 01:44:59,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:44:59,930 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:44:59,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:44:59,930 INFO L85 PathProgramCache]: Analyzing trace with hash -413296800, now seen corresponding path program 1 times [2022-11-03 01:44:59,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:44:59,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727765282] [2022-11-03 01:44:59,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:44:59,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:44:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:00,003 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-03 01:45:00,003 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:45:00,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727765282] [2022-11-03 01:45:00,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727765282] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:00,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 01:45:00,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 01:45:00,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537520039] [2022-11-03 01:45:00,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:00,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 01:45:00,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:45:00,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 01:45:00,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 01:45:00,005 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:45:00,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:00,052 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2022-11-03 01:45:00,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:45:00,053 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-03 01:45:00,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:00,054 INFO L225 Difference]: With dead ends: 70 [2022-11-03 01:45:00,054 INFO L226 Difference]: Without dead ends: 70 [2022-11-03 01:45:00,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-03 01:45:00,055 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 42 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:00,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 20 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:45:00,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-03 01:45:00,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-03 01:45:00,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 69 states have internal predecessors, (82), 0 states have call successors, (0), 0 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-03 01:45:00,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2022-11-03 01:45:00,063 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 28 [2022-11-03 01:45:00,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:00,064 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2022-11-03 01:45:00,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:45:00,064 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2022-11-03 01:45:00,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 01:45:00,065 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:00,066 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:45:00,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-03 01:45:00,066 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:45:00,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:00,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1818274966, now seen corresponding path program 2 times [2022-11-03 01:45:00,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:45:00,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145742706] [2022-11-03 01:45:00,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:00,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:45:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-03 01:45:00,148 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:45:00,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145742706] [2022-11-03 01:45:00,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145742706] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:45:00,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080456565] [2022-11-03 01:45:00,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-03 01:45:00,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:45:00,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:45:00,150 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:45:00,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-03 01:45:00,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-03 01:45:00,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:45:00,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-03 01:45:00,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:00,357 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-03 01:45:00,364 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-03 01:45:00,386 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 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-03 01:45:00,392 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-03 01:45:00,534 INFO L356 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-11-03 01:45:00,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2022-11-03 01:45:00,546 INFO L356 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-11-03 01:45:00,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2022-11-03 01:45:00,567 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-03 01:45:00,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:45:00,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080456565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:00,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:45:00,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4] total 12 [2022-11-03 01:45:00,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833723566] [2022-11-03 01:45:00,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:00,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-03 01:45:00,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:45:00,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-03 01:45:00,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-03 01:45:00,569 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:45:00,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:00,883 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2022-11-03 01:45:00,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 01:45:00,884 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-03 01:45:00,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:00,884 INFO L225 Difference]: With dead ends: 92 [2022-11-03 01:45:00,884 INFO L226 Difference]: Without dead ends: 92 [2022-11-03 01:45:00,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-11-03 01:45:00,885 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 60 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:00,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 149 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 150 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-11-03 01:45:00,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-03 01:45:00,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 76. [2022-11-03 01:45:00,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 67 states have (on average 1.328358208955224) internal successors, (89), 75 states have internal predecessors, (89), 0 states have call successors, (0), 0 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-03 01:45:00,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2022-11-03 01:45:00,887 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 29 [2022-11-03 01:45:00,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:00,887 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2022-11-03 01:45:00,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:45:00,888 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2022-11-03 01:45:00,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-03 01:45:00,888 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:00,888 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:45:00,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:01,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-03 01:45:01,102 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:45:01,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:01,102 INFO L85 PathProgramCache]: Analyzing trace with hash 72643334, now seen corresponding path program 1 times [2022-11-03 01:45:01,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:45:01,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939544739] [2022-11-03 01:45:01,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:01,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:45:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:02,555 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:45:02,555 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:45:02,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939544739] [2022-11-03 01:45:02,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939544739] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:45:02,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303261004] [2022-11-03 01:45:02,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:02,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:45:02,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:45:02,557 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:45:02,558 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-03 01:45:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:02,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-03 01:45:02,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:02,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:45:02,843 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:45:02,843 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-03 01:45:02,897 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 13 treesize of output 9 [2022-11-03 01:45:02,942 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-03 01:45:02,999 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:45:02,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-03 01:45:03,266 INFO L356 Elim1Store]: treesize reduction 4, result has 88.6 percent of original size [2022-11-03 01:45:03,266 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 48 [2022-11-03 01:45:03,399 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-03 01:45:03,431 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:45:03,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-03 01:45:03,556 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 27 treesize of output 19 [2022-11-03 01:45:03,729 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1353 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1353))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse0 .cse1) 4) 0)) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) is different from false [2022-11-03 01:45:03,755 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1351 Int) (v_ArrVal_1353 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1351)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1353))) (let ((.cse1 (select (select .cse0 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse0 .cse1) 4) 0)) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) is different from false [2022-11-03 01:45:03,768 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:45:03,777 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 2 case distinctions, treesize of input 75 treesize of output 50 [2022-11-03 01:45:03,819 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:45:03,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 154 [2022-11-03 01:45:03,834 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:45:03,834 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 111 treesize of output 103 [2022-11-03 01:45:04,786 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-03 01:45:04,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303261004] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-03 01:45:04,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [811467739] [2022-11-03 01:45:04,789 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-03 01:45:04,789 INFO L166 IcfgInterpreter]: Building call graph [2022-11-03 01:45:04,790 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-03 01:45:04,790 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-03 01:45:04,790 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-03 01:45:04,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:04,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:04,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 22 [2022-11-03 01:45:04,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:04,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:04,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:04,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:04,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:04,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-03 01:45:04,871 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 15 treesize of output 1 [2022-11-03 01:45:04,878 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 15 treesize of output 1 [2022-11-03 01:45:04,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:04,890 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 26 treesize of output 28 [2022-11-03 01:45:04,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:04,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:04,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-03 01:45:04,925 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 13 treesize of output 9 [2022-11-03 01:45:04,934 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 13 treesize of output 9 [2022-11-03 01:45:04,955 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 23 treesize of output 22 [2022-11-03 01:45:04,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:04,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:04,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2022-11-03 01:45:04,980 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 23 treesize of output 22 [2022-11-03 01:45:05,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 43 [2022-11-03 01:45:05,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 01:45:05,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,128 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 34 treesize of output 25 [2022-11-03 01:45:05,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,152 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 34 treesize of output 25 [2022-11-03 01:45:05,184 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:45:05,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,212 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 32 treesize of output 34 [2022-11-03 01:45:05,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,227 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 32 treesize of output 34 [2022-11-03 01:45:05,263 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:45:05,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-03 01:45:05,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,318 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-03 01:45:05,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-03 01:45:05,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-03 01:45:05,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,423 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:45:05,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,679 INFO L356 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-03 01:45:05,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 51 [2022-11-03 01:45:05,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2022-11-03 01:45:05,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,772 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 34 treesize of output 25 [2022-11-03 01:45:05,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,786 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 34 treesize of output 25 [2022-11-03 01:45:05,819 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,819 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 32 treesize of output 34 [2022-11-03 01:45:05,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:45:05,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,862 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 32 treesize of output 34 [2022-11-03 01:45:05,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:45:05,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,920 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-03 01:45:05,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2022-11-03 01:45:05,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:05,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-03 01:45:06,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:06,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 49 [2022-11-03 01:45:06,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:06,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:06,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:06,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:06,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:06,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 41 [2022-11-03 01:45:06,102 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 9 [2022-11-03 01:45:06,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:45:06,133 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 15 treesize of output 1 [2022-11-03 01:45:06,139 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-03 01:45:06,147 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 15 treesize of output 1 [2022-11-03 01:45:06,157 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 13 treesize of output 9 [2022-11-03 01:45:06,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:06,170 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 27 treesize of output 11 [2022-11-03 01:45:06,178 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 13 treesize of output 9 [2022-11-03 01:45:06,192 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 23 treesize of output 22 [2022-11-03 01:45:06,200 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 23 treesize of output 22 [2022-11-03 01:45:06,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:06,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-03 01:45:06,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:45:06,240 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 01:45:06,241 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 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-03 01:45:06,252 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:45:06,264 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:45:06,264 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 1 case distinctions, treesize of input 32 treesize of output 38 [2022-11-03 01:45:06,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:06,277 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 27 treesize of output 11 [2022-11-03 01:45:06,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:45:06,356 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 9 [2022-11-03 01:45:06,371 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 15 treesize of output 1 [2022-11-03 01:45:06,377 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-03 01:45:06,385 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 15 treesize of output 1 [2022-11-03 01:45:06,398 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 13 treesize of output 9 [2022-11-03 01:45:06,406 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 13 treesize of output 9 [2022-11-03 01:45:06,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:06,419 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 27 treesize of output 11 [2022-11-03 01:45:06,433 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 23 treesize of output 22 [2022-11-03 01:45:06,441 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 23 treesize of output 22 [2022-11-03 01:45:06,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:06,453 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 27 treesize of output 11 [2022-11-03 01:45:06,474 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:45:06,484 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-03 01:45:06,484 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 1 case distinctions, treesize of input 32 treesize of output 34 [2022-11-03 01:45:06,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:06,500 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 27 treesize of output 11 [2022-11-03 01:45:06,513 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:45:06,525 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:45:06,525 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 1 case distinctions, treesize of input 32 treesize of output 38 [2022-11-03 01:45:06,692 INFO L356 Elim1Store]: treesize reduction 27, result has 32.5 percent of original size [2022-11-03 01:45:06,693 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 25 treesize of output 29 [2022-11-03 01:45:06,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-03 01:45:06,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:06,742 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:45:06,743 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 62 [2022-11-03 01:45:06,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:06,757 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 45 [2022-11-03 01:45:07,024 INFO L356 Elim1Store]: treesize reduction 36, result has 58.6 percent of original size [2022-11-03 01:45:07,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 77 [2022-11-03 01:45:07,117 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 15 treesize of output 1 [2022-11-03 01:45:07,195 INFO L356 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2022-11-03 01:45:07,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 108 treesize of output 117 [2022-11-03 01:45:07,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:07,243 INFO L356 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2022-11-03 01:45:07,243 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 79 [2022-11-03 01:45:07,772 INFO L356 Elim1Store]: treesize reduction 36, result has 58.6 percent of original size [2022-11-03 01:45:07,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 77 [2022-11-03 01:45:07,836 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 15 treesize of output 1 [2022-11-03 01:45:07,904 INFO L356 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2022-11-03 01:45:07,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 108 treesize of output 117 [2022-11-03 01:45:07,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:07,951 INFO L356 Elim1Store]: treesize reduction 57, result has 13.6 percent of original size [2022-11-03 01:45:07,951 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 79 [2022-11-03 01:45:08,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-03 01:45:08,311 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 9 [2022-11-03 01:45:08,330 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 15 treesize of output 1 [2022-11-03 01:45:08,336 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-03 01:45:08,344 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 15 treesize of output 1 [2022-11-03 01:45:08,406 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-03 01:45:08,415 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-03 01:45:08,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:08,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:08,444 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:45:08,451 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:45:08,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 230 treesize of output 216 [2022-11-03 01:45:08,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:08,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-03 01:45:08,537 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-03 01:45:08,544 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-03 01:45:08,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 230 treesize of output 216 [2022-11-03 01:45:08,577 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-03 01:45:08,592 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-03 01:45:08,636 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-03 01:45:13,908 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4331#(and (<= 1 |ULTIMATE.start_dll_create_~data#1|) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= |ULTIMATE.start_dll_remove_first_~head#1.offset| 0) (not (= (select |#valid| |ULTIMATE.start_dll_remove_first_#t~mem6#1.base|) 1)) (<= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= 0 |ULTIMATE.start_dll_remove_first_~head#1.base|) (<= 0 |ULTIMATE.start_dll_remove_first_#in~head#1.offset|) (<= 0 |ULTIMATE.start_dll_remove_first_#in~head#1.base|) (<= |ULTIMATE.start_dll_remove_first_#in~head#1.offset| 0) (<= |ULTIMATE.start_dll_create_~data#1| 1) (<= 0 (+ |ULTIMATE.start_dll_create_~len#1| 1)) (= |ULTIMATE.start_main_~data~0#1| 1) (<= 0 |ULTIMATE.start_dll_remove_first_~head#1.offset|) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (<= |ULTIMATE.start_dll_create_~len#1| 0) (<= 1 |ULTIMATE.start_dll_create_#in~data#1|) (= |ULTIMATE.start_main_~len~0#1| 2) (<= |ULTIMATE.start_main_~#s~0#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_create_#in~data#1| 1) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_~head~0#1.offset|) (<= |ULTIMATE.start_main_~i~0#1| 1) (<= 0 |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_dll_create_#res#1.offset|) (<= 0 |ULTIMATE.start_main_~#s~0#1.offset|) (= |#NULL.base| 0))' at error location [2022-11-03 01:45:13,908 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-03 01:45:13,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-03 01:45:13,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 15, 15] total 48 [2022-11-03 01:45:13,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364186867] [2022-11-03 01:45:13,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-03 01:45:13,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-03 01:45:13,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:45:13,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-03 01:45:13,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=3635, Unknown=2, NotChecked=246, Total=4160 [2022-11-03 01:45:13,912 INFO L87 Difference]: Start difference. First operand 76 states and 89 transitions. Second operand has 48 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 48 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-03 01:45:14,241 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= (select |c_#valid| 0) 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select .cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (forall ((v_ArrVal_1351 Int) (v_ArrVal_1353 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1351)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1353))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse1 .cse2) 4) 0)) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))))) is different from false [2022-11-03 01:45:14,246 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse0 (select |c_#valid| 0)) (.cse3 (not .cse4)) (.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse1 (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|))) (.cse2 (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))) (and (= .cse0 0) (or (and (= .cse0 1) .cse1 .cse2) .cse3) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) .cse3 (or .cse4 (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= (select .cse5 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0)))) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse5 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_ArrVal_1353 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1353))) (let ((.cse7 (select (select .cse6 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse6 .cse7) 4) 0)) (not (= .cse7 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) .cse1 .cse2))) is different from false [2022-11-03 01:45:14,250 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse0 (not .cse1)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (or (and (= (select |c_#valid| 0) 1) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0))) .cse0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse0 (or .cse1 (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= (select .cse2 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0)))) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse2 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_ArrVal_1353 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1353))) (let ((.cse4 (select (select .cse3 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse3 .cse4) 4) 0)) (not (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))))))))) is different from false [2022-11-03 01:45:15,435 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (= (select .cse0 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (forall ((v_ArrVal_1351 Int) (v_ArrVal_1353 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store .cse0 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1351)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1353))) (let ((.cse2 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse1 .cse2) 4) 0)) (not (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))))) is different from false [2022-11-03 01:45:15,479 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse1 (not .cse2)) (.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (.cse0 (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| 0)))) (and (or (and (= (select |c_#valid| 0) 1) (not (= 0 |c_ULTIMATE.start_main_~#s~0#1.base|)) .cse0) .cse1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) .cse1 (or .cse2 (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (not (= (select .cse3 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) 0)))) (not (= 0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= (select .cse3 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_ArrVal_1353 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1353))) (let ((.cse5 (select (select .cse4 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= (select (select .cse4 .cse5) 4) 0)) (not (= .cse5 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))))) .cse0))) is different from false [2022-11-03 01:45:15,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:15,687 INFO L93 Difference]: Finished difference Result 84 states and 94 transitions. [2022-11-03 01:45:15,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-03 01:45:15,688 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 48 states have internal predecessors, (80), 0 states have call successors, (0), 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-03 01:45:15,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:15,688 INFO L225 Difference]: With dead ends: 84 [2022-11-03 01:45:15,688 INFO L226 Difference]: Without dead ends: 82 [2022-11-03 01:45:15,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 1805 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=498, Invalid=5685, Unknown=7, NotChecked=1120, Total=7310 [2022-11-03 01:45:15,690 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 148 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 257 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:15,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 400 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 925 Invalid, 0 Unknown, 257 Unchecked, 0.7s Time] [2022-11-03 01:45:15,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-03 01:45:15,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 76. [2022-11-03 01:45:15,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 75 states have internal predecessors, (88), 0 states have call successors, (0), 0 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-03 01:45:15,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 88 transitions. [2022-11-03 01:45:15,693 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 88 transitions. Word has length 29 [2022-11-03 01:45:15,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:15,693 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 88 transitions. [2022-11-03 01:45:15,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 48 states have internal predecessors, (80), 0 states have call successors, (0), 0 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-03 01:45:15,694 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 88 transitions. [2022-11-03 01:45:15,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 01:45:15,694 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:15,694 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:45:15,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:15,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-03 01:45:15,914 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:45:15,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:15,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1282018005, now seen corresponding path program 3 times [2022-11-03 01:45:15,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:45:15,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018149126] [2022-11-03 01:45:15,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:15,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:45:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:16,027 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 17 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:45:16,028 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:45:16,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018149126] [2022-11-03 01:45:16,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018149126] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:45:16,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258758400] [2022-11-03 01:45:16,028 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-03 01:45:16,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:45:16,029 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:45:16,030 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:45:16,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-03 01:45:16,241 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-03 01:45:16,242 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-03 01:45:16,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-03 01:45:16,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:16,279 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:45:16,279 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-03 01:45:16,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258758400] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 01:45:16,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-03 01:45:16,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-11-03 01:45:16,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021031722] [2022-11-03 01:45:16,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 01:45:16,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-03 01:45:16,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 01:45:16,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-03 01:45:16,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:45:16,283 INFO L87 Difference]: Start difference. First operand 76 states and 88 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:45:16,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 01:45:16,302 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2022-11-03 01:45:16,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 01:45:16,302 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-03 01:45:16,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 01:45:16,303 INFO L225 Difference]: With dead ends: 54 [2022-11-03 01:45:16,303 INFO L226 Difference]: Without dead ends: 52 [2022-11-03 01:45:16,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-03 01:45:16,308 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 53 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-03 01:45:16,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 45 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-03 01:45:16,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-03 01:45:16,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-11-03 01:45:16,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 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-03 01:45:16,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-11-03 01:45:16,314 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 30 [2022-11-03 01:45:16,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 01:45:16,315 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-11-03 01:45:16,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 01:45:16,315 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-11-03 01:45:16,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-03 01:45:16,316 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 01:45:16,316 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 01:45:16,355 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-03 01:45:16,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:45:16,536 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2022-11-03 01:45:16,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 01:45:16,536 INFO L85 PathProgramCache]: Analyzing trace with hash 955588938, now seen corresponding path program 1 times [2022-11-03 01:45:16,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 01:45:16,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207840598] [2022-11-03 01:45:16,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:16,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 01:45:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:17,499 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 01:45:17,499 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 01:45:17,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207840598] [2022-11-03 01:45:17,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207840598] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-03 01:45:17,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342441351] [2022-11-03 01:45:17,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 01:45:17,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-03 01:45:17,500 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 01:45:17,500 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-03 01:45:17,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad25f32c-81c1-4d5d-bcfc-dec8ea18139d/bin/utaipan-7li7fVZpFI/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-03 01:45:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 01:45:17,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 72 conjunts are in the unsatisfiable core [2022-11-03 01:45:17,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-03 01:45:17,690 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-03 01:45:17,761 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-03 01:45:17,761 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-03 01:45:17,803 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 13 treesize of output 9 [2022-11-03 01:45:17,844 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 23 treesize of output 22 [2022-11-03 01:45:17,920 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-03 01:45:17,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, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-03 01:45:18,149 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 47 treesize of output 35 [2022-11-03 01:45:18,347 INFO L356 Elim1Store]: treesize reduction 64, result has 22.0 percent of original size [2022-11-03 01:45:18,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 59 treesize of output 63 [2022-11-03 01:45:18,364 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 33 [2022-11-03 01:45:18,743 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-03 01:45:18,744 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 16 treesize of output 26 [2022-11-03 01:45:18,994 INFO L356 Elim1Store]: treesize reduction 152, result has 42.6 percent of original size [2022-11-03 01:45:18,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 124 treesize of output 171 [2022-11-03 01:45:26,001 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-03 01:45:26,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 190 treesize of output 530