./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a 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_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur --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 4d5c55d9a4a2ded389ff7ce077afdc88fb2d2855921e5fd1e3b93fbba7e140e8 --- 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-38b53e6 [2022-11-26 00:18:58,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:18:58,006 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:18:58,026 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:18:58,027 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:18:58,028 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:18:58,029 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:18:58,031 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:18:58,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:18:58,034 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:18:58,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:18:58,037 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:18:58,037 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:18:58,038 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:18:58,039 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:18:58,041 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:18:58,047 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:18:58,048 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:18:58,050 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:18:58,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:18:58,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:18:58,062 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:18:58,065 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:18:58,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:18:58,072 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:18:58,078 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:18:58,079 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:18:58,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:18:58,081 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:18:58,082 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:18:58,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:18:58,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:18:58,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:18:58,088 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:18:58,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:18:58,090 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:18:58,091 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:18:58,092 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:18:58,092 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:18:58,093 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:18:58,095 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:18:58,096 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-26 00:18:58,147 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:18:58,148 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:18:58,148 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:18:58,149 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:18:58,150 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:18:58,150 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:18:58,150 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:18:58,151 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:18:58,151 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:18:58,151 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:18:58,152 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:18:58,152 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:18:58,153 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:18:58,153 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:18:58,153 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:18:58,154 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:18:58,154 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:18:58,154 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:18:58,155 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-26 00:18:58,156 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-26 00:18:58,156 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:18:58,156 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:18:58,156 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 00:18:58,157 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:18:58,157 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:18:58,158 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:18:58,158 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-26 00:18:58,158 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-26 00:18:58,158 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-26 00:18:58,159 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:18:58,159 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-26 00:18:58,159 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:18:58,160 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:18:58,160 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:18:58,160 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:18:58,160 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:18:58,161 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:18:58,161 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:18:58,161 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:18:58,161 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:18:58,162 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:18:58,162 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:18:58,162 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_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/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_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur 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 -> 4d5c55d9a4a2ded389ff7ce077afdc88fb2d2855921e5fd1e3b93fbba7e140e8 [2022-11-26 00:18:58,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:18:58,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:18:58,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:18:58,485 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:18:58,486 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:18:58,487 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i [2022-11-26 00:19:01,650 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:19:01,919 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:19:01,920 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i [2022-11-26 00:19:01,937 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/data/ad91facaf/51bdf6068e074e08a2acabbdb8078fd0/FLAGfcf29e35d [2022-11-26 00:19:01,956 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/data/ad91facaf/51bdf6068e074e08a2acabbdb8078fd0 [2022-11-26 00:19:01,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:19:01,961 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:19:01,962 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:19:01,962 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:19:01,966 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:19:01,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:19:01" (1/1) ... [2022-11-26 00:19:01,968 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43162bd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:19:01, skipping insertion in model container [2022-11-26 00:19:01,968 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:19:01" (1/1) ... [2022-11-26 00:19:01,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:19:02,011 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:19:02,330 WARN L237 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_ed5623db-ee99-439f-8114-07aea8b8e852/sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i[24275,24288] [2022-11-26 00:19:02,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:19:02,343 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:19:02,390 WARN L237 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_ed5623db-ee99-439f-8114-07aea8b8e852/sv-benchmarks/c/list-simple/dll2n_remove_all_reverse.i[24275,24288] [2022-11-26 00:19:02,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:19:02,417 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:19:02,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:19:02 WrapperNode [2022-11-26 00:19:02,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:19:02,418 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:19:02,419 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:19:02,419 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:19:02,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:19:02" (1/1) ... [2022-11-26 00:19:02,441 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:19:02" (1/1) ... [2022-11-26 00:19:02,462 INFO L138 Inliner]: procedures = 126, calls = 35, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 101 [2022-11-26 00:19:02,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:19:02,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:19:02,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:19:02,463 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:19:02,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:19:02" (1/1) ... [2022-11-26 00:19:02,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:19:02" (1/1) ... [2022-11-26 00:19:02,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:19:02" (1/1) ... [2022-11-26 00:19:02,477 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:19:02" (1/1) ... [2022-11-26 00:19:02,484 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:19:02" (1/1) ... [2022-11-26 00:19:02,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:19:02" (1/1) ... [2022-11-26 00:19:02,489 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:19:02" (1/1) ... [2022-11-26 00:19:02,490 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:19:02" (1/1) ... [2022-11-26 00:19:02,493 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:19:02,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:19:02,494 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:19:02,494 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:19:02,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:19:02" (1/1) ... [2022-11-26 00:19:02,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:19:02,513 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:19:02,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:19:02,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:19:02,570 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-26 00:19:02,570 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-26 00:19:02,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 00:19:02,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-26 00:19:02,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:19:02,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 00:19:02,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-26 00:19:02,571 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-26 00:19:02,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:19:02,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-26 00:19:02,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:19:02,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:19:02,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:19:02,682 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:19:02,685 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:19:02,758 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-26 00:19:03,185 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:19:03,272 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:19:03,277 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-26 00:19:03,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:19:03 BoogieIcfgContainer [2022-11-26 00:19:03,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:19:03,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:19:03,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:19:03,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:19:03,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:19:01" (1/3) ... [2022-11-26 00:19:03,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15aa46a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:19:03, skipping insertion in model container [2022-11-26 00:19:03,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:19:02" (2/3) ... [2022-11-26 00:19:03,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15aa46a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:19:03, skipping insertion in model container [2022-11-26 00:19:03,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:19:03" (3/3) ... [2022-11-26 00:19:03,291 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all_reverse.i [2022-11-26 00:19:03,313 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:19:03,314 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-11-26 00:19:03,378 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:19:03,386 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;@5244cd59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:19:03,387 INFO L358 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2022-11-26 00:19:03,391 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 33 states have (on average 2.272727272727273) internal successors, (75), 67 states have internal predecessors, (75), 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-26 00:19:03,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-26 00:19:03,401 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:03,402 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-26 00:19:03,402 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-26 00:19:03,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:03,411 INFO L85 PathProgramCache]: Analyzing trace with hash 5050762, now seen corresponding path program 1 times [2022-11-26 00:19:03,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:03,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723072990] [2022-11-26 00:19:03,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:03,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:03,656 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-26 00:19:03,657 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:03,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723072990] [2022-11-26 00:19:03,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723072990] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:03,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:19:03,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:19:03,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197025761] [2022-11-26 00:19:03,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:03,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:19:03,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:03,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:19:03,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:19:03,699 INFO L87 Difference]: Start difference. First operand has 69 states, 33 states have (on average 2.272727272727273) internal successors, (75), 67 states have internal predecessors, (75), 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-26 00:19:03,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:03,921 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2022-11-26 00:19:03,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:19:03,924 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-26 00:19:03,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:03,932 INFO L225 Difference]: With dead ends: 109 [2022-11-26 00:19:03,932 INFO L226 Difference]: Without dead ends: 105 [2022-11-26 00:19:03,934 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-26 00:19:03,938 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 56 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:03,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 102 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:19:03,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-26 00:19:03,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 62. [2022-11-26 00:19:03,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 31 states have (on average 2.129032258064516) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:19:03,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-11-26 00:19:03,980 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 4 [2022-11-26 00:19:03,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:03,981 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-11-26 00:19:03,982 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-26 00:19:03,982 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-11-26 00:19:03,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-26 00:19:03,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:03,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-26 00:19:03,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:19:03,984 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-26 00:19:03,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:03,986 INFO L85 PathProgramCache]: Analyzing trace with hash 5050763, now seen corresponding path program 1 times [2022-11-26 00:19:03,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:03,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325124268] [2022-11-26 00:19:03,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:03,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:04,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:04,190 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-26 00:19:04,191 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:04,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325124268] [2022-11-26 00:19:04,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325124268] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:04,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:19:04,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:19:04,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177657751] [2022-11-26 00:19:04,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:04,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:19:04,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:04,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:19:04,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:19:04,195 INFO L87 Difference]: Start difference. First operand 62 states and 66 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-26 00:19:04,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:04,339 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2022-11-26 00:19:04,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:19:04,341 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-26 00:19:04,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:04,343 INFO L225 Difference]: With dead ends: 108 [2022-11-26 00:19:04,345 INFO L226 Difference]: Without dead ends: 108 [2022-11-26 00:19:04,346 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-26 00:19:04,348 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 60 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:04,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 110 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:19:04,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-11-26 00:19:04,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 59. [2022-11-26 00:19:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 31 states have (on average 2.032258064516129) internal successors, (63), 58 states have internal predecessors, (63), 0 states have call successors, (0), 0 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-26 00:19:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-11-26 00:19:04,357 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 4 [2022-11-26 00:19:04,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:04,358 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-11-26 00:19:04,358 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-26 00:19:04,358 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-11-26 00:19:04,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-26 00:19:04,359 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:04,359 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-26 00:19:04,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:19:04,360 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-26 00:19:04,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:04,361 INFO L85 PathProgramCache]: Analyzing trace with hash 5174857, now seen corresponding path program 1 times [2022-11-26 00:19:04,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:04,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410295578] [2022-11-26 00:19:04,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:04,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:04,418 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-26 00:19:04,418 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:04,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410295578] [2022-11-26 00:19:04,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410295578] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:04,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:19:04,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:19:04,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009844503] [2022-11-26 00:19:04,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:04,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:19:04,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:04,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:19:04,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:19:04,424 INFO L87 Difference]: Start difference. First operand 59 states and 63 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-26 00:19:04,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:04,455 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2022-11-26 00:19:04,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:19:04,456 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-26 00:19:04,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:04,457 INFO L225 Difference]: With dead ends: 69 [2022-11-26 00:19:04,458 INFO L226 Difference]: Without dead ends: 69 [2022-11-26 00:19:04,459 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-26 00:19:04,461 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 10 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:04,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 110 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:19:04,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-26 00:19:04,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2022-11-26 00:19:04,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 32 states have (on average 2.0) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 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-26 00:19:04,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2022-11-26 00:19:04,478 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 4 [2022-11-26 00:19:04,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:04,479 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2022-11-26 00:19:04,479 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-26 00:19:04,479 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-11-26 00:19:04,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 00:19:04,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:04,482 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:19:04,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:19:04,482 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-26 00:19:04,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:04,487 INFO L85 PathProgramCache]: Analyzing trace with hash 150200334, now seen corresponding path program 1 times [2022-11-26 00:19:04,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:04,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843358261] [2022-11-26 00:19:04,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:04,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:04,591 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-26 00:19:04,592 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:04,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843358261] [2022-11-26 00:19:04,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843358261] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:04,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:19:04,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:19:04,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801843387] [2022-11-26 00:19:04,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:04,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:19:04,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:04,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:19:04,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:19:04,595 INFO L87 Difference]: Start difference. First operand 60 states and 64 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-26 00:19:04,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:04,627 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-11-26 00:19:04,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:19:04,627 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-26 00:19:04,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:04,628 INFO L225 Difference]: With dead ends: 66 [2022-11-26 00:19:04,628 INFO L226 Difference]: Without dead ends: 66 [2022-11-26 00:19:04,629 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-26 00:19:04,630 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:04,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:19:04,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-26 00:19:04,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2022-11-26 00:19:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 37 states have (on average 1.864864864864865) internal successors, (69), 64 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:19:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-11-26 00:19:04,637 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 8 [2022-11-26 00:19:04,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:04,637 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-11-26 00:19:04,637 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-26 00:19:04,638 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-11-26 00:19:04,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 00:19:04,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:04,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:19:04,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 00:19:04,639 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-26 00:19:04,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:04,640 INFO L85 PathProgramCache]: Analyzing trace with hash -732865500, now seen corresponding path program 1 times [2022-11-26 00:19:04,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:04,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258146792] [2022-11-26 00:19:04,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:04,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:04,812 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-26 00:19:04,812 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:04,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258146792] [2022-11-26 00:19:04,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258146792] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:19:04,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391139727] [2022-11-26 00:19:04,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:04,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:19:04,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:19:04,815 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:19:04,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:19:04,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:04,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-26 00:19:04,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:19:05,023 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-26 00:19:05,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:19:05,070 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-26 00:19:05,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391139727] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:19:05,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2050433576] [2022-11-26 00:19:05,095 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-11-26 00:19:05,095 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:19:05,101 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:19:05,112 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:19:05,112 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:19:05,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,232 INFO L350 Elim1Store]: Elim1 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-26 00:19:05,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,295 INFO L350 Elim1Store]: Elim1 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-26 00:19:05,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:19:05,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,380 INFO L350 Elim1Store]: Elim1 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-26 00:19:05,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:19:05,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:19:05,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,469 INFO L350 Elim1Store]: Elim1 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-26 00:19:05,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:19:05,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-26 00:19:05,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,554 INFO L350 Elim1Store]: Elim1 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-26 00:19:05,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-26 00:19:05,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,653 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,660 INFO L350 Elim1Store]: Elim1 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-26 00:19:05,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,729 INFO L350 Elim1Store]: Elim1 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-26 00:19:05,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,751 INFO L350 Elim1Store]: Elim1 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-26 00:19:05,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,776 INFO L350 Elim1Store]: Elim1 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-26 00:19:05,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,835 INFO L350 Elim1Store]: Elim1 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-26 00:19:05,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,855 INFO L350 Elim1Store]: Elim1 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-26 00:19:05,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:05,883 INFO L350 Elim1Store]: Elim1 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-26 00:19:06,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,052 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:06,053 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:06,072 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-26 00:19:06,073 INFO L350 Elim1Store]: Elim1 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-26 00:19:06,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:06,106 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:06,125 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-26 00:19:06,126 INFO L350 Elim1Store]: Elim1 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-26 00:19:06,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,163 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:06,164 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:06,171 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-26 00:19:06,172 INFO L350 Elim1Store]: Elim1 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-26 00:19:06,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,366 INFO L350 Elim1Store]: Elim1 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-26 00:19:06,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,439 INFO L350 Elim1Store]: Elim1 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-26 00:19:06,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,458 INFO L350 Elim1Store]: Elim1 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-26 00:19:06,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,480 INFO L350 Elim1Store]: Elim1 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-26 00:19:06,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,552 INFO L350 Elim1Store]: Elim1 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-26 00:19:06,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,580 INFO L350 Elim1Store]: Elim1 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-26 00:19:06,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,613 INFO L350 Elim1Store]: Elim1 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-26 00:19:06,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,712 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:06,713 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:06,740 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-26 00:19:06,741 INFO L350 Elim1Store]: Elim1 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-26 00:19:06,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,779 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:06,780 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:06,788 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-26 00:19:06,789 INFO L350 Elim1Store]: Elim1 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-26 00:19:06,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:06,813 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:06,814 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:06,832 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2022-11-26 00:19:06,833 INFO L350 Elim1Store]: Elim1 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-26 00:19:07,315 INFO L321 Elim1Store]: treesize reduction 92, result has 21.4 percent of original size [2022-11-26 00:19:07,316 INFO L350 Elim1Store]: Elim1 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-26 00:19:07,737 INFO L321 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2022-11-26 00:19:07,737 INFO L350 Elim1Store]: Elim1 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 393 treesize of output 384 [2022-11-26 00:19:07,784 INFO L321 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2022-11-26 00:19:07,784 INFO L350 Elim1Store]: Elim1 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 393 treesize of output 384 [2022-11-26 00:19:07,832 INFO L321 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2022-11-26 00:19:07,833 INFO L350 Elim1Store]: Elim1 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 389 treesize of output 386 [2022-11-26 00:19:07,944 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:19:11,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [2050433576] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:11,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:19:11,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [3, 3, 3] total 10 [2022-11-26 00:19:11,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885830062] [2022-11-26 00:19:11,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:11,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-26 00:19:11,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:11,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-26 00:19:11,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-26 00:19:11,361 INFO L87 Difference]: Start difference. First operand 65 states and 69 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-26 00:19:12,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:12,264 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2022-11-26 00:19:12,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 00:19:12,265 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-26 00:19:12,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:12,265 INFO L225 Difference]: With dead ends: 76 [2022-11-26 00:19:12,265 INFO L226 Difference]: Without dead ends: 76 [2022-11-26 00:19:12,266 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-26 00:19:12,266 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 13 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:12,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 94 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 00:19:12,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-26 00:19:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2022-11-26 00:19:12,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 44 states have (on average 1.75) internal successors, (77), 71 states have internal predecessors, (77), 0 states have call successors, (0), 0 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-26 00:19:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2022-11-26 00:19:12,271 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 11 [2022-11-26 00:19:12,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:12,272 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2022-11-26 00:19:12,272 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-26 00:19:12,272 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-11-26 00:19:12,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-26 00:19:12,272 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:12,272 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-11-26 00:19:12,289 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 00:19:12,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:19:12,479 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-26 00:19:12,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:12,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1488330647, now seen corresponding path program 1 times [2022-11-26 00:19:12,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:12,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203278046] [2022-11-26 00:19:12,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:12,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:12,686 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-26 00:19:12,687 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:12,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203278046] [2022-11-26 00:19:12,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203278046] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:19:12,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249614385] [2022-11-26 00:19:12,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:12,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:19:12,687 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:19:12,688 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:19:12,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:19:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:12,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-26 00:19:12,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:19:12,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:19:12,851 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-26 00:19:12,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-26 00:19:12,862 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-26 00:19:12,863 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:19:12,989 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-26 00:19:12,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249614385] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:19:12,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1192631637] [2022-11-26 00:19:12,991 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2022-11-26 00:19:12,991 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:19:12,992 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:19:12,992 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:19:12,992 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:19:13,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,014 INFO L350 Elim1Store]: Elim1 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-26 00:19:13,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,046 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,047 INFO L350 Elim1Store]: Elim1 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-26 00:19:13,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,092 INFO L350 Elim1Store]: Elim1 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-26 00:19:13,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:19:13,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:19:13,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:19:13,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:19:13,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,174 INFO L350 Elim1Store]: Elim1 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-26 00:19:13,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,216 INFO L350 Elim1Store]: Elim1 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-26 00:19:13,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-26 00:19:13,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-26 00:19:13,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,325 INFO L350 Elim1Store]: Elim1 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-26 00:19:13,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,381 INFO L350 Elim1Store]: Elim1 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-26 00:19:13,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,395 INFO L350 Elim1Store]: Elim1 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-26 00:19:13,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,435 INFO L350 Elim1Store]: Elim1 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-26 00:19:13,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,487 INFO L350 Elim1Store]: Elim1 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-26 00:19:13,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,509 INFO L350 Elim1Store]: Elim1 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-26 00:19:13,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,527 INFO L350 Elim1Store]: Elim1 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-26 00:19:13,668 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:13,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:13,689 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-26 00:19:13,690 INFO L350 Elim1Store]: Elim1 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-26 00:19:13,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,717 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:13,731 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-26 00:19:13,732 INFO L350 Elim1Store]: Elim1 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-26 00:19:13,761 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:13,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:13,778 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-26 00:19:13,778 INFO L350 Elim1Store]: Elim1 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-26 00:19:13,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,930 INFO L350 Elim1Store]: Elim1 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-26 00:19:13,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:13,986 INFO L350 Elim1Store]: Elim1 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-26 00:19:14,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:14,007 INFO L350 Elim1Store]: Elim1 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-26 00:19:14,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:14,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:14,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:14,030 INFO L350 Elim1Store]: Elim1 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-26 00:19:14,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:14,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:14,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:14,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:14,076 INFO L350 Elim1Store]: Elim1 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-26 00:19:14,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:14,101 INFO L350 Elim1Store]: Elim1 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-26 00:19:14,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:14,129 INFO L350 Elim1Store]: Elim1 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-26 00:19:14,214 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:14,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:14,216 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:14,235 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-26 00:19:14,235 INFO L350 Elim1Store]: Elim1 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-26 00:19:14,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:14,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:14,259 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:14,275 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-26 00:19:14,276 INFO L350 Elim1Store]: Elim1 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-26 00:19:14,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:14,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:14,299 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:14,306 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-26 00:19:14,306 INFO L350 Elim1Store]: Elim1 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-26 00:19:14,641 INFO L321 Elim1Store]: treesize reduction 92, result has 21.4 percent of original size [2022-11-26 00:19:14,642 INFO L350 Elim1Store]: Elim1 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-26 00:19:14,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:19:14,939 INFO L350 Elim1Store]: Elim1 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-26 00:19:14,957 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:19:14,957 INFO L350 Elim1Store]: Elim1 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-26 00:19:14,995 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2022-11-26 00:19:14,996 INFO L350 Elim1Store]: Elim1 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-26 00:19:15,063 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:19:18,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1192631637] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:18,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:19:18,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 3, 4] total 13 [2022-11-26 00:19:18,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103846966] [2022-11-26 00:19:18,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:18,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-26 00:19:18,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:18,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-26 00:19:18,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-11-26 00:19:18,813 INFO L87 Difference]: Start difference. First operand 72 states and 77 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-26 00:19:19,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:19,880 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2022-11-26 00:19:19,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 00:19:19,881 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-26 00:19:19,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:19,882 INFO L225 Difference]: With dead ends: 74 [2022-11-26 00:19:19,882 INFO L226 Difference]: Without dead ends: 74 [2022-11-26 00:19:19,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-11-26 00:19:19,883 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:19,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 116 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 00:19:19,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-26 00:19:19,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2022-11-26 00:19:19,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 45 states have (on average 1.7333333333333334) internal successors, (78), 72 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-26 00:19:19,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-11-26 00:19:19,888 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 15 [2022-11-26 00:19:19,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:19,889 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-11-26 00:19:19,889 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-26 00:19:19,889 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-11-26 00:19:19,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 00:19:19,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:19,890 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:19:19,900 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:19:20,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:19:20,095 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-26 00:19:20,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:20,096 INFO L85 PathProgramCache]: Analyzing trace with hash 891856784, now seen corresponding path program 1 times [2022-11-26 00:19:20,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:20,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993313523] [2022-11-26 00:19:20,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:20,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:20,300 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:19:20,301 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:20,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993313523] [2022-11-26 00:19:20,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993313523] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:19:20,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319903473] [2022-11-26 00:19:20,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:20,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:19:20,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:19:20,303 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:19:20,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:19:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:20,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-26 00:19:20,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:19:20,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:19:20,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,452 INFO L350 Elim1Store]: Elim1 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-26 00:19:20,479 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:19:20,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-26 00:19:20,500 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-26 00:19:20,500 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:19:20,556 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-26 00:19:20,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319903473] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:19:20,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1853752091] [2022-11-26 00:19:20,558 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-26 00:19:20,558 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:19:20,559 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:19:20,559 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:19:20,559 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:19:20,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,576 INFO L350 Elim1Store]: Elim1 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-26 00:19:20,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,602 INFO L350 Elim1Store]: Elim1 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-26 00:19:20,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:19:20,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,640 INFO L350 Elim1Store]: Elim1 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-26 00:19:20,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:19:20,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:19:20,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,686 INFO L350 Elim1Store]: Elim1 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-26 00:19:20,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:19:20,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-26 00:19:20,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,735 INFO L350 Elim1Store]: Elim1 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-26 00:19:20,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-26 00:19:20,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,829 INFO L350 Elim1Store]: Elim1 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-26 00:19:20,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,878 INFO L350 Elim1Store]: Elim1 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-26 00:19:20,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,894 INFO L350 Elim1Store]: Elim1 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-26 00:19:20,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,913 INFO L350 Elim1Store]: Elim1 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-26 00:19:20,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,948 INFO L350 Elim1Store]: Elim1 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-26 00:19:20,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,970 INFO L350 Elim1Store]: Elim1 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-26 00:19:20,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:20,991 INFO L350 Elim1Store]: Elim1 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-26 00:19:21,101 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:21,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:21,103 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:21,123 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-26 00:19:21,124 INFO L350 Elim1Store]: Elim1 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-26 00:19:21,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:21,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:21,142 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:21,158 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-26 00:19:21,159 INFO L350 Elim1Store]: Elim1 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-26 00:19:21,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:21,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:21,188 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:21,194 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-26 00:19:21,195 INFO L350 Elim1Store]: Elim1 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-26 00:19:21,355 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:21,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:21,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:21,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:21,366 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-26 00:19:21,367 INFO L350 Elim1Store]: Elim1 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-26 00:19:21,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:21,386 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:21,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:21,403 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-26 00:19:21,403 INFO L350 Elim1Store]: Elim1 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-26 00:19:21,424 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:21,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:21,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:21,440 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-26 00:19:21,441 INFO L350 Elim1Store]: Elim1 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-26 00:19:21,930 INFO L321 Elim1Store]: treesize reduction 184, result has 14.8 percent of original size [2022-11-26 00:19:21,930 INFO L350 Elim1Store]: Elim1 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-26 00:19:22,181 INFO L321 Elim1Store]: treesize reduction 200, result has 14.5 percent of original size [2022-11-26 00:19:22,182 INFO L350 Elim1Store]: Elim1 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-26 00:19:22,277 INFO L321 Elim1Store]: treesize reduction 130, result has 17.7 percent of original size [2022-11-26 00:19:22,277 INFO L350 Elim1Store]: Elim1 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-26 00:19:22,360 INFO L321 Elim1Store]: treesize reduction 200, result has 13.8 percent of original size [2022-11-26 00:19:22,361 INFO L350 Elim1Store]: Elim1 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-26 00:19:22,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:22,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:22,508 INFO L321 Elim1Store]: treesize reduction 125, result has 5.3 percent of original size [2022-11-26 00:19:22,508 INFO L350 Elim1Store]: Elim1 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-26 00:19:22,534 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:22,587 INFO L321 Elim1Store]: treesize reduction 200, result has 17.0 percent of original size [2022-11-26 00:19:22,588 INFO L350 Elim1Store]: Elim1 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-26 00:19:22,611 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:22,664 INFO L321 Elim1Store]: treesize reduction 222, result has 16.9 percent of original size [2022-11-26 00:19:22,665 INFO L350 Elim1Store]: Elim1 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-26 00:19:22,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:22,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:22,791 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:22,798 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-26 00:19:22,799 INFO L350 Elim1Store]: Elim1 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-26 00:19:22,817 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:22,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:22,821 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:22,837 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-26 00:19:22,838 INFO L350 Elim1Store]: Elim1 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-26 00:19:22,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:22,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:22,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:22,872 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-26 00:19:22,873 INFO L350 Elim1Store]: Elim1 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-26 00:19:23,003 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:23,005 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:23,006 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:23,023 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-26 00:19:23,023 INFO L350 Elim1Store]: Elim1 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-26 00:19:23,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:23,048 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:23,051 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:23,067 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-26 00:19:23,068 INFO L350 Elim1Store]: Elim1 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-26 00:19:23,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:23,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:23,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:23,093 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:23,099 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-26 00:19:23,100 INFO L350 Elim1Store]: Elim1 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-26 00:19:23,490 INFO L350 Elim1Store]: Elim1 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-26 00:19:23,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:19:23,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:19:23,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:19:23,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:19:23,545 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:19:27,498 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1266#(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_remove_last_~head#1.offset| |ULTIMATE.start_dll_remove_last_#in~head#1.offset|) (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_dll_remove_last_#in~head#1.base|) (not (= (select |#valid| |ULTIMATE.start_dll_remove_last_~head#1.base|) 1)) (= |ULTIMATE.start_dll_remove_last_#in~head#1.offset| |ULTIMATE.start_main_~#s~0#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_~data~0#1| 1) (<= 0 |ULTIMATE.start_dll_create_~len#1|) (<= |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_remove_last_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_~head~0#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-26 00:19:27,498 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:19:27,498 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:19:27,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2022-11-26 00:19:27,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822996554] [2022-11-26 00:19:27,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:19:27,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-26 00:19:27,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:27,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-26 00:19:27,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2022-11-26 00:19:27,500 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-26 00:19:27,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:27,669 INFO L93 Difference]: Finished difference Result 117 states and 126 transitions. [2022-11-26 00:19:27,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 00:19:27,670 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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-26 00:19:27,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:27,671 INFO L225 Difference]: With dead ends: 117 [2022-11-26 00:19:27,671 INFO L226 Difference]: Without dead ends: 117 [2022-11-26 00:19:27,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-11-26 00:19:27,673 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 259 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:27,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 53 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:19:27,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-26 00:19:27,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 74. [2022-11-26 00:19:27,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 73 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-26 00:19:27,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2022-11-26 00:19:27,692 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 19 [2022-11-26 00:19:27,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:27,692 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2022-11-26 00:19:27,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 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-26 00:19:27,695 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2022-11-26 00:19:27,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 00:19:27,696 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:27,696 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:19:27,709 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:19:27,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:19:27,902 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-26 00:19:27,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:27,903 INFO L85 PathProgramCache]: Analyzing trace with hash 891856785, now seen corresponding path program 1 times [2022-11-26 00:19:27,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:27,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635526031] [2022-11-26 00:19:27,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:27,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:28,305 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-26 00:19:28,306 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:28,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635526031] [2022-11-26 00:19:28,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635526031] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:19:28,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129986519] [2022-11-26 00:19:28,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:28,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:19:28,307 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:19:28,308 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:19:28,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 00:19:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:28,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 18 conjunts are in the unsatisfiable core [2022-11-26 00:19:28,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:19:28,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:19:28,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:28,450 INFO L350 Elim1Store]: Elim1 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-26 00:19:28,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:28,497 INFO L350 Elim1Store]: Elim1 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-26 00:19:28,531 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-26 00:19:28,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:19:30,803 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| Int)) (or (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_31| Int) (v_ArrVal_359 Int)) (or (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_31| |c_#StackHeapBarrier|)) (forall ((v_ArrVal_360 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_359) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_31| v_ArrVal_360) |c_ULTIMATE.start_main_~#s~0#1.base|))))) (not (< |v_ULTIMATE.start_dll_create_~new_head~0#1.base_32| |c_#StackHeapBarrier|)))) (<= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from false [2022-11-26 00:19:30,804 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-26 00:19:30,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129986519] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:19:30,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [874568066] [2022-11-26 00:19:30,806 INFO L159 IcfgInterpreter]: Started Sifa with 12 locations of interest [2022-11-26 00:19:30,806 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:19:30,806 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:19:30,806 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:19:30,806 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:19:30,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:30,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:30,839 INFO L350 Elim1Store]: Elim1 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-26 00:19:30,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:30,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:30,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:30,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:30,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:30,865 INFO L350 Elim1Store]: Elim1 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-26 00:19:30,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:19:30,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:19:30,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:30,912 INFO L350 Elim1Store]: Elim1 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-26 00:19:30,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:30,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:30,935 INFO L350 Elim1Store]: Elim1 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-26 00:19:30,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:19:30,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:19:30,979 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-26 00:19:30,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-26 00:19:31,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,004 INFO L350 Elim1Store]: Elim1 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-26 00:19:31,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,128 INFO L350 Elim1Store]: Elim1 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-26 00:19:31,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,182 INFO L350 Elim1Store]: Elim1 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-26 00:19:31,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,198 INFO L350 Elim1Store]: Elim1 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-26 00:19:31,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,215 INFO L350 Elim1Store]: Elim1 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-26 00:19:31,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,250 INFO L350 Elim1Store]: Elim1 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-26 00:19:31,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,265 INFO L350 Elim1Store]: Elim1 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-26 00:19:31,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,292 INFO L350 Elim1Store]: Elim1 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-26 00:19:31,384 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:31,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,387 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:31,405 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-26 00:19:31,405 INFO L350 Elim1Store]: Elim1 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-26 00:19:31,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,428 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:31,434 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-26 00:19:31,435 INFO L350 Elim1Store]: Elim1 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-26 00:19:31,450 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:31,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,452 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:31,471 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-26 00:19:31,471 INFO L350 Elim1Store]: Elim1 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-26 00:19:31,619 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:31,620 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:31,621 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:31,641 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-26 00:19:31,642 INFO L350 Elim1Store]: Elim1 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-26 00:19:31,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,669 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:31,676 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-11-26 00:19:31,677 INFO L350 Elim1Store]: Elim1 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 386 treesize of output 367 [2022-11-26 00:19:31,695 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:31,696 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:31,697 INFO L350 Elim1Store]: Elim1 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-26 00:19:32,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:32,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:32,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:32,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:32,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:32,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:32,054 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-26 00:19:32,054 INFO L350 Elim1Store]: Elim1 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-26 00:19:32,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:32,115 INFO L350 Elim1Store]: Elim1 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-26 00:19:32,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:32,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:32,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:32,132 INFO L350 Elim1Store]: Elim1 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-26 00:19:32,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:32,149 INFO L350 Elim1Store]: Elim1 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-26 00:19:32,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:32,201 INFO L350 Elim1Store]: Elim1 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-26 00:19:32,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:32,216 INFO L350 Elim1Store]: Elim1 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-26 00:19:32,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:32,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:32,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:32,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:32,239 INFO L350 Elim1Store]: Elim1 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-26 00:19:32,321 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:32,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:32,324 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:32,343 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-26 00:19:32,344 INFO L350 Elim1Store]: Elim1 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-26 00:19:32,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:32,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:32,366 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:32,373 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-26 00:19:32,374 INFO L350 Elim1Store]: Elim1 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-26 00:19:32,389 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:32,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:32,391 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:32,405 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-26 00:19:32,406 INFO L350 Elim1Store]: Elim1 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-26 00:19:32,562 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:32,563 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:32,564 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:32,583 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-26 00:19:32,584 INFO L350 Elim1Store]: Elim1 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-26 00:19:32,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:32,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:32,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:32,612 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:32,627 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-11-26 00:19:32,628 INFO L350 Elim1Store]: Elim1 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 386 treesize of output 367 [2022-11-26 00:19:32,647 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:32,648 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:32,649 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:32,665 INFO L321 Elim1Store]: treesize reduction 35, result has 20.5 percent of original size [2022-11-26 00:19:32,666 INFO L350 Elim1Store]: Elim1 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-26 00:19:33,056 INFO L350 Elim1Store]: Elim1 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-26 00:19:33,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:19:33,081 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:19:33,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:19:33,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:19:33,108 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:19:37,218 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1593#(and (<= 1 |ULTIMATE.start_dll_create_~data#1|) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (not (<= (+ |ULTIMATE.start_dll_remove_last_~head#1.offset| 4) (select |#length| |ULTIMATE.start_dll_remove_last_~head#1.base|))) (= |ULTIMATE.start_dll_create_~head~0#1.offset| |ULTIMATE.start_dll_create_#res#1.offset|) (= |ULTIMATE.start_dll_remove_last_~head#1.offset| |ULTIMATE.start_dll_remove_last_#in~head#1.offset|) (= |ULTIMATE.start_dll_remove_last_~head#1.base| |ULTIMATE.start_dll_remove_last_#in~head#1.base|) (= |ULTIMATE.start_dll_remove_last_#in~head#1.offset| |ULTIMATE.start_main_~#s~0#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_~data~0#1| 1) (<= 0 |ULTIMATE.start_dll_create_~len#1|) (<= |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_remove_last_#in~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|) (<= |ULTIMATE.start_dll_create_~head~0#1.offset| 0) (<= 0 |ULTIMATE.start_dll_create_~head~0#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-26 00:19:37,218 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:19:37,218 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:19:37,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 4] total 10 [2022-11-26 00:19:37,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460348641] [2022-11-26 00:19:37,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:19:37,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-26 00:19:37,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:37,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-26 00:19:37,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=313, Unknown=1, NotChecked=38, Total=462 [2022-11-26 00:19:37,220 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 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-26 00:19:37,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:37,452 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-11-26 00:19:37,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:19:37,453 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 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-26 00:19:37,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:37,453 INFO L225 Difference]: With dead ends: 102 [2022-11-26 00:19:37,453 INFO L226 Difference]: Without dead ends: 102 [2022-11-26 00:19:37,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=146, Invalid=409, Unknown=1, NotChecked=44, Total=600 [2022-11-26 00:19:37,454 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 356 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:37,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 37 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 112 Invalid, 0 Unknown, 62 Unchecked, 0.2s Time] [2022-11-26 00:19:37,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-26 00:19:37,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 69. [2022-11-26 00:19:37,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.5625) internal successors, (75), 68 states have internal predecessors, (75), 0 states have call successors, (0), 0 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-26 00:19:37,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2022-11-26 00:19:37,468 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 19 [2022-11-26 00:19:37,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:37,469 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2022-11-26 00:19:37,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 0 states have call successors, (0), 0 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-26 00:19:37,469 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2022-11-26 00:19:37,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-26 00:19:37,475 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:37,475 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:19:37,486 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-26 00:19:37,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-26 00:19:37,681 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-26 00:19:37,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:37,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1877756558, now seen corresponding path program 1 times [2022-11-26 00:19:37,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:37,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367327339] [2022-11-26 00:19:37,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:37,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:37,832 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-26 00:19:37,833 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:37,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367327339] [2022-11-26 00:19:37,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367327339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:37,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:19:37,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-26 00:19:37,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910512298] [2022-11-26 00:19:37,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:37,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-26 00:19:37,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:37,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-26 00:19:37,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:19:37,836 INFO L87 Difference]: Start difference. First operand 69 states and 75 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-26 00:19:38,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:38,053 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2022-11-26 00:19:38,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 00:19:38,054 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-26 00:19:38,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:38,055 INFO L225 Difference]: With dead ends: 99 [2022-11-26 00:19:38,055 INFO L226 Difference]: Without dead ends: 99 [2022-11-26 00:19:38,055 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-26 00:19:38,056 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 131 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:38,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 117 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:19:38,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-11-26 00:19:38,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 69. [2022-11-26 00:19:38,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 68 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:19:38,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2022-11-26 00:19:38,060 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 20 [2022-11-26 00:19:38,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:38,060 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2022-11-26 00:19:38,060 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-26 00:19:38,060 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2022-11-26 00:19:38,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-26 00:19:38,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:38,061 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:19:38,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-26 00:19:38,068 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-26 00:19:38,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:38,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1877756559, now seen corresponding path program 1 times [2022-11-26 00:19:38,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:38,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601857551] [2022-11-26 00:19:38,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:38,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:38,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:38,382 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-26 00:19:38,382 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:38,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601857551] [2022-11-26 00:19:38,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601857551] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:38,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:19:38,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-26 00:19:38,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666855967] [2022-11-26 00:19:38,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:38,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-26 00:19:38,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:38,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-26 00:19:38,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:19:38,385 INFO L87 Difference]: Start difference. First operand 69 states and 76 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-26 00:19:38,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:38,598 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-11-26 00:19:38,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:19:38,598 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-26 00:19:38,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:38,599 INFO L225 Difference]: With dead ends: 93 [2022-11-26 00:19:38,599 INFO L226 Difference]: Without dead ends: 93 [2022-11-26 00:19:38,599 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-26 00:19:38,600 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 211 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:38,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 101 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:19:38,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-26 00:19:38,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 67. [2022-11-26 00:19:38,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.5208333333333333) internal successors, (73), 66 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:19:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 73 transitions. [2022-11-26 00:19:38,603 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 73 transitions. Word has length 20 [2022-11-26 00:19:38,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:38,603 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 73 transitions. [2022-11-26 00:19:38,603 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-26 00:19:38,604 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 73 transitions. [2022-11-26 00:19:38,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-26 00:19:38,604 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:38,604 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:19:38,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-26 00:19:38,605 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-26 00:19:38,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:38,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1916465157, now seen corresponding path program 1 times [2022-11-26 00:19:38,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:38,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244989214] [2022-11-26 00:19:38,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:38,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:38,688 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-26 00:19:38,688 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:38,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244989214] [2022-11-26 00:19:38,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244989214] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:38,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:19:38,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:19:38,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829624900] [2022-11-26 00:19:38,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:38,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:19:38,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:38,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:19:38,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:19:38,690 INFO L87 Difference]: Start difference. First operand 67 states and 73 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:19:38,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:38,709 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2022-11-26 00:19:38,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:19:38,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-11-26 00:19:38,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:38,713 INFO L225 Difference]: With dead ends: 94 [2022-11-26 00:19:38,713 INFO L226 Difference]: Without dead ends: 94 [2022-11-26 00:19:38,713 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-26 00:19:38,714 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 109 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 94 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-26 00:19:38,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 94 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:19:38,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-11-26 00:19:38,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 66. [2022-11-26 00:19:38,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 65 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-26 00:19:38,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2022-11-26 00:19:38,718 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 21 [2022-11-26 00:19:38,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:38,718 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2022-11-26 00:19:38,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:19:38,719 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2022-11-26 00:19:38,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-26 00:19:38,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:38,719 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:19:38,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-26 00:19:38,720 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-26 00:19:38,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:38,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1703376233, now seen corresponding path program 1 times [2022-11-26 00:19:38,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:38,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030529172] [2022-11-26 00:19:38,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:38,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:38,844 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-26 00:19:38,844 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:38,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030529172] [2022-11-26 00:19:38,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030529172] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:38,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:19:38,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-26 00:19:38,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300729292] [2022-11-26 00:19:38,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:38,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-26 00:19:38,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:38,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-26 00:19:38,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:19:38,846 INFO L87 Difference]: Start difference. First operand 66 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-26 00:19:38,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:38,958 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-11-26 00:19:38,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 00:19:38,958 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-26 00:19:38,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:38,959 INFO L225 Difference]: With dead ends: 65 [2022-11-26 00:19:38,959 INFO L226 Difference]: Without dead ends: 65 [2022-11-26 00:19:38,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-11-26 00:19:38,960 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 174 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:38,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 55 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:19:38,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-26 00:19:38,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-26 00:19:38,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.4893617021276595) internal successors, (70), 64 states have internal predecessors, (70), 0 states have call successors, (0), 0 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-26 00:19:38,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-11-26 00:19:38,963 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 23 [2022-11-26 00:19:38,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:38,963 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-11-26 00:19:38,964 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-26 00:19:38,964 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-11-26 00:19:38,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-26 00:19:38,964 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:38,965 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:19:38,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-26 00:19:38,965 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-26 00:19:38,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:38,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1703360589, now seen corresponding path program 1 times [2022-11-26 00:19:38,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:38,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434061594] [2022-11-26 00:19:38,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:38,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:39,036 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-26 00:19:39,036 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:39,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434061594] [2022-11-26 00:19:39,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434061594] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:39,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:19:39,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:19:39,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190261185] [2022-11-26 00:19:39,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:39,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:19:39,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:39,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:19:39,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:19:39,038 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:19:39,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:39,137 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-11-26 00:19:39,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:19:39,137 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-26 00:19:39,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:39,138 INFO L225 Difference]: With dead ends: 65 [2022-11-26 00:19:39,138 INFO L226 Difference]: Without dead ends: 65 [2022-11-26 00:19:39,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:19:39,139 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 33 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:39,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 65 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:19:39,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-26 00:19:39,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2022-11-26 00:19:39,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 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-26 00:19:39,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-11-26 00:19:39,141 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 23 [2022-11-26 00:19:39,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:39,142 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-11-26 00:19:39,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:19:39,142 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-11-26 00:19:39,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-26 00:19:39,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:39,142 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:19:39,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-26 00:19:39,143 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-26 00:19:39,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:39,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1703360588, now seen corresponding path program 1 times [2022-11-26 00:19:39,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:39,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555030022] [2022-11-26 00:19:39,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:39,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:39,443 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-26 00:19:39,443 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:39,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555030022] [2022-11-26 00:19:39,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555030022] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:39,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:19:39,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-26 00:19:39,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184169988] [2022-11-26 00:19:39,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:39,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-26 00:19:39,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:39,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-26 00:19:39,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:19:39,445 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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-26 00:19:39,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:39,746 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2022-11-26 00:19:39,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 00:19:39,747 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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-26 00:19:39,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:39,748 INFO L225 Difference]: With dead ends: 103 [2022-11-26 00:19:39,748 INFO L226 Difference]: Without dead ends: 103 [2022-11-26 00:19:39,748 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-11-26 00:19:39,749 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 232 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:39,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 110 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:19:39,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-11-26 00:19:39,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2022-11-26 00:19:39,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 55 states have (on average 1.4727272727272727) 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-26 00:19:39,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-11-26 00:19:39,751 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 23 [2022-11-26 00:19:39,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:39,752 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-11-26 00:19:39,752 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 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-26 00:19:39,752 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-11-26 00:19:39,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-26 00:19:39,752 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:39,753 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-26 00:19:39,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-26 00:19:39,753 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-26 00:19:39,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:39,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1265055569, now seen corresponding path program 1 times [2022-11-26 00:19:39,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:39,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799779198] [2022-11-26 00:19:39,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:39,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:39,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:39,905 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-26 00:19:39,905 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:39,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799779198] [2022-11-26 00:19:39,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799779198] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:39,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:19:39,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-26 00:19:39,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474039373] [2022-11-26 00:19:39,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:39,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-26 00:19:39,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:39,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-26 00:19:39,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:19:39,908 INFO L87 Difference]: Start difference. First operand 71 states and 81 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-26 00:19:40,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:40,071 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2022-11-26 00:19:40,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-26 00:19:40,072 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-26 00:19:40,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:40,072 INFO L225 Difference]: With dead ends: 87 [2022-11-26 00:19:40,072 INFO L226 Difference]: Without dead ends: 87 [2022-11-26 00:19:40,073 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-26 00:19:40,073 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 179 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:40,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 84 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:19:40,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-26 00:19:40,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 74. [2022-11-26 00:19:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 73 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-26 00:19:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2022-11-26 00:19:40,076 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 24 [2022-11-26 00:19:40,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:40,076 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2022-11-26 00:19:40,076 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-26 00:19:40,076 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2022-11-26 00:19:40,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:19:40,077 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:40,077 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-26 00:19:40,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-26 00:19:40,077 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-26 00:19:40,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:40,078 INFO L85 PathProgramCache]: Analyzing trace with hash -562016871, now seen corresponding path program 1 times [2022-11-26 00:19:40,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:40,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730051126] [2022-11-26 00:19:40,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:40,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:40,150 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-26 00:19:40,150 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:40,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730051126] [2022-11-26 00:19:40,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730051126] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:40,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:19:40,150 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:19:40,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479498156] [2022-11-26 00:19:40,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:40,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:19:40,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:40,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:19:40,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:19:40,152 INFO L87 Difference]: Start difference. First operand 74 states and 84 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-26 00:19:40,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:40,239 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2022-11-26 00:19:40,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:19:40,239 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-26 00:19:40,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:40,240 INFO L225 Difference]: With dead ends: 73 [2022-11-26 00:19:40,240 INFO L226 Difference]: Without dead ends: 73 [2022-11-26 00:19:40,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:19:40,241 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 19 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:40,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 81 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:19:40,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-26 00:19:40,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-11-26 00:19:40,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 0 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-26 00:19:40,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2022-11-26 00:19:40,244 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 25 [2022-11-26 00:19:40,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:40,244 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2022-11-26 00:19:40,244 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-26 00:19:40,244 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-11-26 00:19:40,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:19:40,245 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:40,245 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-26 00:19:40,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-26 00:19:40,246 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-26 00:19:40,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:40,246 INFO L85 PathProgramCache]: Analyzing trace with hash -546984227, now seen corresponding path program 1 times [2022-11-26 00:19:40,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:40,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78254979] [2022-11-26 00:19:40,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:40,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:40,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:40,612 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-26 00:19:40,612 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:40,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78254979] [2022-11-26 00:19:40,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78254979] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:40,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:19:40,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-26 00:19:40,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825819832] [2022-11-26 00:19:40,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:40,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-26 00:19:40,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:40,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-26 00:19:40,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-26 00:19:40,615 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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-26 00:19:40,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:40,969 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2022-11-26 00:19:40,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-26 00:19:40,969 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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-26 00:19:40,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:40,970 INFO L225 Difference]: With dead ends: 75 [2022-11-26 00:19:40,970 INFO L226 Difference]: Without dead ends: 75 [2022-11-26 00:19:40,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2022-11-26 00:19:40,971 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 190 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:40,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 104 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:19:40,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-26 00:19:40,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2022-11-26 00:19:40,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 71 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-26 00:19:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2022-11-26 00:19:40,974 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 25 [2022-11-26 00:19:40,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:40,974 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2022-11-26 00:19:40,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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-26 00:19:40,974 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-11-26 00:19:40,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-26 00:19:40,974 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:40,975 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-26 00:19:40,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-26 00:19:40,975 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-26 00:19:40,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:40,975 INFO L85 PathProgramCache]: Analyzing trace with hash -242653710, now seen corresponding path program 1 times [2022-11-26 00:19:40,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:40,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64464497] [2022-11-26 00:19:40,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:40,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:41,205 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-26 00:19:41,205 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:41,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64464497] [2022-11-26 00:19:41,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64464497] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:19:41,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720575700] [2022-11-26 00:19:41,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:41,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:19:41,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:19:41,210 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:19:41,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 00:19:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:41,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-26 00:19:41,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:19:41,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:41,484 INFO L350 Elim1Store]: Elim1 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-26 00:19:41,487 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-26 00:19:41,487 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:19:41,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720575700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:41,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:19:41,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-11-26 00:19:41,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153323898] [2022-11-26 00:19:41,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:41,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-26 00:19:41,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:41,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-26 00:19:41,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-11-26 00:19:41,490 INFO L87 Difference]: Start difference. First operand 72 states and 79 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-26 00:19:41,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:41,607 INFO L93 Difference]: Finished difference Result 78 states and 86 transitions. [2022-11-26 00:19:41,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-26 00:19:41,607 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-26 00:19:41,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:41,608 INFO L225 Difference]: With dead ends: 78 [2022-11-26 00:19:41,608 INFO L226 Difference]: Without dead ends: 78 [2022-11-26 00:19:41,608 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-26 00:19:41,609 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 80 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:41,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 56 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:19:41,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-26 00:19:41,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 71. [2022-11-26 00:19:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 57 states have (on average 1.368421052631579) internal successors, (78), 70 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-26 00:19:41,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2022-11-26 00:19:41,612 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 26 [2022-11-26 00:19:41,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:41,612 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2022-11-26 00:19:41,613 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-26 00:19:41,613 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2022-11-26 00:19:41,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-26 00:19:41,613 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:41,613 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-26 00:19:41,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-26 00:19:41,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-26 00:19:41,819 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-26 00:19:41,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:41,820 INFO L85 PathProgramCache]: Analyzing trace with hash 223361305, now seen corresponding path program 1 times [2022-11-26 00:19:41,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:41,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198161216] [2022-11-26 00:19:41,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:41,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:42,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:19:42,502 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:42,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198161216] [2022-11-26 00:19:42,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198161216] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:19:42,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997312270] [2022-11-26 00:19:42,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:42,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:19:42,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:19:42,504 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:19:42,510 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 00:19:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:42,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 57 conjunts are in the unsatisfiable core [2022-11-26 00:19:42,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:19:42,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:19:42,752 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:19:42,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-26 00:19:42,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:19:42,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-26 00:19:42,870 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:19:42,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 35 [2022-11-26 00:19:43,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-26 00:19:43,140 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:19:43,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 16 [2022-11-26 00:19:43,144 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:19:43,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:19:43,198 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 20 [2022-11-26 00:19:43,309 INFO L321 Elim1Store]: treesize reduction 5, result has 79.2 percent of original size [2022-11-26 00:19:43,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 27 [2022-11-26 00:19:43,335 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_994 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_994))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0)) (= (select (select .cse1 .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2022-11-26 00:19:43,361 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_992 Int) (|ULTIMATE.start_main_~#s~0#1.base| Int) (v_ArrVal_994 (Array Int Int))) (let ((.cse1 (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_992)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_994))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select .cse1 .cse0) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))))) is different from false [2022-11-26 00:19:43,374 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:19:43,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 51 [2022-11-26 00:19:43,417 INFO L321 Elim1Store]: treesize reduction 36, result has 48.6 percent of original size [2022-11-26 00:19:43,418 INFO L350 Elim1Store]: Elim1 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 114 treesize of output 115 [2022-11-26 00:19:43,431 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:19:43,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 91 [2022-11-26 00:19:43,639 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-26 00:19:43,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997312270] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:19:43,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [294592015] [2022-11-26 00:19:43,645 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2022-11-26 00:19:43,646 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:19:43,646 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:19:43,646 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:19:43,646 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:19:43,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:43,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:43,685 INFO L350 Elim1Store]: Elim1 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-26 00:19:43,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:43,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:43,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:43,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:43,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:43,720 INFO L350 Elim1Store]: Elim1 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-26 00:19:43,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:43,749 INFO L350 Elim1Store]: Elim1 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-26 00:19:43,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:19:43,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:19:43,793 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:19:43,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:19:43,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:43,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:43,817 INFO L350 Elim1Store]: Elim1 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-26 00:19:43,841 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-26 00:19:43,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-26 00:19:43,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:43,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:43,868 INFO L350 Elim1Store]: Elim1 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-26 00:19:43,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:43,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:43,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:43,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:43,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:43,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:43,947 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:43,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:43,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:43,951 INFO L350 Elim1Store]: Elim1 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-26 00:19:43,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:43,992 INFO L350 Elim1Store]: Elim1 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-26 00:19:44,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,013 INFO L350 Elim1Store]: Elim1 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-26 00:19:44,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,044 INFO L350 Elim1Store]: Elim1 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-26 00:19:44,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,089 INFO L350 Elim1Store]: Elim1 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-26 00:19:44,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,110 INFO L350 Elim1Store]: Elim1 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-26 00:19:44,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,134 INFO L350 Elim1Store]: Elim1 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-26 00:19:44,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,173 INFO L350 Elim1Store]: Elim1 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-26 00:19:44,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,192 INFO L350 Elim1Store]: Elim1 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-26 00:19:44,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,214 INFO L350 Elim1Store]: Elim1 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-26 00:19:44,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,271 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:44,272 INFO L350 Elim1Store]: Elim1 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-26 00:19:44,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,293 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:44,294 INFO L350 Elim1Store]: Elim1 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-26 00:19:44,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,324 INFO L350 Elim1Store]: Elim1 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-26 00:19:44,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,612 INFO L321 Elim1Store]: treesize reduction 34, result has 41.4 percent of original size [2022-11-26 00:19:44,612 INFO L350 Elim1Store]: Elim1 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-26 00:19:44,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,685 INFO L350 Elim1Store]: Elim1 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-26 00:19:44,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,709 INFO L350 Elim1Store]: Elim1 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-26 00:19:44,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,723 INFO L350 Elim1Store]: Elim1 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-26 00:19:44,757 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,758 INFO L350 Elim1Store]: Elim1 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-26 00:19:44,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,775 INFO L350 Elim1Store]: Elim1 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-26 00:19:44,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,791 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,796 INFO L350 Elim1Store]: Elim1 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-26 00:19:44,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,853 INFO L350 Elim1Store]: Elim1 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-26 00:19:44,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,874 INFO L350 Elim1Store]: Elim1 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-26 00:19:44,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,900 INFO L350 Elim1Store]: Elim1 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-26 00:19:44,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,971 INFO L350 Elim1Store]: Elim1 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-26 00:19:44,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:44,994 INFO L350 Elim1Store]: Elim1 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-26 00:19:45,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:45,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:45,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:45,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:45,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:45,025 INFO L350 Elim1Store]: Elim1 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-26 00:19:45,080 INFO L350 Elim1Store]: Elim1 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-26 00:19:45,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:19:45,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:19:45,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:19:45,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:19:45,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:19:45,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:19:45,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:45,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-26 00:19:45,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:45,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-26 00:19:45,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-26 00:19:45,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-26 00:19:45,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:45,205 INFO L350 Elim1Store]: Elim1 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-26 00:19:45,215 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:45,248 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:19:45,248 INFO L350 Elim1Store]: Elim1 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-26 00:19:45,265 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:45,276 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-26 00:19:45,277 INFO L350 Elim1Store]: Elim1 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-26 00:19:45,348 INFO L350 Elim1Store]: Elim1 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-26 00:19:45,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:19:45,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:19:45,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:19:45,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:19:45,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:45,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-26 00:19:45,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:19:45,414 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:19:45,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-26 00:19:45,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:45,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-26 00:19:45,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-26 00:19:45,474 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:45,484 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-11-26 00:19:45,484 INFO L350 Elim1Store]: Elim1 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-26 00:19:45,496 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:45,507 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-26 00:19:45,508 INFO L350 Elim1Store]: Elim1 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-26 00:19:45,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:45,521 INFO L350 Elim1Store]: Elim1 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-26 00:19:45,832 INFO L350 Elim1Store]: Elim1 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-26 00:19:45,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:19:45,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:19:45,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-26 00:19:45,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-26 00:19:45,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:19:45,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:19:45,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:45,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:45,961 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:45,966 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:19:45,967 INFO L350 Elim1Store]: Elim1 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-26 00:19:46,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-26 00:19:46,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:46,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:19:46,068 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:19:46,073 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-26 00:19:46,074 INFO L350 Elim1Store]: Elim1 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-26 00:19:46,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-26 00:19:46,162 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:19:50,292 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3724#(and (<= 0 |ULTIMATE.start_dll_remove_last_~head#1.offset|) (<= 1 |ULTIMATE.start_dll_create_~data#1|) (<= |ULTIMATE.start_dll_remove_last_#in~head#1.offset| 0) (<= 2 |ULTIMATE.start_dll_create_#in~len#1|) (<= 0 |ULTIMATE.start_dll_remove_last_#in~head#1.base|) (<= |ULTIMATE.start_dll_remove_last_~head#1.offset| 0) (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= |ULTIMATE.start_dll_create_#res#1.offset| 0) (<= |ULTIMATE.start_dll_create_~data#1| 1) (<= 0 |ULTIMATE.start_dll_remove_last_~head#1.base|) (<= 0 |ULTIMATE.start_dll_remove_last_#in~head#1.offset|) (<= 0 (+ |ULTIMATE.start_dll_create_~len#1| 1)) (= |ULTIMATE.start_main_~data~0#1| 1) (<= |ULTIMATE.start_dll_create_#in~len#1| 2) (not (= (select |#valid| |ULTIMATE.start_dll_remove_last_~last~0#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) (<= 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|) (<= 0 (+ |ULTIMATE.start_dll_remove_last_~snd_to_last~0#1.offset| 4)) (= |#NULL.base| 0))' at error location [2022-11-26 00:19:50,292 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:19:50,292 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:19:50,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 31 [2022-11-26 00:19:50,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12509310] [2022-11-26 00:19:50,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:19:50,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-11-26 00:19:50,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:50,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-11-26 00:19:50,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1867, Unknown=2, NotChecked=178, Total=2256 [2022-11-26 00:19:50,299 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 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-26 00:19:51,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:51,608 INFO L93 Difference]: Finished difference Result 98 states and 107 transitions. [2022-11-26 00:19:51,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-26 00:19:51,609 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 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-26 00:19:51,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:51,610 INFO L225 Difference]: With dead ends: 98 [2022-11-26 00:19:51,610 INFO L226 Difference]: Without dead ends: 98 [2022-11-26 00:19:51,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=481, Invalid=3065, Unknown=2, NotChecked=234, Total=3782 [2022-11-26 00:19:51,612 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 363 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:51,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 227 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 674 Invalid, 0 Unknown, 141 Unchecked, 0.6s Time] [2022-11-26 00:19:51,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-11-26 00:19:51,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2022-11-26 00:19:51,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 71 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-26 00:19:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2022-11-26 00:19:51,616 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 26 [2022-11-26 00:19:51,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:51,617 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2022-11-26 00:19:51,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 32 states have internal predecessors, (70), 0 states have call successors, (0), 0 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-26 00:19:51,617 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2022-11-26 00:19:51,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-26 00:19:51,618 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:51,618 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-26 00:19:51,625 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-11-26 00:19:51,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:19:51,824 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 31 more)] === [2022-11-26 00:19:51,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:51,825 INFO L85 PathProgramCache]: Analyzing trace with hash 223361306, now seen corresponding path program 1 times [2022-11-26 00:19:51,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:51,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601711720] [2022-11-26 00:19:51,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:51,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:52,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:19:52,969 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:52,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601711720] [2022-11-26 00:19:52,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601711720] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:19:52,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385659328] [2022-11-26 00:19:52,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:52,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:19:52,970 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:19:52,971 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:19:52,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ed5623db-ee99-439f-8114-07aea8b8e852/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-26 00:19:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:53,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 71 conjunts are in the unsatisfiable core [2022-11-26 00:19:53,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:19:53,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:19:53,306 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-26 00:19:53,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-26 00:19:53,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:19:53,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-26 00:19:53,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-26 00:19:53,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-11-26 00:19:53,566 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-26 00:19:53,566 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 60 [2022-11-26 00:19:53,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2022-11-26 00:19:54,362 INFO L321 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2022-11-26 00:19:54,363 INFO L350 Elim1Store]: Elim1 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 145 treesize of output 62 [2022-11-26 00:19:54,394 INFO L321 Elim1Store]: treesize reduction 14, result has 57.6 percent of original size [2022-11-26 00:19:54,394 INFO L350 Elim1Store]: Elim1 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 40 treesize of output 38 [2022-11-26 00:19:54,441 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:19:54,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:19:55,327 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:19:55,328 INFO L350 Elim1Store]: Elim1 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-26 00:19:56,759 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5))) (and (forall ((v_prenex_6 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse6 (select (select .cse3 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse2 (select (select .cse8 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (+ 4 .cse6))) (let ((.cse1 (select (select .cse8 .cse2) .cse4)) (.cse0 (select (let ((.cse7 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (select .cse7 (select (select .cse7 v_prenex_3) |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_3) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse1 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse2)) (= .cse1 .cse0) (< (select (select .cse3 .cse2) .cse4) .cse5) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse6)))))))) (forall ((v_prenex_6 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse14 (select (select .cse16 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse11 (select (select .cse12 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse13 (+ .cse14 4))) (let ((.cse10 (select (select .cse16 .cse11) .cse13)) (.cse9 (select (let ((.cse15 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (select .cse15 (select (select .cse15 v_prenex_6) |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_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< .cse10 .cse5) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse11)) (= .cse10 0) (= .cse9 (select (select .cse12 .cse11) .cse13)) (not (= .cse14 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (forall ((v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1100 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse19 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1100))) (let ((.cse18 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1101) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse17 (select (select .cse19 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse17 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse18)) (<= 0 (+ (select (select .cse19 .cse18) (+ .cse17 4)) 4)))))) (forall ((v_prenex_6 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse21 (select (select .cse24 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse23 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse20 (select (select .cse24 .cse21) (+ 4 .cse23)))) (or (= .cse20 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse20 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse21)) (= .cse20 (select (let ((.cse22 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (select .cse22 (select (select .cse22 v_prenex_3) |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_3) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse23))))))) (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse25 (select (let ((.cse32 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (select .cse32 (select (select .cse32 v_prenex_6) |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_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (or (= .cse25 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse30 (select (select .cse28 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse31 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse27 (select (select .cse31 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse29 (+ .cse30 4))) (let ((.cse26 (select (select .cse31 .cse27) .cse29))) (or (= .cse26 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse27)) (= (select (select .cse28 .cse27) .cse29) 0) (= .cse25 .cse26) (not (= .cse30 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))))))) (forall ((v_prenex_6 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse39 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse38 (select (select .cse39 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse36 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse34 (select (select .cse36 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse37 (+ .cse38 4))) (let ((.cse33 (select (select .cse39 .cse34) .cse37))) (or (< .cse33 .cse5) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse34)) (= .cse33 0) (= (select (let ((.cse35 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (select .cse35 (select (select .cse35 v_prenex_6) |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_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select .cse36 .cse34) .cse37)) (not (= .cse38 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (or (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse43 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse41 (select (select .cse43 v_prenex_6) |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_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse40 (select (select .cse43 .cse41) (+ 4 .cse42)))) (or (= .cse40 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse40 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse41)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse42))))))) (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (= (select (let ((.cse44 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (select .cse44 (select (select .cse44 v_prenex_3) |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_3) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse50 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse48 (select (select .cse50 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse49 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse46 (select (select .cse50 .cse48) (+ 4 .cse49)))) (or (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse45 (select (let ((.cse47 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (select .cse47 (select (select .cse47 v_prenex_3) |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_3) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (= .cse45 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse46 .cse45)))) (= .cse46 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse46 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse48)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse49))))))) (or (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (= (select (let ((.cse51 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (select .cse51 (select (select .cse51 v_prenex_6) |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_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (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 ((.cse56 (select (select .cse55 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse52 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse53 (select (select .cse52 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse54 (+ .cse56 4))) (or (= (select (select .cse52 .cse53) .cse54) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse53)) (= (select (select .cse55 .cse53) .cse54) 0) (not (= .cse56 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse59 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse61 (select (select .cse59 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse62 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse58 (select (select .cse62 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse60 (+ 4 .cse61))) (let ((.cse57 (select (select .cse62 .cse58) .cse60))) (or (= .cse57 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse57 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse58)) (< (select (select .cse59 .cse58) .cse60) .cse5) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse61)))))))) (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse66 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse64 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse65 (select (select .cse66 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse63 (select (select .cse66 .cse64) (+ .cse65 4)))) (or (< .cse63 .cse5) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse64)) (= .cse63 0) (not (= .cse65 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse72 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse71 (select (select .cse72 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse67 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse68 (select (select .cse67 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse69 (+ .cse71 4))) (let ((.cse70 (select (select .cse72 .cse68) .cse69))) (or (= (select (select .cse67 .cse68) .cse69) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (< .cse70 .cse5) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse68)) (= .cse70 0) (not (= .cse71 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse76 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse77 (select (select .cse76 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse73 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse74 (select (select .cse73 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse75 (+ 4 .cse77))) (or (= (select (select .cse73 .cse74) .cse75) 0) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse74)) (< (select (select .cse76 .cse74) .cse75) .cse5) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse77))))))) (forall ((v_prenex_6 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse80 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse83 (select (select .cse80 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse84 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse79 (select (select .cse84 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse81 (+ .cse83 4))) (let ((.cse78 (select (select .cse84 .cse79) .cse81))) (or (= .cse78 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse79)) (= (select (select .cse80 .cse79) .cse81) 0) (= (select (let ((.cse82 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (select .cse82 (select (select .cse82 v_prenex_6) |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_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) .cse78) (not (= .cse83 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))))) is different from false [2022-11-26 00:19:57,838 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse87 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse6 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 5)) (.cse9 (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|) .cse87 0))) (.cse8 (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|) .cse87 0)))) (and (forall ((v_prenex_6 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse4 (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse3 (select (select .cse4 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse10 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse1 (select (select .cse10 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (+ .cse3 4))) (let ((.cse0 (select (select .cse10 .cse1) .cse5)) (.cse2 (select (let ((.cse7 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (select .cse7 (select (select .cse7 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (= .cse0 0) (not (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse3)) (< (select (select .cse4 .cse1) .cse5) .cse6) (= .cse0 .cse2))))))) (forall ((v_prenex_6 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse18 (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse13 (select (select .cse18 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse15 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse11 (select (select .cse15 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse16 (+ .cse13 4))) (let ((.cse12 (select (select .cse18 .cse11) .cse16)) (.cse14 (select (let ((.cse17 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (select .cse17 (select (select .cse17 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (not (= .cse11 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse12 0) (< .cse12 .cse6) (not (= .cse13 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse14 (select (select .cse15 .cse11) .cse16)) (= .cse14 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse24 (select (let ((.cse26 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (select .cse26 (select (select .cse26 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse20 (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse23 (select (select .cse20 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse25 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse19 (select (select .cse25 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse21 (+ .cse23 4))) (let ((.cse22 (select (select .cse25 .cse19) .cse21))) (or (not (= .cse19 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select .cse20 .cse19) .cse21) 0) (= .cse22 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse23 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= .cse24 .cse22))))))) (= .cse24 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (or (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse28 (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse31 (select (select .cse28 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse30 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse27 (select (select .cse30 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse29 (+ .cse31 4))) (or (not (= .cse27 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select .cse28 .cse27) .cse29) 0) (= (select (select .cse30 .cse27) .cse29) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse31 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (= (select (let ((.cse32 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (select .cse32 (select (select .cse32 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (= (select (let ((.cse33 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (select .cse33 (select (select .cse33 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse37 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse35 (select (select .cse37 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse36 (select (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse34 (select (select .cse37 .cse35) (+ .cse36 4)))) (or (= .cse34 0) (not (= .cse35 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse36)) (= .cse34 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse42 (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse41 (select (select .cse42 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse38 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse39 (select (select .cse38 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse40 (+ .cse41 4))) (or (= (select (select .cse38 .cse39) .cse40) 0) (not (= .cse39 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse41)) (< (select (select .cse42 .cse39) .cse40) .cse6)))))) (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse46 (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse43 (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse45 (select (select .cse46 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse44 (select (select .cse46 .cse43) (+ .cse45 4)))) (or (not (= .cse43 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse44 0) (< .cse44 .cse6) (not (= .cse45 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))))) (forall ((v_prenex_6 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse53 (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse49 (select (select .cse53 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse51 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse47 (select (select .cse51 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse52 (+ .cse49 4))) (let ((.cse48 (select (select .cse53 .cse47) .cse52))) (or (not (= .cse47 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse48 0) (< .cse48 .cse6) (not (= .cse49 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (let ((.cse50 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (select .cse50 (select (select .cse50 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) (select (select .cse51 .cse47) .cse52)))))))) (forall ((v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1100 (Array Int Int)) (|ULTIMATE.start_main_~#s~0#1.base| Int)) (let ((.cse54 (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1100))) (let ((.cse55 (select (select (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1101) |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse56 (select (select .cse54 |ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (<= 0 (+ (select (select .cse54 .cse55) (+ .cse56 4)) 4)) (not (= .cse55 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= .cse56 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))) (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse60 (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5))) (let ((.cse59 (select (select .cse60 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse62 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse58 (select (select .cse62 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse61 (+ .cse59 4))) (let ((.cse57 (select (select .cse62 .cse58) .cse61))) (or (= .cse57 0) (not (= .cse58 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse59)) (< (select (select .cse60 .cse58) .cse61) .cse6) (= .cse57 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))) (forall ((v_prenex_6 Int) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse68 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse64 (select (select .cse68 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse67 (select (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse63 (select (select .cse68 .cse64) (+ .cse67 4)))) (or (= .cse63 0) (not (= .cse64 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse65 (select (let ((.cse66 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (select .cse66 (select (select .cse66 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (or (= .cse65 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse63 .cse65)))) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse67)) (= .cse63 |c_ULTIMATE.start_dll_create_~head~0#1.base|)))))) (forall ((v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (let ((.cse74 (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse73 (select (select .cse74 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse71 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse69 (select (select .cse71 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse72 (+ .cse73 4))) (let ((.cse70 (select (select .cse74 .cse69) .cse72))) (or (not (= .cse69 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= .cse70 0) (< .cse70 .cse6) (= (select (select .cse71 .cse69) .cse72) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse73 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)))))))) (forall ((v_prenex_6 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse76 (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2))) (let ((.cse79 (select (select .cse76 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse81 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (let ((.cse75 (select (select .cse81 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse77 (+ .cse79 4))) (let ((.cse78 (select (select .cse81 .cse75) .cse77))) (or (not (= .cse75 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= (select (select .cse76 .cse75) .cse77) 0) (= .cse78 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (not (= .cse79 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (= (select (let ((.cse80 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (select .cse80 (select (select .cse80 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)) .cse78))))))) (forall ((v_prenex_6 Int) (v_prenex_3 Int) (v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (let ((.cse86 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_4))) (let ((.cse83 (select (select .cse86 v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse84 (select (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_5) v_prenex_6) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse82 (select (select .cse86 .cse83) (+ .cse84 4)))) (or (= .cse82 0) (not (= .cse83 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| .cse84)) (= .cse82 (select (let ((.cse85 (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_1))) (select .cse85 (select (select .cse85 v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ (select (select (store .cse9 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_prenex_2) v_prenex_3) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (= .cse82 |c_ULTIMATE.start_dll_create_~head~0#1.base|))))))))) is different from false [2022-11-26 00:19:58,004 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:19:58,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 308 treesize of output 238 [2022-11-26 00:19:58,617 INFO L321 Elim1Store]: treesize reduction 325, result has 32.2 percent of original size [2022-11-26 00:19:58,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 11 new quantified variables, introduced 28 case distinctions, treesize of input 1054 treesize of output 1007 [2022-11-26 00:19:58,669 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:19:58,670 INFO L350 Elim1Store]: Elim1 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 787 treesize of output 409 [2022-11-26 00:19:58,999 INFO L321 Elim1Store]: treesize reduction 210, result has 39.5 percent of original size [2022-11-26 00:19:59,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 27 case distinctions, treesize of input 1244 treesize of output 1177 [2022-11-26 00:19:59,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 902 treesize of output 876 [2022-11-26 00:19:59,658 INFO L321 Elim1Store]: treesize reduction 134, result has 62.0 percent of original size [2022-11-26 00:19:59,659 INFO L350 Elim1Store]: Elim1 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 11 new quantified variables, introduced 36 case distinctions, treesize of input 1158 treesize of output 1192 [2022-11-26 00:19:59,934 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:19:59,935 INFO L350 Elim1Store]: Elim1 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 1000 treesize of output 964 [2022-11-26 00:20:00,239 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:20:00,240 INFO L350 Elim1Store]: Elim1 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 1497 treesize of output 1395 [2022-11-26 00:20:00,451 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:20:00,452 INFO L350 Elim1Store]: Elim1 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 1718 treesize of output 1620 [2022-11-26 00:20:40,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2022-11-26 00:20:41,307 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-26 00:20:41,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 1 [2022-11-26 00:20:43,369 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-11-26 00:20:43,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 126 treesize of output 1 [2022-11-26 00:20:44,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2022-11-26 00:20:46,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2022-11-26 00:20:48,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 74 [2022-11-26 00:20:51,924 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-26 00:20:52,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-26 00:20:52,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-26 00:20:52,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-26 00:20:52,704 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-26 00:20:52,861 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-26 00:20:53,525 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-26 00:20:54,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-26 00:20:55,471 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-26 00:20:55,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-26 00:20:56,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-26 00:20:57,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-26 00:20:57,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-26 00:20:57,768 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-26 00:20:57,810 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-26 00:20:57,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-26 00:20:58,366 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-26 00:20:58,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-26 00:21:17,689 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-26 00:21:17,776 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-26 00:21:17,898 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-26 00:21:20,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2022-11-26 00:21:22,387 WARN L207 Elim1Store]: Array PQE input equivalent to true [2022-11-26 00:21:26,082 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:21:26,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 177 [2022-11-26 00:23:29,145 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:23:29,157 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:23:29,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-26 00:23:30,259 INFO L321 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2022-11-26 00:23:30,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 176 treesize of output 172 [2022-11-26 00:23:30,579 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:23:30,592 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:23:30,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-26 00:23:31,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:23:31,043 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:23:31,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-26 00:23:31,176 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:23:31,190 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:23:31,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-26 00:23:31,382 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:23:31,396 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:23:31,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-26 00:23:32,709 INFO L321 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2022-11-26 00:23:32,709 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 309 treesize of output 281 [2022-11-26 00:23:33,245 INFO L321 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2022-11-26 00:23:33,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 231 treesize of output 215 [2022-11-26 00:23:33,667 INFO L321 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2022-11-26 00:23:33,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1768 treesize of output 1636 [2022-11-26 00:23:41,734 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:23:41,754 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:23:41,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-26 00:23:43,158 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:23:43,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:23:43,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-26 00:23:48,914 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:23:48,952 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:23:48,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-26 00:23:51,154 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:23:51,172 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:23:51,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-26 00:24:10,790 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:24:10,805 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:24:10,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-26 00:24:12,336 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:24:12,357 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:24:12,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-26 00:24:13,104 INFO L321 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2022-11-26 00:24:13,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 176 treesize of output 172 [2022-11-26 00:24:17,312 INFO L321 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2022-11-26 00:24:17,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 317 treesize of output 289 [2022-11-26 00:24:18,675 INFO L321 Elim1Store]: treesize reduction 9, result has 52.6 percent of original size [2022-11-26 00:24:18,676 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 765 treesize of output 681 [2022-11-26 00:24:28,791 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:24:28,811 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:24:28,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-26 00:24:29,070 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:24:29,136 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:24:29,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-26 00:24:34,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:24:34,765 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:24:34,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-26 00:24:38,267 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:24:38,292 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:24:38,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-26 00:24:40,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 00:24:40,615 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:24:40,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 67 [2022-11-26 00:24:44,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2022-11-26 00:24:56,558 WARN L233 SmtUtils]: Spent 10.96s on a formula simplification that was a NOOP. DAG size: 1251 (called from [L 318] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-11-26 00:24:56,560 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:24:56,562 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 25 select indices, 25 select index equivalence classes, 0 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 300 case distinctions, treesize of input 1047 treesize of output 3180