./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:23:29,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:23:29,942 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:23:29,996 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:23:29,997 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:23:30,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:23:30,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:23:30,006 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:23:30,011 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:23:30,016 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:23:30,017 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:23:30,019 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:23:30,020 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:23:30,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:23:30,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:23:30,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:23:30,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:23:30,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:23:30,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:23:30,037 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:23:30,038 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:23:30,040 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:23:30,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:23:30,045 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:23:30,053 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:23:30,054 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:23:30,054 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:23:30,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:23:30,057 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:23:30,058 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:23:30,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:23:30,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:23:30,063 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:23:30,064 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:23:30,066 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:23:30,066 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:23:30,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:23:30,068 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:23:30,068 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:23:30,069 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:23:30,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:23:30,070 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-02 20:23:30,113 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:23:30,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:23:30,114 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:23:30,114 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:23:30,115 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:23:30,116 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:23:30,116 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:23:30,117 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:23:30,117 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:23:30,117 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:23:30,118 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:23:30,118 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-02 20:23:30,119 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:23:30,119 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:23:30,119 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:23:30,119 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-02 20:23:30,119 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-02 20:23:30,120 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-02 20:23:30,120 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:23:30,120 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-02 20:23:30,120 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:23:30,120 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:23:30,121 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:23:30,121 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:23:30,121 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:23:30,121 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:23:30,122 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:23:30,122 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:23:30,122 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:23:30,122 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:23:30,122 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_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 [2022-11-02 20:23:30,417 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:23:30,440 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:23:30,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:23:30,444 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:23:30,445 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:23:30,446 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2022-11-02 20:23:30,522 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/data/66c94df8c/1bf444abd07447d5ac9ef7ea71991b7b/FLAGfed99426b [2022-11-02 20:23:31,067 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:23:31,069 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2022-11-02 20:23:31,085 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/data/66c94df8c/1bf444abd07447d5ac9ef7ea71991b7b/FLAGfed99426b [2022-11-02 20:23:31,336 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/data/66c94df8c/1bf444abd07447d5ac9ef7ea71991b7b [2022-11-02 20:23:31,340 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:23:31,342 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:23:31,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:23:31,346 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:23:31,349 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:23:31,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:23:31" (1/1) ... [2022-11-02 20:23:31,352 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45c761a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:31, skipping insertion in model container [2022-11-02 20:23:31,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:23:31" (1/1) ... [2022-11-02 20:23:31,377 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:23:31,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:23:31,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:23:31,871 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:23:31,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:23:31,960 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:23:31,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:31 WrapperNode [2022-11-02 20:23:31,961 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:23:31,962 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:23:31,962 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:23:31,962 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:23:31,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:31" (1/1) ... [2022-11-02 20:23:32,004 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:31" (1/1) ... [2022-11-02 20:23:32,044 INFO L138 Inliner]: procedures = 116, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 128 [2022-11-02 20:23:32,046 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:23:32,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:23:32,048 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:23:32,048 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:23:32,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:31" (1/1) ... [2022-11-02 20:23:32,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:31" (1/1) ... [2022-11-02 20:23:32,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:31" (1/1) ... [2022-11-02 20:23:32,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:31" (1/1) ... [2022-11-02 20:23:32,090 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:31" (1/1) ... [2022-11-02 20:23:32,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:31" (1/1) ... [2022-11-02 20:23:32,105 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:31" (1/1) ... [2022-11-02 20:23:32,107 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:31" (1/1) ... [2022-11-02 20:23:32,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:23:32,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:23:32,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:23:32,111 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:23:32,119 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:31" (1/1) ... [2022-11-02 20:23:32,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:23:32,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:23:32,146 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:23:32,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:23:32,194 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-11-02 20:23:32,194 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-11-02 20:23:32,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 20:23:32,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 20:23:32,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 20:23:32,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 20:23:32,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:23:32,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:23:32,298 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:23:32,301 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:23:32,339 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-11-02 20:23:32,806 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:23:32,815 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:23:32,824 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-02 20:23:32,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:23:32 BoogieIcfgContainer [2022-11-02 20:23:32,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:23:32,831 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:23:32,832 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:23:32,836 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:23:32,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:23:31" (1/3) ... [2022-11-02 20:23:32,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3417aa56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:23:32, skipping insertion in model container [2022-11-02 20:23:32,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:23:31" (2/3) ... [2022-11-02 20:23:32,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3417aa56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:23:32, skipping insertion in model container [2022-11-02 20:23:32,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:23:32" (3/3) ... [2022-11-02 20:23:32,840 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-1.i [2022-11-02 20:23:32,863 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:23:32,864 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2022-11-02 20:23:32,922 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:23:32,930 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;@330f9cfa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:23:32,930 INFO L358 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2022-11-02 20:23:32,935 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 137 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:32,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-02 20:23:32,942 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:32,943 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-02 20:23:32,944 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:23:32,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:32,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2022-11-02 20:23:32,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:32,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022579325] [2022-11-02 20:23:32,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:32,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:33,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:33,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:33,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022579325] [2022-11-02 20:23:33,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022579325] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:33,176 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:33,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:23:33,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182553933] [2022-11-02 20:23:33,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:33,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:23:33,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:33,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:23:33,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:23:33,215 INFO L87 Difference]: Start difference. First operand has 139 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 137 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 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-02 20:23:33,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:33,330 INFO L93 Difference]: Finished difference Result 136 states and 143 transitions. [2022-11-02 20:23:33,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:23:33,333 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-02 20:23:33,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:33,342 INFO L225 Difference]: With dead ends: 136 [2022-11-02 20:23:33,342 INFO L226 Difference]: Without dead ends: 130 [2022-11-02 20:23:33,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:23:33,347 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 50 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:33,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 175 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:23:33,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-02 20:23:33,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-11-02 20:23:33,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 71 states have (on average 1.9014084507042253) internal successors, (135), 129 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 135 transitions. [2022-11-02 20:23:33,389 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 135 transitions. Word has length 4 [2022-11-02 20:23:33,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:33,389 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 135 transitions. [2022-11-02 20:23:33,390 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-02 20:23:33,390 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 135 transitions. [2022-11-02 20:23:33,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-02 20:23:33,391 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:33,391 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-02 20:23:33,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:23:33,392 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:23:33,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:33,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2022-11-02 20:23:33,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:33,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766223764] [2022-11-02 20:23:33,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:33,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:33,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:33,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:33,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:33,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766223764] [2022-11-02 20:23:33,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766223764] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:33,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:33,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:23:33,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649007912] [2022-11-02 20:23:33,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:33,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:23:33,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:33,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:23:33,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:23:33,484 INFO L87 Difference]: Start difference. First operand 130 states and 135 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-02 20:23:33,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:33,522 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2022-11-02 20:23:33,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:23:33,523 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-02 20:23:33,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:33,524 INFO L225 Difference]: With dead ends: 127 [2022-11-02 20:23:33,525 INFO L226 Difference]: Without dead ends: 127 [2022-11-02 20:23:33,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:23:33,526 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 128 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:33,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 117 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:23:33,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-02 20:23:33,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-11-02 20:23:33,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.8591549295774648) internal successors, (132), 126 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2022-11-02 20:23:33,537 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 4 [2022-11-02 20:23:33,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:33,537 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2022-11-02 20:23:33,538 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-02 20:23:33,538 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2022-11-02 20:23:33,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:23:33,538 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:33,539 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:33,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:23:33,539 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:23:33,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:33,540 INFO L85 PathProgramCache]: Analyzing trace with hash 2065247192, now seen corresponding path program 1 times [2022-11-02 20:23:33,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:33,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691560593] [2022-11-02 20:23:33,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:33,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:33,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:33,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:33,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:33,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691560593] [2022-11-02 20:23:33,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691560593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:33,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:33,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-02 20:23:33,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345572792] [2022-11-02 20:23:33,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:33,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:23:33,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:33,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:23:33,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:23:33,674 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:33,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:33,687 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2022-11-02 20:23:33,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:23:33,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-02 20:23:33,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:33,689 INFO L225 Difference]: With dead ends: 136 [2022-11-02 20:23:33,690 INFO L226 Difference]: Without dead ends: 136 [2022-11-02 20:23:33,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:23:33,691 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 8 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:33,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 254 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:23:33,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-02 20:23:33,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2022-11-02 20:23:33,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 72 states have (on average 1.8472222222222223) internal successors, (133), 127 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:33,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2022-11-02 20:23:33,702 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 9 [2022-11-02 20:23:33,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:33,702 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2022-11-02 20:23:33,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:33,702 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2022-11-02 20:23:33,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:23:33,703 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:33,703 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:33,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:23:33,704 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:23:33,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:33,704 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2022-11-02 20:23:33,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:33,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122894650] [2022-11-02 20:23:33,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:33,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:33,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:33,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:33,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:33,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122894650] [2022-11-02 20:23:33,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122894650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:33,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:33,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:23:33,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203884258] [2022-11-02 20:23:33,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:33,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:23:33,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:33,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:23:33,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:23:33,823 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:33,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:33,918 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2022-11-02 20:23:33,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:23:33,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-02 20:23:33,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:33,923 INFO L225 Difference]: With dead ends: 127 [2022-11-02 20:23:33,923 INFO L226 Difference]: Without dead ends: 127 [2022-11-02 20:23:33,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:23:33,933 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 40 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:33,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 169 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:23:33,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-02 20:23:33,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-11-02 20:23:33,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 72 states have (on average 1.8333333333333333) internal successors, (132), 126 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:33,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2022-11-02 20:23:33,950 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 9 [2022-11-02 20:23:33,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:33,951 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2022-11-02 20:23:33,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:33,952 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2022-11-02 20:23:33,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-02 20:23:33,952 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:33,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:33,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:23:33,953 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:23:33,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:33,954 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2022-11-02 20:23:33,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:33,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933478910] [2022-11-02 20:23:33,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:33,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:34,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:34,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933478910] [2022-11-02 20:23:34,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933478910] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:34,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:34,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-02 20:23:34,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431143102] [2022-11-02 20:23:34,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:34,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:23:34,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:34,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:23:34,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:23:34,111 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:34,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:34,149 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2022-11-02 20:23:34,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:23:34,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-02 20:23:34,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:34,151 INFO L225 Difference]: With dead ends: 126 [2022-11-02 20:23:34,152 INFO L226 Difference]: Without dead ends: 126 [2022-11-02 20:23:34,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-02 20:23:34,153 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 122 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:34,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 121 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:23:34,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-02 20:23:34,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-11-02 20:23:34,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 72 states have (on average 1.8194444444444444) internal successors, (131), 125 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:34,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2022-11-02 20:23:34,168 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 9 [2022-11-02 20:23:34,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:34,168 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2022-11-02 20:23:34,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:34,169 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2022-11-02 20:23:34,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:23:34,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:34,170 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:34,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:23:34,175 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:23:34,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:34,175 INFO L85 PathProgramCache]: Analyzing trace with hash -401798830, now seen corresponding path program 1 times [2022-11-02 20:23:34,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:34,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471650484] [2022-11-02 20:23:34,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:34,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:34,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:34,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:34,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471650484] [2022-11-02 20:23:34,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471650484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:34,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:34,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-02 20:23:34,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986630724] [2022-11-02 20:23:34,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:34,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:23:34,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:34,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:23:34,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:23:34,362 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:34,492 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2022-11-02 20:23:34,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:23:34,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-02 20:23:34,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:34,494 INFO L225 Difference]: With dead ends: 130 [2022-11-02 20:23:34,494 INFO L226 Difference]: Without dead ends: 130 [2022-11-02 20:23:34,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:23:34,497 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 114 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:34,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 217 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:23:34,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-02 20:23:34,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-11-02 20:23:34,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.8) internal successors, (135), 128 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:34,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2022-11-02 20:23:34,520 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 10 [2022-11-02 20:23:34,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:34,520 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2022-11-02 20:23:34,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:34,521 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2022-11-02 20:23:34,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-02 20:23:34,522 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:34,523 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:34,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:23:34,523 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:23:34,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:34,525 INFO L85 PathProgramCache]: Analyzing trace with hash -401798829, now seen corresponding path program 1 times [2022-11-02 20:23:34,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:34,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839702685] [2022-11-02 20:23:34,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:34,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:34,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:34,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:34,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839702685] [2022-11-02 20:23:34,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839702685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:34,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:34,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:23:34,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104103739] [2022-11-02 20:23:34,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:34,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:23:34,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:34,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:23:34,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:23:34,663 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:34,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:34,778 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2022-11-02 20:23:34,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:23:34,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-02 20:23:34,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:34,779 INFO L225 Difference]: With dead ends: 130 [2022-11-02 20:23:34,779 INFO L226 Difference]: Without dead ends: 130 [2022-11-02 20:23:34,780 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:23:34,780 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 132 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:34,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 263 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:23:34,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-02 20:23:34,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-11-02 20:23:34,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.7866666666666666) internal successors, (134), 128 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:34,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2022-11-02 20:23:34,785 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 10 [2022-11-02 20:23:34,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:34,785 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2022-11-02 20:23:34,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:34,786 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2022-11-02 20:23:34,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-02 20:23:34,786 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:34,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:34,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:23:34,787 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:23:34,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:34,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1662359483, now seen corresponding path program 1 times [2022-11-02 20:23:34,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:34,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581768966] [2022-11-02 20:23:34,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:34,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:34,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:34,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:34,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:34,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581768966] [2022-11-02 20:23:34,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581768966] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:23:34,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228421262] [2022-11-02 20:23:34,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:34,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:23:34,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:23:34,854 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:23:34,870 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:23:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:34,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-02 20:23:34,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:23:35,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:35,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:23:35,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:35,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228421262] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:23:35,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:23:35,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-02 20:23:35,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178894620] [2022-11-02 20:23:35,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:23:35,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:23:35,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:35,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:23:35,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:23:35,036 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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-02 20:23:35,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:35,050 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2022-11-02 20:23:35,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:23:35,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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 14 [2022-11-02 20:23:35,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:35,052 INFO L225 Difference]: With dead ends: 131 [2022-11-02 20:23:35,052 INFO L226 Difference]: Without dead ends: 131 [2022-11-02 20:23:35,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:23:35,053 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 14 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:35,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 489 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:23:35,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-02 20:23:35,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-11-02 20:23:35,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 77 states have (on average 1.7662337662337662) internal successors, (136), 130 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:35,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2022-11-02 20:23:35,057 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 14 [2022-11-02 20:23:35,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:35,057 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2022-11-02 20:23:35,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 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-02 20:23:35,058 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2022-11-02 20:23:35,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:23:35,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:35,058 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:35,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:23:35,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:23:35,263 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:23:35,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:35,263 INFO L85 PathProgramCache]: Analyzing trace with hash 6511237, now seen corresponding path program 1 times [2022-11-02 20:23:35,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:35,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267176139] [2022-11-02 20:23:35,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:35,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:35,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:35,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:35,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267176139] [2022-11-02 20:23:35,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267176139] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:23:35,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950804827] [2022-11-02 20:23:35,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:35,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:23:35,381 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:23:35,383 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:23:35,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:23:35,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:35,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-02 20:23:35,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:23:35,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:23:35,577 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:23:35,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:23:35,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:35,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:23:35,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:35,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950804827] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:23:35,707 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:23:35,707 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-11-02 20:23:35,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60557617] [2022-11-02 20:23:35,707 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:23:35,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:23:35,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:35,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:23:35,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:23:35,708 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand has 7 states, 6 states have (on average 4.5) 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-02 20:23:35,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:35,758 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2022-11-02 20:23:35,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-02 20:23:35,758 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) 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 15 [2022-11-02 20:23:35,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:35,759 INFO L225 Difference]: With dead ends: 129 [2022-11-02 20:23:35,759 INFO L226 Difference]: Without dead ends: 129 [2022-11-02 20:23:35,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:23:35,760 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 138 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:35,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 278 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 69 Unchecked, 0.0s Time] [2022-11-02 20:23:35,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-11-02 20:23:35,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-11-02 20:23:35,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 128 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:35,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2022-11-02 20:23:35,764 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 15 [2022-11-02 20:23:35,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:35,764 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2022-11-02 20:23:35,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) 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-02 20:23:35,765 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2022-11-02 20:23:35,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-02 20:23:35,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:35,765 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:35,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:23:35,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-02 20:23:35,984 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:23:35,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:35,985 INFO L85 PathProgramCache]: Analyzing trace with hash 6511238, now seen corresponding path program 1 times [2022-11-02 20:23:35,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:35,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059475176] [2022-11-02 20:23:35,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:35,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:36,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:36,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:36,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059475176] [2022-11-02 20:23:36,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059475176] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:23:36,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010680027] [2022-11-02 20:23:36,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:36,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:23:36,242 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:23:36,243 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:23:36,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:23:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:36,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-02 20:23:36,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:23:36,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:23:36,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:23:36,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:23:36,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:23:36,485 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:23:36,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:23:36,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:36,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:23:40,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:40,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010680027] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:23:40,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:23:40,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-11-02 20:23:40,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843726841] [2022-11-02 20:23:40,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:23:40,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 20:23:40,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:40,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 20:23:40,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-11-02 20:23:40,910 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:41,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:41,215 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2022-11-02 20:23:41,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:23:41,216 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 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-02 20:23:41,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:41,216 INFO L225 Difference]: With dead ends: 127 [2022-11-02 20:23:41,217 INFO L226 Difference]: Without dead ends: 127 [2022-11-02 20:23:41,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-11-02 20:23:41,217 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 496 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:41,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 344 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 138 Invalid, 0 Unknown, 86 Unchecked, 0.1s Time] [2022-11-02 20:23:41,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-02 20:23:41,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-11-02 20:23:41,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.7142857142857142) internal successors, (132), 126 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:41,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2022-11-02 20:23:41,220 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 15 [2022-11-02 20:23:41,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:41,221 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2022-11-02 20:23:41,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:41,221 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2022-11-02 20:23:41,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:23:41,221 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:41,222 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:41,262 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:23:41,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:23:41,431 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:23:41,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:41,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520033, now seen corresponding path program 1 times [2022-11-02 20:23:41,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:41,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978662484] [2022-11-02 20:23:41,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:41,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:41,555 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-02 20:23:41,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:41,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978662484] [2022-11-02 20:23:41,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978662484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:41,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:41,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:23:41,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891511962] [2022-11-02 20:23:41,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:41,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:23:41,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:41,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:23:41,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:23:41,557 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 6 states, 5 states have (on average 4.0) 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-02 20:23:41,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:41,742 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2022-11-02 20:23:41,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:23:41,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) 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 22 [2022-11-02 20:23:41,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:41,743 INFO L225 Difference]: With dead ends: 124 [2022-11-02 20:23:41,743 INFO L226 Difference]: Without dead ends: 124 [2022-11-02 20:23:41,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:23:41,744 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 107 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:41,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 325 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:23:41,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-02 20:23:41,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-11-02 20:23:41,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 77 states have (on average 1.6753246753246753) internal successors, (129), 123 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:41,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2022-11-02 20:23:41,747 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 22 [2022-11-02 20:23:41,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:41,748 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2022-11-02 20:23:41,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) 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-02 20:23:41,748 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2022-11-02 20:23:41,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-02 20:23:41,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:41,749 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:41,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 20:23:41,749 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:23:41,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:41,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520034, now seen corresponding path program 1 times [2022-11-02 20:23:41,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:41,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082125138] [2022-11-02 20:23:41,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:41,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:41,916 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:23:41,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:41,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082125138] [2022-11-02 20:23:41,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082125138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:41,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:41,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:23:41,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243592134] [2022-11-02 20:23:41,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:41,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:23:41,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:41,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:23:41,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:23:41,919 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:42,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:42,061 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2022-11-02 20:23:42,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:23:42,061 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-11-02 20:23:42,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:42,062 INFO L225 Difference]: With dead ends: 117 [2022-11-02 20:23:42,062 INFO L226 Difference]: Without dead ends: 117 [2022-11-02 20:23:42,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:23:42,063 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 412 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:42,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 95 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:23:42,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-11-02 20:23:42,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-11-02 20:23:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 77 states have (on average 1.5844155844155845) internal successors, (122), 116 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2022-11-02 20:23:42,066 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 22 [2022-11-02 20:23:42,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:42,066 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2022-11-02 20:23:42,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:42,067 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2022-11-02 20:23:42,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:23:42,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:42,068 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:42,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 20:23:42,068 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:23:42,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:42,069 INFO L85 PathProgramCache]: Analyzing trace with hash 67241285, now seen corresponding path program 1 times [2022-11-02 20:23:42,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:42,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896771131] [2022-11-02 20:23:42,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:42,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:42,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:42,196 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:23:42,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:42,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896771131] [2022-11-02 20:23:42,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896771131] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:42,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:42,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:23:42,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027114604] [2022-11-02 20:23:42,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:42,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:23:42,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:42,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:23:42,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:23:42,198 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:42,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:42,326 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2022-11-02 20:23:42,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:23:42,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-02 20:23:42,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:42,328 INFO L225 Difference]: With dead ends: 112 [2022-11-02 20:23:42,328 INFO L226 Difference]: Without dead ends: 112 [2022-11-02 20:23:42,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:23:42,329 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 386 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:42,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 84 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:23:42,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-02 20:23:42,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-11-02 20:23:42,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 111 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:42,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2022-11-02 20:23:42,332 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 28 [2022-11-02 20:23:42,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:42,332 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2022-11-02 20:23:42,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:42,332 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2022-11-02 20:23:42,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:23:42,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:42,333 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:42,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:23:42,333 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:23:42,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:42,334 INFO L85 PathProgramCache]: Analyzing trace with hash 67280267, now seen corresponding path program 1 times [2022-11-02 20:23:42,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:42,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945499273] [2022-11-02 20:23:42,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:42,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:42,695 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:23:42,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:42,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945499273] [2022-11-02 20:23:42,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945499273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:42,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:42,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:23:42,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612138479] [2022-11-02 20:23:42,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:42,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:23:42,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:42,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:23:42,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:23:42,697 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:42,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:42,942 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2022-11-02 20:23:42,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:23:42,943 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-02 20:23:42,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:42,944 INFO L225 Difference]: With dead ends: 107 [2022-11-02 20:23:42,944 INFO L226 Difference]: Without dead ends: 107 [2022-11-02 20:23:42,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:23:42,945 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 548 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:42,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 162 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-02 20:23:42,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-02 20:23:42,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-11-02 20:23:42,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 106 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:42,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2022-11-02 20:23:42,948 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 28 [2022-11-02 20:23:42,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:42,948 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2022-11-02 20:23:42,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:42,948 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2022-11-02 20:23:42,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-02 20:23:42,949 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:42,949 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:42,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:23:42,949 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:23:42,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:42,950 INFO L85 PathProgramCache]: Analyzing trace with hash 67279051, now seen corresponding path program 1 times [2022-11-02 20:23:42,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:42,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751954384] [2022-11-02 20:23:42,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:42,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:43,514 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:43,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:43,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751954384] [2022-11-02 20:23:43,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751954384] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:23:43,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [606759403] [2022-11-02 20:23:43,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:43,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:23:43,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:23:43,517 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:23:43,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-02 20:23:43,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:43,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-02 20:23:43,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:23:43,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:23:43,855 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-02 20:23:43,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:23:43,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:23:43,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:23:44,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:23:44,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:23:44,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-02 20:23:44,264 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:23:44,265 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-11-02 20:23:44,273 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:44,273 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:23:44,317 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_465) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0)) is different from false [2022-11-02 20:23:44,329 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_465) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0)) is different from false [2022-11-02 20:23:44,336 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_464) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_465) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0)) is different from false [2022-11-02 20:23:44,347 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:23:44,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-11-02 20:23:44,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2022-11-02 20:23:44,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2022-11-02 20:23:44,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-11-02 20:23:44,648 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:23:44,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-02 20:23:44,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-02 20:23:44,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [606759403] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:23:44,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:23:44,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 35 [2022-11-02 20:23:44,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390710211] [2022-11-02 20:23:44,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:23:44,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-11-02 20:23:44,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:44,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-11-02 20:23:44,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=952, Unknown=3, NotChecked=192, Total=1260 [2022-11-02 20:23:44,658 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 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-02 20:23:45,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:45,891 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-11-02 20:23:45,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:23:45,892 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 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) Word has length 28 [2022-11-02 20:23:45,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:45,892 INFO L225 Difference]: With dead ends: 106 [2022-11-02 20:23:45,892 INFO L226 Difference]: Without dead ends: 106 [2022-11-02 20:23:45,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=369, Invalid=1896, Unknown=3, NotChecked=282, Total=2550 [2022-11-02 20:23:45,894 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 775 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 487 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:45,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 662 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 715 Invalid, 0 Unknown, 487 Unchecked, 0.5s Time] [2022-11-02 20:23:45,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-02 20:23:45,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2022-11-02 20:23:45,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 101 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:45,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2022-11-02 20:23:45,897 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 28 [2022-11-02 20:23:45,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:45,897 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2022-11-02 20:23:45,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 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-02 20:23:45,897 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2022-11-02 20:23:45,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:23:45,898 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:45,898 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:45,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-02 20:23:46,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-02 20:23:46,115 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:23:46,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:46,116 INFO L85 PathProgramCache]: Analyzing trace with hash 2085688457, now seen corresponding path program 1 times [2022-11-02 20:23:46,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:46,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980167] [2022-11-02 20:23:46,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:46,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:46,592 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:23:46,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:46,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980167] [2022-11-02 20:23:46,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980167] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:46,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:46,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:23:46,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110642413] [2022-11-02 20:23:46,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:46,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 20:23:46,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:46,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 20:23:46,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:23:46,594 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:46,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:46,983 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2022-11-02 20:23:46,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:23:46,983 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-02 20:23:46,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:46,984 INFO L225 Difference]: With dead ends: 97 [2022-11-02 20:23:46,984 INFO L226 Difference]: Without dead ends: 97 [2022-11-02 20:23:46,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:23:46,985 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 572 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:46,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 75 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-02 20:23:46,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-02 20:23:46,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-11-02 20:23:46,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 96 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:46,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2022-11-02 20:23:46,988 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 29 [2022-11-02 20:23:46,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:46,988 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2022-11-02 20:23:46,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:46,988 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2022-11-02 20:23:46,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-02 20:23:46,989 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:46,989 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:46,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:23:46,989 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:23:46,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:46,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2085650723, now seen corresponding path program 1 times [2022-11-02 20:23:46,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:46,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429422402] [2022-11-02 20:23:46,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:46,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:47,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:47,567 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:47,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:47,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429422402] [2022-11-02 20:23:47,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429422402] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:23:47,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084403222] [2022-11-02 20:23:47,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:47,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:23:47,568 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:23:47,569 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:23:47,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-02 20:23:47,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:47,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 46 conjunts are in the unsatisfiable core [2022-11-02 20:23:47,716 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:23:47,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:23:47,787 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-02 20:23:47,787 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:23:47,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:23:47,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-02 20:23:48,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2022-11-02 20:23:48,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:23:48,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 40 [2022-11-02 20:23:48,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2022-11-02 20:23:48,331 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:48,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:23:48,412 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_587 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-11-02 20:23:48,423 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_587 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-11-02 20:23:48,432 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-11-02 20:23:48,444 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:23:48,445 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-11-02 20:23:48,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 60 [2022-11-02 20:23:48,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-11-02 20:23:48,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2022-11-02 20:23:48,780 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:23:48,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-11-02 20:23:48,786 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-02 20:23:48,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084403222] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:23:48,787 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:23:48,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-11-02 20:23:48,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224722517] [2022-11-02 20:23:48,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:23:48,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-02 20:23:48,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:48,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-02 20:23:48,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=581, Unknown=3, NotChecked=150, Total=812 [2022-11-02 20:23:48,789 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 29 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:50,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:50,083 INFO L93 Difference]: Finished difference Result 179 states and 189 transitions. [2022-11-02 20:23:50,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:23:50,084 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-11-02 20:23:50,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:50,085 INFO L225 Difference]: With dead ends: 179 [2022-11-02 20:23:50,085 INFO L226 Difference]: Without dead ends: 179 [2022-11-02 20:23:50,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=168, Invalid=963, Unknown=3, NotChecked=198, Total=1332 [2022-11-02 20:23:50,086 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 569 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 569 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:50,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 686 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 739 Invalid, 0 Unknown, 569 Unchecked, 0.7s Time] [2022-11-02 20:23:50,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-11-02 20:23:50,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 136. [2022-11-02 20:23:50,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 135 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:50,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2022-11-02 20:23:50,090 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 29 [2022-11-02 20:23:50,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:50,090 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2022-11-02 20:23:50,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 29 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:50,090 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2022-11-02 20:23:50,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:23:50,091 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:50,091 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:50,133 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-02 20:23:50,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-02 20:23:50,292 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:23:50,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:50,292 INFO L85 PathProgramCache]: Analyzing trace with hash 231832909, now seen corresponding path program 1 times [2022-11-02 20:23:50,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:50,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940458957] [2022-11-02 20:23:50,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:50,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:50,689 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-02 20:23:50,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:50,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940458957] [2022-11-02 20:23:50,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940458957] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:23:50,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:23:50,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 20:23:50,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532067351] [2022-11-02 20:23:50,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:23:50,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 20:23:50,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:50,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 20:23:50,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-02 20:23:50,691 INFO L87 Difference]: Start difference. First operand 136 states and 149 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:51,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:51,101 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2022-11-02 20:23:51,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:23:51,102 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-02 20:23:51,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:51,102 INFO L225 Difference]: With dead ends: 135 [2022-11-02 20:23:51,103 INFO L226 Difference]: Without dead ends: 135 [2022-11-02 20:23:51,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2022-11-02 20:23:51,103 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 305 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:51,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 312 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-02 20:23:51,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-11-02 20:23:51,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-11-02 20:23:51,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 116 states have (on average 1.2672413793103448) internal successors, (147), 134 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:51,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2022-11-02 20:23:51,107 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 30 [2022-11-02 20:23:51,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:51,107 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2022-11-02 20:23:51,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:51,107 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2022-11-02 20:23:51,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-02 20:23:51,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:51,108 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:51,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:23:51,108 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:23:51,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:51,109 INFO L85 PathProgramCache]: Analyzing trace with hash 230663117, now seen corresponding path program 1 times [2022-11-02 20:23:51,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:51,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998229051] [2022-11-02 20:23:51,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:51,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:51,564 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:51,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:51,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998229051] [2022-11-02 20:23:51,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998229051] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:23:51,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711895810] [2022-11-02 20:23:51,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:51,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:23:51,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:23:51,567 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:23:51,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-02 20:23:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:51,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-02 20:23:51,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:23:51,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:23:51,747 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:23:51,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:23:51,785 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-02 20:23:51,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:23:51,805 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:23:51,829 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:23:51,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-02 20:23:51,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-11-02 20:23:51,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:23:51,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-02 20:23:52,131 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:23:52,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2022-11-02 20:23:52,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:52,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:23:52,309 INFO L356 Elim1Store]: treesize reduction 18, result has 60.0 percent of original size [2022-11-02 20:23:52,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2022-11-02 20:23:52,323 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_710 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_709) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_710) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0)))) is different from false [2022-11-02 20:23:52,335 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:23:52,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 35 [2022-11-02 20:23:52,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 235 treesize of output 215 [2022-11-02 20:23:52,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 187 [2022-11-02 20:23:52,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 171 [2022-11-02 20:23:52,667 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-02 20:23:52,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711895810] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:23:52,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:23:52,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 28 [2022-11-02 20:23:52,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388316188] [2022-11-02 20:23:52,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:23:52,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-02 20:23:52,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:52,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-02 20:23:52,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=673, Unknown=2, NotChecked=52, Total=812 [2022-11-02 20:23:52,670 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 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-02 20:23:53,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:53,760 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2022-11-02 20:23:53,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-02 20:23:53,760 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 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) Word has length 30 [2022-11-02 20:23:53,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:53,761 INFO L225 Difference]: With dead ends: 134 [2022-11-02 20:23:53,762 INFO L226 Difference]: Without dead ends: 134 [2022-11-02 20:23:53,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=314, Invalid=1248, Unknown=2, NotChecked=76, Total=1640 [2022-11-02 20:23:53,763 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 225 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 725 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:53,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 725 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 598 Invalid, 0 Unknown, 154 Unchecked, 0.4s Time] [2022-11-02 20:23:53,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-11-02 20:23:53,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-11-02 20:23:53,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 116 states have (on average 1.2586206896551724) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:53,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2022-11-02 20:23:53,767 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 30 [2022-11-02 20:23:53,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:53,767 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2022-11-02 20:23:53,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 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-02 20:23:53,768 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2022-11-02 20:23:53,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:23:53,769 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:53,769 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:53,797 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-02 20:23:53,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:23:53,983 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:23:53,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:53,983 INFO L85 PathProgramCache]: Analyzing trace with hash 823875782, now seen corresponding path program 1 times [2022-11-02 20:23:53,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:53,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916531098] [2022-11-02 20:23:53,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:53,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:54,501 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:54,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:54,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916531098] [2022-11-02 20:23:54,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916531098] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:23:54,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6975587] [2022-11-02 20:23:54,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:54,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:23:54,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:23:54,507 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:23:54,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-02 20:23:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:54,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-02 20:23:54,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:23:54,697 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:23:54,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:23:54,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:23:54,869 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:23:54,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 21 [2022-11-02 20:23:55,112 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:23:55,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:23:55,121 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:55,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:23:55,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-11-02 20:23:55,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-02 20:23:55,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-11-02 20:23:55,346 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:23:55,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-02 20:23:55,408 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:23:55,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-02 20:23:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:55,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6975587] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:23:55,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:23:55,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 28 [2022-11-02 20:23:55,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860855782] [2022-11-02 20:23:55,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:23:55,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-11-02 20:23:55,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:23:55,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-11-02 20:23:55,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2022-11-02 20:23:55,418 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:56,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:23:56,125 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2022-11-02 20:23:56,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:23:56,130 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-11-02 20:23:56,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:23:56,130 INFO L225 Difference]: With dead ends: 133 [2022-11-02 20:23:56,131 INFO L226 Difference]: Without dead ends: 133 [2022-11-02 20:23:56,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=256, Invalid=1226, Unknown=0, NotChecked=0, Total=1482 [2022-11-02 20:23:56,136 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 463 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:23:56,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 487 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 507 Invalid, 0 Unknown, 120 Unchecked, 0.4s Time] [2022-11-02 20:23:56,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-11-02 20:23:56,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-11-02 20:23:56,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 116 states have (on average 1.2413793103448276) internal successors, (144), 132 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:56,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2022-11-02 20:23:56,146 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 33 [2022-11-02 20:23:56,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:23:56,147 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2022-11-02 20:23:56,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:23:56,148 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2022-11-02 20:23:56,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-02 20:23:56,153 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:23:56,153 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:23:56,186 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-02 20:23:56,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:23:56,367 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:23:56,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:23:56,367 INFO L85 PathProgramCache]: Analyzing trace with hash 823444806, now seen corresponding path program 1 times [2022-11-02 20:23:56,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:23:56,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448162812] [2022-11-02 20:23:56,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:56,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:23:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:56,957 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:56,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:23:56,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448162812] [2022-11-02 20:23:56,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448162812] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:23:56,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123380542] [2022-11-02 20:23:56,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:23:56,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:23:56,958 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:23:56,958 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:23:56,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-02 20:23:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:23:57,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-02 20:23:57,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:23:57,124 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:23:57,159 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:23:57,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:23:57,240 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-02 20:23:57,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:23:57,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:23:57,282 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:23:57,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-11-02 20:23:57,341 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-11-02 20:23:57,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:23:57,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-11-02 20:23:57,493 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:23:57,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2022-11-02 20:23:57,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:23:57,673 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:23:57,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:24:00,038 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_881) 0)) 1)) (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) is different from false [2022-11-02 20:24:00,075 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0)) 1)) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|)))) (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|))))) is different from false [2022-11-02 20:24:00,097 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:24:00,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 61 [2022-11-02 20:24:00,156 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_881 Int) (v_ArrVal_879 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int) (v_ArrVal_880 (Array Int Int))) (or (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_879) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|)))) (forall ((v_prenex_3 Int) (v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_4 (Array Int Int))) (or (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ v_prenex_3 4) v_prenex_1) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_3))))) is different from false [2022-11-02 20:24:00,170 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:24:00,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-02 20:24:00,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 165 [2022-11-02 20:24:00,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 202 [2022-11-02 20:24:00,194 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:24:00,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 235 treesize of output 237 [2022-11-02 20:24:00,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 250 treesize of output 246 [2022-11-02 20:24:00,257 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:24:00,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2022-11-02 20:24:00,297 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-02 20:24:00,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123380542] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:24:00,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:24:00,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2022-11-02 20:24:00,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629164704] [2022-11-02 20:24:00,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:24:00,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-02 20:24:00,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:00,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-02 20:24:00,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=793, Unknown=3, NotChecked=174, Total=1056 [2022-11-02 20:24:00,300 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 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-02 20:24:04,945 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0)) 1)) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|)))) (= (select |c_#valid| .cse0) 1) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|)))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-11-02 20:24:20,221 WARN L234 SmtUtils]: Spent 15.12s on a formula simplification. DAG size of input: 74 DAG size of output: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:24:20,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:20,996 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2022-11-02 20:24:20,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-02 20:24:20,997 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 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) Word has length 33 [2022-11-02 20:24:20,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:20,997 INFO L225 Difference]: With dead ends: 132 [2022-11-02 20:24:20,998 INFO L226 Difference]: Without dead ends: 132 [2022-11-02 20:24:20,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=255, Invalid=1397, Unknown=4, NotChecked=324, Total=1980 [2022-11-02 20:24:20,999 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 204 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 233 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:20,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 861 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 812 Invalid, 0 Unknown, 233 Unchecked, 0.5s Time] [2022-11-02 20:24:21,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-02 20:24:21,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-11-02 20:24:21,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 116 states have (on average 1.2327586206896552) internal successors, (143), 131 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:21,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2022-11-02 20:24:21,003 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 33 [2022-11-02 20:24:21,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:21,003 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2022-11-02 20:24:21,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 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-02 20:24:21,004 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2022-11-02 20:24:21,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:24:21,004 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:21,004 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:21,029 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-02 20:24:21,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:24:21,211 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:24:21,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:21,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1553624943, now seen corresponding path program 1 times [2022-11-02 20:24:21,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:21,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130456057] [2022-11-02 20:24:21,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:21,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:22,095 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:22,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:22,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130456057] [2022-11-02 20:24:22,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130456057] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:24:22,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519966643] [2022-11-02 20:24:22,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:22,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:24:22,096 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:24:22,097 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:24:22,098 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-02 20:24:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:22,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 62 conjunts are in the unsatisfiable core [2022-11-02 20:24:22,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:24:22,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:24:22,297 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:24:22,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:24:22,453 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-02 20:24:22,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:24:22,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:24:22,565 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:24:22,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-02 20:24:22,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-02 20:24:22,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:24:22,699 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2022-11-02 20:24:22,972 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:24:22,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 24 [2022-11-02 20:24:23,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:24:23,008 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:23,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:24:23,308 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_968 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_968 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1))) is different from false [2022-11-02 20:24:23,326 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_968 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_ArrVal_968 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1))) is different from false [2022-11-02 20:24:23,338 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:24:23,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 41 [2022-11-02 20:24:23,362 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_968 (Array Int Int)) (v_ArrVal_967 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_967) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_5) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) is different from false [2022-11-02 20:24:23,370 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:24:23,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-02 20:24:23,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2022-11-02 20:24:23,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-02 20:24:23,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-02 20:24:23,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-02 20:24:23,403 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:24:23,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2022-11-02 20:24:23,839 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-02 20:24:23,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519966643] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:24:23,840 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:24:23,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 19] total 50 [2022-11-02 20:24:23,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394258053] [2022-11-02 20:24:23,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:24:23,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-02 20:24:23,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:23,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-02 20:24:23,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2070, Unknown=3, NotChecked=282, Total=2550 [2022-11-02 20:24:23,842 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 51 states, 50 states have (on average 1.6) internal successors, (80), 51 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-02 20:24:26,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:26,304 INFO L93 Difference]: Finished difference Result 167 states and 177 transitions. [2022-11-02 20:24:26,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-11-02 20:24:26,307 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.6) internal successors, (80), 51 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-02 20:24:26,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:26,308 INFO L225 Difference]: With dead ends: 167 [2022-11-02 20:24:26,308 INFO L226 Difference]: Without dead ends: 167 [2022-11-02 20:24:26,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1818 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=609, Invalid=5554, Unknown=11, NotChecked=468, Total=6642 [2022-11-02 20:24:26,310 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 393 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 1652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 557 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:26,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 901 Invalid, 1652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1029 Invalid, 0 Unknown, 557 Unchecked, 0.7s Time] [2022-11-02 20:24:26,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-11-02 20:24:26,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 131. [2022-11-02 20:24:26,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 116 states have (on average 1.2241379310344827) internal successors, (142), 130 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:26,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2022-11-02 20:24:26,316 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 34 [2022-11-02 20:24:26,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:26,317 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2022-11-02 20:24:26,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.6) internal successors, (80), 51 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-02 20:24:26,317 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2022-11-02 20:24:26,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:24:26,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:26,318 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:26,355 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-02 20:24:26,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:24:26,529 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:24:26,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:26,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1554055919, now seen corresponding path program 1 times [2022-11-02 20:24:26,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:26,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882347707] [2022-11-02 20:24:26,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:26,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:27,099 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:27,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:27,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882347707] [2022-11-02 20:24:27,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882347707] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:24:27,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788867783] [2022-11-02 20:24:27,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:27,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:24:27,100 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:24:27,101 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:24:27,104 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-02 20:24:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:27,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 34 conjunts are in the unsatisfiable core [2022-11-02 20:24:27,254 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:24:27,295 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-02 20:24:27,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-02 20:24:27,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:24:27,419 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:24:27,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 16 [2022-11-02 20:24:27,587 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:24:27,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-02 20:24:27,638 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:27,639 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:24:27,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2022-11-02 20:24:27,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-11-02 20:24:27,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-02 20:24:27,899 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-02 20:24:27,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-11-02 20:24:27,905 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:27,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788867783] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:24:27,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:24:27,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 30 [2022-11-02 20:24:27,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726607423] [2022-11-02 20:24:27,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:24:27,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-02 20:24:27,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:27,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-02 20:24:27,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2022-11-02 20:24:27,907 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 31 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-02 20:24:28,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:28,533 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2022-11-02 20:24:28,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-02 20:24:28,533 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 31 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) Word has length 34 [2022-11-02 20:24:28,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:28,534 INFO L225 Difference]: With dead ends: 130 [2022-11-02 20:24:28,534 INFO L226 Difference]: Without dead ends: 130 [2022-11-02 20:24:28,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 357 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640 [2022-11-02 20:24:28,535 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 637 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:28,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 450 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 406 Invalid, 0 Unknown, 167 Unchecked, 0.3s Time] [2022-11-02 20:24:28,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-11-02 20:24:28,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-11-02 20:24:28,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 116 states have (on average 1.206896551724138) internal successors, (140), 129 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:28,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2022-11-02 20:24:28,538 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 34 [2022-11-02 20:24:28,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:28,539 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2022-11-02 20:24:28,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 31 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-02 20:24:28,539 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2022-11-02 20:24:28,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:24:28,540 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:28,540 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:28,568 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-11-02 20:24:28,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:24:28,755 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:24:28,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:28,755 INFO L85 PathProgramCache]: Analyzing trace with hash 449486225, now seen corresponding path program 1 times [2022-11-02 20:24:28,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:28,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112140926] [2022-11-02 20:24:28,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:28,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:28,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:29,555 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:29,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:29,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112140926] [2022-11-02 20:24:29,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112140926] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:24:29,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124486014] [2022-11-02 20:24:29,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:29,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:24:29,555 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:24:29,563 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:24:29,582 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-02 20:24:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:29,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-02 20:24:29,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:24:29,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:24:29,754 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:24:29,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:24:29,855 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-02 20:24:29,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:24:29,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:24:29,956 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:24:29,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-02 20:24:30,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-02 20:24:30,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:24:30,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2022-11-02 20:24:30,355 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:24:30,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 24 [2022-11-02 20:24:30,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:24:30,394 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:30,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:24:30,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-02 20:24:30,668 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1137 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1137) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2022-11-02 20:24:30,683 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1137 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1137) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2022-11-02 20:24:30,688 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1137 (Array Int Int)) (v_ArrVal_1136 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1136) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1137) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2022-11-02 20:24:30,693 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:24:30,694 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-11-02 20:24:30,696 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2022-11-02 20:24:30,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-02 20:24:30,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-02 20:24:30,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-02 20:24:30,987 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-02 20:24:30,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124486014] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:24:30,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:24:30,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 47 [2022-11-02 20:24:30,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763765461] [2022-11-02 20:24:30,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:24:30,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-11-02 20:24:30,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:30,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-11-02 20:24:30,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1817, Unknown=3, NotChecked=264, Total=2256 [2022-11-02 20:24:30,990 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand has 48 states, 47 states have (on average 1.702127659574468) internal successors, (80), 48 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:32,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:32,947 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2022-11-02 20:24:32,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-02 20:24:32,948 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.702127659574468) internal successors, (80), 48 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-11-02 20:24:32,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:32,949 INFO L225 Difference]: With dead ends: 127 [2022-11-02 20:24:32,949 INFO L226 Difference]: Without dead ends: 127 [2022-11-02 20:24:32,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 971 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=550, Invalid=3240, Unknown=4, NotChecked=366, Total=4160 [2022-11-02 20:24:32,950 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 539 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 342 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:32,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 656 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 987 Invalid, 0 Unknown, 342 Unchecked, 0.7s Time] [2022-11-02 20:24:32,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-02 20:24:32,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-11-02 20:24:32,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 116 states have (on average 1.1810344827586208) internal successors, (137), 126 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:32,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2022-11-02 20:24:32,954 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 34 [2022-11-02 20:24:32,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:32,954 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2022-11-02 20:24:32,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.702127659574468) internal successors, (80), 48 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:32,955 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2022-11-02 20:24:32,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:24:32,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:32,955 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:32,995 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-02 20:24:33,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-11-02 20:24:33,179 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:24:33,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:33,179 INFO L85 PathProgramCache]: Analyzing trace with hash 449055249, now seen corresponding path program 1 times [2022-11-02 20:24:33,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:33,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386343622] [2022-11-02 20:24:33,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:33,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:33,734 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:33,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:33,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386343622] [2022-11-02 20:24:33,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386343622] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:24:33,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189023985] [2022-11-02 20:24:33,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:33,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:24:33,735 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:24:33,737 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:24:33,738 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-02 20:24:33,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:33,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-02 20:24:33,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:24:33,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:24:33,914 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:24:33,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:24:33,943 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-02 20:24:33,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:24:33,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:24:34,029 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:24:34,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-02 20:24:34,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-02 20:24:34,112 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-11-02 20:24:34,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 27 [2022-11-02 20:24:34,226 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:24:34,227 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2022-11-02 20:24:34,370 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:24:34,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-02 20:24:34,423 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:34,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:24:34,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-02 20:24:35,071 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) is different from false [2022-11-02 20:24:35,077 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) is different from false [2022-11-02 20:24:35,087 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) is different from false [2022-11-02 20:24:35,093 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int)) (v_ArrVal_1223 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1223) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-11-02 20:24:35,101 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:24:35,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-02 20:24:35,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 81 [2022-11-02 20:24:35,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 96 [2022-11-02 20:24:35,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 107 [2022-11-02 20:24:35,133 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:24:35,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 131 [2022-11-02 20:24:35,292 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-02 20:24:35,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189023985] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:24:35,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:24:35,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 37 [2022-11-02 20:24:35,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576307115] [2022-11-02 20:24:35,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:24:35,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-11-02 20:24:35,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:35,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-11-02 20:24:35,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1018, Unknown=4, NotChecked=268, Total=1406 [2022-11-02 20:24:35,295 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 38 states, 37 states have (on average 2.4324324324324325) internal successors, (90), 38 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:35,928 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int)) (v_ArrVal_1223 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1223) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-11-02 20:24:36,404 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-11-02 20:24:36,871 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (not (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) is different from false [2022-11-02 20:24:37,355 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-11-02 20:24:37,818 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (not (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) is different from false [2022-11-02 20:24:38,229 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (not (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store .cse0 (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))))) is different from false [2022-11-02 20:24:38,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:38,812 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2022-11-02 20:24:38,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-02 20:24:38,812 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.4324324324324325) internal successors, (90), 38 states have internal predecessors, (90), 0 states have call successors, (0), 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 34 [2022-11-02 20:24:38,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:38,813 INFO L225 Difference]: With dead ends: 158 [2022-11-02 20:24:38,813 INFO L226 Difference]: Without dead ends: 158 [2022-11-02 20:24:38,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=267, Invalid=1833, Unknown=10, NotChecked=970, Total=3080 [2022-11-02 20:24:38,815 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 255 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 487 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:38,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 963 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 447 Invalid, 0 Unknown, 487 Unchecked, 0.3s Time] [2022-11-02 20:24:38,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-02 20:24:38,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 132. [2022-11-02 20:24:38,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 121 states have (on average 1.1818181818181819) internal successors, (143), 131 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:38,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2022-11-02 20:24:38,819 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 34 [2022-11-02 20:24:38,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:38,819 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2022-11-02 20:24:38,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.4324324324324325) internal successors, (90), 38 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:38,820 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2022-11-02 20:24:38,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-02 20:24:38,820 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:38,820 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:38,869 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-02 20:24:39,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-02 20:24:39,031 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:24:39,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:39,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1035188976, now seen corresponding path program 2 times [2022-11-02 20:24:39,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:39,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500489355] [2022-11-02 20:24:39,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:39,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:39,109 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:39,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:39,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500489355] [2022-11-02 20:24:39,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500489355] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:24:39,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832925035] [2022-11-02 20:24:39,110 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-02 20:24:39,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:24:39,111 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:24:39,112 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:24:39,137 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-02 20:24:39,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-02 20:24:39,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-02 20:24:39,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-02 20:24:39,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:24:39,304 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:39,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:24:39,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832925035] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:24:39,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:24:39,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-11-02 20:24:39,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181879973] [2022-11-02 20:24:39,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:24:39,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:24:39,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:39,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:24:39,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:24:39,306 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:39,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:39,316 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-11-02 20:24:39,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-02 20:24:39,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-11-02 20:24:39,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:39,318 INFO L225 Difference]: With dead ends: 82 [2022-11-02 20:24:39,318 INFO L226 Difference]: Without dead ends: 82 [2022-11-02 20:24:39,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:24:39,318 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 70 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:39,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 100 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:24:39,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-11-02 20:24:39,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-11-02 20:24:39,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 81 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2022-11-02 20:24:39,321 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 34 [2022-11-02 20:24:39,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:39,322 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2022-11-02 20:24:39,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:39,322 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2022-11-02 20:24:39,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-02 20:24:39,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:39,323 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:39,346 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-02 20:24:39,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-02 20:24:39,527 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:24:39,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:39,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1654547908, now seen corresponding path program 1 times [2022-11-02 20:24:39,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:39,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555931604] [2022-11-02 20:24:39,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:39,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:40,488 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:40,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:40,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555931604] [2022-11-02 20:24:40,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555931604] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:24:40,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190902151] [2022-11-02 20:24:40,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:40,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:24:40,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:24:40,490 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:24:40,491 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-02 20:24:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:40,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 55 conjunts are in the unsatisfiable core [2022-11-02 20:24:40,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:24:40,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:24:40,671 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-02 20:24:40,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-02 20:24:40,769 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-02 20:24:40,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:24:40,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:24:40,884 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:24:40,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-11-02 20:24:41,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-02 20:24:41,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-11-02 20:24:41,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:24:41,360 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:24:41,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 53 [2022-11-02 20:24:41,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 22 [2022-11-02 20:24:42,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-11-02 20:24:42,047 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:42,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:24:44,088 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (and (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (= (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (= (select |c_#valid| (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) 1) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))))) is different from false [2022-11-02 20:24:49,235 INFO L356 Elim1Store]: treesize reduction 8, result has 85.5 percent of original size [2022-11-02 20:24:49,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 116 treesize of output 141 [2022-11-02 20:24:49,358 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_prenex_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 (Array Int Int))) (let ((.cse0 (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) v_prenex_12))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (<= v_prenex_12 0)) (not (<= 0 v_prenex_12))))) (forall ((v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1409 (Array Int Int)) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1409) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1410) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (or (not (let ((.cse2 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse2 (+ v_prenex_9 4)) (select .cse2 v_prenex_9)))) (not (<= v_prenex_9 0)) (not (<= 0 v_prenex_9)))) (or (forall ((v_prenex_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 (Array Int Int))) (let ((.cse3 (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) v_prenex_12))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3) (= .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (or (not (let ((.cse4 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse4 (+ v_prenex_9 4)) (select .cse4 v_prenex_9)))) (not (<= v_prenex_9 0)) (not (<= 0 v_prenex_9))))))) is different from false [2022-11-02 20:24:49,388 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:24:49,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 81 [2022-11-02 20:24:49,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 553 treesize of output 535 [2022-11-02 20:24:49,439 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:24:49,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 649 treesize of output 659 [2022-11-02 20:24:49,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 344 treesize of output 320 [2022-11-02 20:24:49,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 442 treesize of output 394 [2022-11-02 20:24:49,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 397 treesize of output 381 [2022-11-02 20:24:49,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 209 treesize of output 201 [2022-11-02 20:24:50,876 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:24:50,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 1 [2022-11-02 20:24:50,882 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:24:50,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 1 [2022-11-02 20:24:50,899 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-02 20:24:50,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 1 [2022-11-02 20:24:51,208 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-02 20:24:51,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190902151] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:24:51,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:24:51,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 19] total 54 [2022-11-02 20:24:51,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086585] [2022-11-02 20:24:51,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:24:51,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-11-02 20:24:51,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:51,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-11-02 20:24:51,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2570, Unknown=3, NotChecked=206, Total=2970 [2022-11-02 20:24:51,211 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 55 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 55 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:52,769 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_prenex_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 (Array Int Int))) (let ((.cse0 (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) v_prenex_12))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (<= v_prenex_12 0)) (not (<= 0 v_prenex_12))))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (forall ((v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1409 (Array Int Int)) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1409) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1410) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int)) (v_prenex_9 Int)) (or (not (let ((.cse2 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse2 (+ v_prenex_9 4)) (select .cse2 v_prenex_9)))) (not (<= v_prenex_9 0)) (not (<= 0 v_prenex_9)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (or (forall ((v_prenex_10 (Array Int Int)) (v_prenex_12 Int) (v_prenex_11 (Array Int Int))) (let ((.cse3 (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) v_prenex_12))) (or (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse3) (= .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 Int) (v_prenex_7 (Array Int Int))) (or (not (let ((.cse4 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse4 (+ v_prenex_9 4)) (select .cse4 v_prenex_9)))) (not (<= v_prenex_9 0)) (not (<= 0 v_prenex_9))))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-11-02 20:24:54,012 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse1 (store .cse2 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse0 (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) (= (select |c_#valid| .cse0) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (= (select .cse1 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) (select .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (= (select |c_#valid| (select .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) 1) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2022-11-02 20:24:55,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:24:55,455 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-11-02 20:24:55,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:24:55,456 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 55 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-02 20:24:55,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:24:55,457 INFO L225 Difference]: With dead ends: 80 [2022-11-02 20:24:55,457 INFO L226 Difference]: Without dead ends: 80 [2022-11-02 20:24:55,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=391, Invalid=4042, Unknown=5, NotChecked=532, Total=4970 [2022-11-02 20:24:55,459 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 220 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 449 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:24:55,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 728 Invalid, 1467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 970 Invalid, 0 Unknown, 449 Unchecked, 0.6s Time] [2022-11-02 20:24:55,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-11-02 20:24:55,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-11-02 20:24:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 79 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-02 20:24:55,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-11-02 20:24:55,462 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 36 [2022-11-02 20:24:55,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:24:55,462 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-11-02 20:24:55,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 55 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:24:55,462 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-11-02 20:24:55,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-02 20:24:55,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:24:55,463 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:24:55,491 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-02 20:24:55,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:24:55,664 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:24:55,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:24:55,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1472889600, now seen corresponding path program 1 times [2022-11-02 20:24:55,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:24:55,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121084108] [2022-11-02 20:24:55,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:55,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:24:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:56,510 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:56,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:24:56,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121084108] [2022-11-02 20:24:56,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121084108] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:24:56,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717238332] [2022-11-02 20:24:56,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:24:56,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:24:56,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:24:56,513 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:24:56,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-02 20:24:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:24:56,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 53 conjunts are in the unsatisfiable core [2022-11-02 20:24:56,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:24:56,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-02 20:24:56,691 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:24:56,692 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-11-02 20:24:56,759 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-02 20:24:56,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-02 20:24:56,798 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:24:56,843 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:24:56,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-02 20:24:56,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-11-02 20:24:56,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-11-02 20:24:57,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:24:57,118 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:24:57,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 39 [2022-11-02 20:24:57,405 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:24:57,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-02 20:24:57,612 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-02 20:24:57,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 42 [2022-11-02 20:24:57,696 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:24:57,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:24:58,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 74 [2022-11-02 20:24:58,125 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1502 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)))) (forall ((v_ArrVal_1502 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))))) is different from false [2022-11-02 20:24:58,140 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1502 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1502 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2022-11-02 20:24:58,157 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1502 (Array Int Int)) (v_ArrVal_1501 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1501) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1502 (Array Int Int)) (v_ArrVal_1501 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1501) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2022-11-02 20:24:58,165 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:24:58,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-02 20:24:58,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 171 treesize of output 165 [2022-11-02 20:24:58,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 180 [2022-11-02 20:24:58,187 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:24:58,188 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 215 [2022-11-02 20:24:58,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 246 [2022-11-02 20:24:58,232 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:24:58,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-02 20:24:58,235 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:24:58,237 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-11-02 20:24:58,241 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:24:58,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2022-11-02 20:24:58,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-02 20:24:58,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-11-02 20:24:58,433 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-11-02 20:24:58,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717238332] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:24:58,433 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:24:58,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 19] total 49 [2022-11-02 20:24:58,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978956790] [2022-11-02 20:24:58,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:24:58,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-02 20:24:58,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:24:58,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-02 20:24:58,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1969, Unknown=3, NotChecked=276, Total=2450 [2022-11-02 20:24:58,435 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 50 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:00,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:25:00,021 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-11-02 20:25:00,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-02 20:25:00,022 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-02 20:25:00,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:25:00,022 INFO L225 Difference]: With dead ends: 78 [2022-11-02 20:25:00,022 INFO L226 Difference]: Without dead ends: 78 [2022-11-02 20:25:00,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1087 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=486, Invalid=3555, Unknown=3, NotChecked=378, Total=4422 [2022-11-02 20:25:00,024 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 440 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 1167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 430 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:25:00,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 566 Invalid, 1167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 636 Invalid, 0 Unknown, 430 Unchecked, 0.4s Time] [2022-11-02 20:25:00,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-02 20:25:00,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-02 20:25:00,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 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-02 20:25:00,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2022-11-02 20:25:00,027 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 37 [2022-11-02 20:25:00,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:25:00,027 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2022-11-02 20:25:00,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-02 20:25:00,027 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-11-02 20:25:00,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-02 20:25:00,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:25:00,028 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:25:00,063 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-02 20:25:00,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-11-02 20:25:00,243 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-11-02 20:25:00,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:25:00,243 INFO L85 PathProgramCache]: Analyzing trace with hash -882633249, now seen corresponding path program 1 times [2022-11-02 20:25:00,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:25:00,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069664826] [2022-11-02 20:25:00,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:00,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:25:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:01,592 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:01,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:25:01,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069664826] [2022-11-02 20:25:01,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069664826] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:25:01,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643861703] [2022-11-02 20:25:01,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:25:01,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:25:01,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:25:01,594 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:25:01,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e842162-a93c-41be-bcdd-799b91f26b67/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-02 20:25:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:25:01,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 60 conjunts are in the unsatisfiable core [2022-11-02 20:25:01,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:25:02,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-02 20:25:02,104 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:25:02,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 53 [2022-11-02 20:25:02,283 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-02 20:25:02,283 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 48 [2022-11-02 20:25:02,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2022-11-02 20:25:02,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-02 20:25:02,778 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:25:02,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 67 [2022-11-02 20:25:04,288 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:25:04,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-02 20:25:07,306 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (= |c_ULTIMATE.start_main_old_#valid#1| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) is different from false [2022-11-02 20:25:07,320 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1595 (Array Int Int)) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (= |c_ULTIMATE.start_main_old_#valid#1| (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) is different from false [2022-11-02 20:25:07,364 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1595 (Array Int Int)) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)) (= |c_ULTIMATE.start_main_old_#valid#1| (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0))))) is different from false [2022-11-02 20:25:07,381 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1594 (Array Int Int)) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)) (= (let ((.cse0 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1594) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0)) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2022-11-02 20:25:07,392 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:25:07,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2022-11-02 20:25:07,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 164 [2022-11-02 20:25:07,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 308 treesize of output 284 [2022-11-02 20:25:07,443 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-02 20:25:07,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 224 treesize of output 228 [2022-11-02 20:25:07,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 216 treesize of output 204 [2022-11-02 20:25:25,550 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0)) (.cse170 (< (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 3) 0)) (.cse535 (< 0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 1)))) (let ((.cse121 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse540 (or .cse170 .cse535)) (.cse171 (< 0 (+ 5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (.cse173 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse7 (store .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0)) (.cse440 (< 3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse600 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 1))) (let ((.cse228 (store .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (.cse536 (or .cse440 .cse600)) (.cse441 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 5)) (.cse138 (forall ((v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse610 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse610 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse610 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse610 (select .cse7 v_antiDerIndex_entry0_1)))))) (.cse22 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse608 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse609 (store .cse6 v_arrayElimCell_194 0))) (or (= .cse608 (select (store .cse609 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse608 (select (store .cse609 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse307 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse607 (store .cse6 v_arrayElimCell_194 0)) (.cse605 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse606 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse605 (select (store .cse606 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse605 (select (store .cse607 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse605 (select (store .cse607 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse605 (select (store .cse606 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse172 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse604 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse604 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse604 (select .cse7 v_antiDerIndex_entry0_1)))))) (.cse280 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse603 (store .cse6 v_arrayElimCell_199 0)) (.cse602 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse602 (select (store .cse603 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse602 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse602 (select (store .cse603 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse602 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)))))) (.cse18 (< .cse173 0)) (.cse19 (< 0 .cse173)) (.cse353 (and .cse600 .cse535)) (.cse155 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse601 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse601 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse601 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse601 (select .cse7 v_antiDerIndex_entry0_1)))))) (.cse119 (and .cse600 .cse540 .cse171)) (.cse23 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse77 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)))) (.cse2 (not .cse121))) (let ((.cse20 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse598 (store .cse6 v_arrayElimCell_194 0)) (.cse597 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse599 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse597 (select (store .cse598 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse597 (select (store .cse599 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse597 (select (store .cse598 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse597 (select (store .cse599 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse83 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse593 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse594 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse593 (select (store .cse594 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (= .cse593 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (= .cse593 (select (store .cse594 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse595 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse596 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse595 (select (store .cse596 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (or (= .cse595 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse595 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)))) (= .cse595 (select (store .cse596 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (.cse0 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)))) (.cse21 (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse589 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse590 (store .cse6 v_arrayElimCell_194 0))) (or (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (or (= .cse589 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse589 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse589 (select (store .cse590 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse589 (select (store .cse590 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse592 (store .cse6 v_arrayElimCell_194 0)) (.cse591 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse591 (select (store .cse592 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse591 (select (store .cse592 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (= .cse591 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))))) (.cse151 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse588 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse588 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse588 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse588 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse588 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)))))) (.cse143 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse587 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse587 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse587 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse587 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)))))) (.cse133 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse585 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse586 (store .cse6 v_arrayElimCell_194 0))) (or (= .cse585 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse585 (select (store .cse586 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse585 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse585 (select (store .cse586 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse64 (or .cse77 .cse2)) (.cse135 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse584 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse584 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse584 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse584 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse584 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)))))) (.cse116 (not .cse23)) (.cse117 (or .cse155 .cse119)) (.cse118 (or .cse353 .cse121 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse582 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse583 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse582 (select (store .cse583 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse582 (select (store .cse583 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (.cse129 (or (forall ((v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse580 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse581 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse580 (select (store .cse581 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse580 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse580 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse580 (select (store .cse581 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse18 .cse19)) (.cse134 (or .cse353 .cse280)) (.cse136 (or .cse155 .cse353)) (.cse140 (or .cse353 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse578 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse579 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse578 (select (store .cse579 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse578 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse578 (select (store .cse579 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse121)) (.cse141 (or .cse353 .cse121 .cse172)) (.cse144 (or .cse353 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse577 (store .cse6 v_arrayElimCell_199 0)) (.cse576 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse576 (select (store .cse577 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse576 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse576 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse576 (select (store .cse577 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse576 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))))) (.cse233 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse575 (store .cse6 v_arrayElimCell_199 0)) (.cse574 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse574 (select (store .cse575 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse574 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse574 (select (store .cse575 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse574 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)))))) (.cse152 (or .cse353 .cse307)) (.cse153 (or .cse353 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse573 (store .cse6 v_arrayElimCell_194 0)) (.cse571 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse572 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse571 (select (store .cse572 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse571 (select (store .cse573 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse571 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse571 (select (store .cse573 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse571 (select (store .cse572 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (.cse145 (or .cse119 .cse77)) (.cse76 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse570 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse570 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse570 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)))))) (.cse147 (forall ((v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))) (.cse148 (or .cse353 .cse22)) (.cse146 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse569 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse569 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse569 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)))))) (.cse154 (or (forall ((v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse567 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse568 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse567 (select (store .cse568 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse567 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse567 (select (store .cse568 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse18 .cse19)) (.cse149 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int)) (let ((.cse563 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_195 Int)) (= .cse563 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_194 Int)) (= .cse563 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse563 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse563 (select .cse7 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int)) (let ((.cse564 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_194 Int)) (= .cse564 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse564 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse564 (select .cse7 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int)) (let ((.cse565 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (= .cse565 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (= .cse565 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse565 (select .cse7 v_antiDerIndex_entry0_1))))) (or .cse121 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int)) (let ((.cse566 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse566 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse566 (select .cse7 v_antiDerIndex_entry0_1)))))))) (.cse166 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse561 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse561 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (let ((.cse562 (store .cse6 v_arrayElimCell_194 0))) (or (= .cse561 (select (store .cse562 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse561 (select (store .cse562 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))) (.cse47 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse560 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse560 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (= .cse560 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (= .cse560 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)))))) (.cse167 (or .cse121 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1))))) (.cse98 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse559 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse559 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (or (= .cse559 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse559 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)))))))) (.cse48 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse558 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse558 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse558 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (or (= .cse558 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse558 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)))))))) (.cse99 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse557 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse557 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (= .cse557 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))))) (.cse120 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse556 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse556 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse556 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)))))) (.cse168 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse555 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_195 Int)) (= .cse555 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (= .cse555 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_194 Int)) (= .cse555 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (.cse261 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse553 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse554 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse553 (select (store .cse554 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse553 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse553 (select (store .cse554 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse156 (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int)) (let ((.cse549 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_195 Int)) (= .cse549 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_194 Int)) (= .cse549 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse549 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int)) (let ((.cse550 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (let ((.cse551 (store .cse6 v_arrayElimCell_194 0))) (or (= .cse550 (select (store .cse551 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse550 (select (store .cse551 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse550 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse121 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int)) (let ((.cse552 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_194 Int)) (= .cse552 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse552 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse18 .cse19)) (.cse161 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse548 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse548 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse548 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse548 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse548 (select .cse7 v_antiDerIndex_entry0_1)))))) (.cse169 (or .cse138 .cse18 .cse19)) (.cse1 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse3 (< 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse382 (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (.cse17 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse547 (store .cse6 v_arrayElimCell_194 0)) (.cse546 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse546 (select (store .cse547 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse546 (select (store .cse547 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse546 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse444 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse541 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse542 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse541 (select (store .cse542 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse541 (select (store .cse542 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse541 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse543 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_200 Int)) (or (= .cse543 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse544 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse543 (select (store .cse544 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse543 (select (store .cse544 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse543 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse545 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_199 Int)) (= .cse545 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse545 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse23))) (.cse12 (and .cse536 .cse540 .cse171 .cse441)) (.cse300 (forall ((v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse539 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_195 Int)) (= .cse539 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (= .cse539 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse301 (forall ((v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse537 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse538 (store .cse6 v_arrayElimCell_194 0))) (or (forall ((v_arrayElimCell_195 Int)) (= .cse537 (select (store .cse538 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (= .cse537 (select (store .cse538 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse235 (store .cse228 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0)) (.cse16 (and .cse535 .cse536 .cse441))) (and (or .cse0 .cse1 .cse2 .cse3) (or (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse5 (store .cse6 v_arrayElimCell_194 0)) (.cse4 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse8 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse4 (select (store .cse5 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (or (= .cse4 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse4 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)))) (= .cse4 (select (store .cse8 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse4 (select (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse4 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse4 (select (store .cse8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse10 (store .cse6 v_arrayElimCell_194 0)) (.cse9 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse11 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse9 (select (store .cse10 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse9 (select (store .cse11 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse9 (select (store .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (= .cse9 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1))) (= .cse9 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse9 (select (store .cse11 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse12) (or (and (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse14 (store .cse6 v_arrayElimCell_194 0)) (.cse13 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse15 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse13 (select (store .cse14 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse13 (select (store .cse15 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse13 (select (store .cse14 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse13 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse13 (select (store .cse15 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse16) (or .cse17 .cse18 .cse19) (or .cse20 .cse16) (or .cse12 .cse21) (or .cse16 .cse22 .cse2)) .cse23) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse26 (store .cse6 v_arrayElimCell_194 0)) (.cse25 (store .cse6 v_arrayElimCell_199 0)) (.cse24 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse27 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse24 (select (store .cse25 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse24 (select (store .cse26 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse24 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse24 (select (store .cse27 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse24 (select (store .cse26 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse24 (select (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse24 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse24 (select (store .cse27 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse16) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse30 (store .cse6 v_arrayElimCell_194 0)) (.cse29 (store .cse6 v_arrayElimCell_199 0)) (.cse28 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse31 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse28 (select (store .cse29 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse28 (select (store .cse30 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse28 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse28 (select (store .cse31 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse28 (select (store .cse30 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse28 (select (store .cse29 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse28 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse28 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse28 (select (store .cse31 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse16) (or (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse32 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse32 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse32 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse32 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (= .cse32 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse32 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse34 (store .cse6 v_arrayElimCell_199 0)) (.cse33 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse33 (select (store .cse34 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse33 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse33 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse33 (select (store .cse34 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (= .cse33 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse33 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse36 (store .cse6 v_arrayElimCell_199 0)) (.cse35 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (or (= .cse35 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse35 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse35 (select (store .cse36 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse35 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse35 (select (store .cse36 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse35 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse37 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse38 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse37 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse37 (select (store .cse38 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (or (= .cse37 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse37 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)))) (= .cse37 (select (store .cse38 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse40 (store .cse6 v_arrayElimCell_199 0)) (.cse39 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse41 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse39 (select (store .cse40 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (= .cse39 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (= .cse39 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse39 (select (store .cse41 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse39 (select (store .cse40 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse39 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse39 (select (store .cse41 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse42 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse43 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse42 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse42 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse42 (select (store .cse43 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (or (= .cse42 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse42 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)))) (= .cse42 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse42 (select (store .cse43 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse45 (store .cse6 v_arrayElimCell_199 0)) (.cse44 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (or (= .cse44 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse44 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse44 (select (store .cse45 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse44 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse44 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse44 (select (store .cse45 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse44 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse46 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse46 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse46 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (= .cse46 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse46 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (or (and .cse47 .cse48) .cse2) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse49 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (or (= .cse49 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse49 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse49 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse49 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse51 (store .cse6 v_arrayElimCell_199 0)) (.cse50 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse52 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse50 (select (store .cse51 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (= .cse50 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (= .cse50 (select (store .cse52 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse50 (select (store .cse51 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse50 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse50 (select (store .cse52 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse53 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse54 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse53 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (= .cse53 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (= .cse53 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse53 (select (store .cse54 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse53 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse53 (select (store .cse54 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse55 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse56 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse55 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (= .cse55 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (= .cse55 (select (store .cse56 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse55 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse55 (select (store .cse56 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse57 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse57 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse57 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse57 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (= .cse57 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or .cse23 (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse58 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse58 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (let ((.cse59 (store .cse6 v_arrayElimCell_196 0))) (or (forall ((v_arrayElimCell_198 Int)) (= .cse58 (select (store .cse59 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse58 (select (store .cse59 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse60 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (or (= .cse60 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse60 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse60 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse61 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse61 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int)) (let ((.cse62 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse61 (select (store .cse62 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (or (= .cse61 (select (store .cse62 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse61 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse63 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse63 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (= .cse63 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse64)) (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse66 (store .cse6 v_arrayElimCell_199 0)) (.cse65 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse67 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse65 (select (store .cse66 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse65 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse65 (select (store .cse67 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (or (= .cse65 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse65 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)))) (= .cse65 (select (store .cse66 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse65 (select (store .cse67 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse68 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse69 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse68 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse68 (select (store .cse69 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (or (= .cse68 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse68 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)))) (= .cse68 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse68 (select (store .cse69 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse71 (store .cse6 v_arrayElimCell_199 0)) (.cse70 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse72 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse70 (select (store .cse71 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (= .cse70 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (= .cse70 (select (store .cse72 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse70 (select (store .cse71 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse70 (select (store .cse72 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse74 (store .cse6 v_arrayElimCell_199 0)) (.cse73 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse75 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse73 (select (store .cse74 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse73 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse73 (select (store .cse75 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (or (= .cse73 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse73 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)))) (= .cse73 (select (store .cse74 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse73 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse73 (select (store .cse75 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (and .cse76 .cse77) .cse2) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse79 (store .cse6 v_arrayElimCell_199 0)) (.cse78 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse78 (select (store .cse79 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse78 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse78 (select (store .cse79 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (= .cse78 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse78 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse80 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse81 (store .cse6 v_arrayElimCell_199 0))) (or (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (or (= .cse80 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse80 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse80 (select (store .cse81 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse80 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse80 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse80 (select (store .cse81 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse82 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (or (= .cse82 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse82 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse82 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse82 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse82 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (or .cse83 .cse2) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse85 (store .cse6 v_arrayElimCell_199 0)) (.cse84 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse84 (select (store .cse85 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse84 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse84 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse84 (select (store .cse85 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (= .cse84 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse86 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse87 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse86 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (= .cse86 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (= .cse86 (select (store .cse87 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse86 (select (store .cse87 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse88 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (or (= .cse88 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse88 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse88 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse88 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse88 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse89 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse90 (store .cse6 v_arrayElimCell_199 0))) (or (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (or (= .cse89 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse89 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse89 (select (store .cse90 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse89 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse89 (select (store .cse90 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse91 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse92 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse91 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (= .cse91 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (= .cse91 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse91 (select (store .cse92 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse91 (select (store .cse92 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse93 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse94 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse93 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse93 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse93 (select (store .cse94 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (or (= .cse93 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse93 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)))) (= .cse93 (select (store .cse94 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse96 (store .cse6 v_arrayElimCell_199 0)) (.cse95 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse97 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse95 (select (store .cse96 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse95 (select (store .cse97 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (or (= .cse95 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse95 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)))) (= .cse95 (select (store .cse96 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse95 (select (store .cse97 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (and .cse98 .cse99) .cse2) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse100 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (= .cse100 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (= .cse100 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse100 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse101 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse101 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (or (= .cse101 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse101 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)))) (= .cse101 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse2) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse103 (store .cse6 v_arrayElimCell_199 0)) (.cse102 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse102 (select (store .cse103 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse102 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse102 (select (store .cse103 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (= .cse102 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse105 (store .cse6 v_arrayElimCell_199 0)) (.cse104 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse106 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse104 (select (store .cse105 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (= .cse104 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (= .cse104 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse104 (select (store .cse106 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse104 (select (store .cse105 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse104 (select (store .cse106 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse107 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse107 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse107 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (= .cse107 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse109 (store .cse6 v_arrayElimCell_199 0)) (.cse108 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse110 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse108 (select (store .cse109 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse108 (select (store .cse110 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (or (= .cse108 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse108 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)))) (= .cse108 (select (store .cse109 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse108 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse108 (select (store .cse110 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse111 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (or (= .cse111 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse111 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse111 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse111 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse111 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse111 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)))))) .cse12) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse114 (store .cse6 v_arrayElimCell_194 0)) (.cse113 (store .cse6 v_arrayElimCell_199 0)) (.cse112 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse115 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse112 (select (store .cse113 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse112 (select (store .cse114 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse112 (select (store .cse115 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse112 (select (store .cse114 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse112 (select (store .cse113 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse112 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse112 (select (store .cse115 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse16) (or .cse20 .cse16 .cse2) (or .cse116 (let ((.cse137 (not (<= .cse173 0))) (.cse139 (not (<= 0 .cse173))) (.cse126 (or .cse121 .cse172)) (.cse122 (and .cse170 .cse171)) (.cse123 (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) (.cse128 (not (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (and .cse117 .cse118 (or .cse119 .cse83) (or .cse120 .cse121 .cse122) (or .cse123 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse124 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_195 Int)) (= .cse124 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (= .cse124 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_194 Int)) (= .cse124 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse124 (select .cse7 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse125 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_195 Int)) (= .cse125 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (= .cse125 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse125 (select .cse7 v_antiDerIndex_entry0_1))))) .cse126 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse127 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse127 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (= .cse127 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (= .cse127 (select .cse7 v_antiDerIndex_entry0_1)))))) .cse128) .cse129 (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_200 Int)) (let ((.cse130 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_195 Int)) (= .cse130 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (= .cse130 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_200 Int)) (let ((.cse131 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse131 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (or (= .cse131 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse131 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_200 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1))) .cse121) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_200 Int)) (let ((.cse132 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_195 Int)) (= .cse132 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_194 Int)) (= .cse132 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse132 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)))))) .cse1 .cse3) (or .cse119 .cse133) .cse134 (or .cse135 .cse122) .cse136 (or .cse137 .cse138 .cse139) .cse140 .cse141 (or (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse142 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse142 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse142 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse142 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) .cse1 .cse3) (or .cse143 .cse119) .cse144 (or (and .cse145 .cse146 (or .cse137 .cse139 .cse147) .cse148 (or .cse0 .cse1 .cse3) (or .cse76 .cse122)) .cse2) (or .cse137 .cse139 .cse149) (or (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse150 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse150 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse150 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse150 (select .cse7 v_antiDerIndex_entry0_1))))) .cse1 .cse3) (or .cse151 .cse122) .cse152 .cse153 .cse126 .cse154 (or .cse151 .cse1 .cse3) (or .cse155 .cse122) .cse156 (or .cse123 .cse128 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_200 Int)) (let ((.cse157 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (= .cse157 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (= .cse157 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse157 (select .cse7 v_antiDerIndex_entry0_1))))) (or .cse121 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_200 Int)) (let ((.cse158 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse158 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse158 (select .cse7 v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_200 Int)) (let ((.cse159 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_195 Int)) (= .cse159 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (= .cse159 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse159 (select .cse7 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_200 Int)) (let ((.cse160 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_195 Int)) (= .cse160 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_194 Int)) (= .cse160 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse160 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse160 (select .cse7 v_antiDerIndex_entry0_1))))))) .cse161 (or .cse119 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse162 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse163 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse162 (select (store .cse163 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (= .cse162 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (= .cse162 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse162 (select (store .cse163 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse164 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse165 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse164 (select (store .cse165 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse164 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (or (= .cse164 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse164 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)))) (= .cse164 (select (store .cse165 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or (and .cse166 .cse167 .cse98 .cse99 .cse168) .cse119) .cse169))) (or .cse12 (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse175 (store .cse6 v_arrayElimCell_194 0)) (.cse174 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse176 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse174 (select (store .cse175 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse174 (select (store .cse176 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse174 (select (store .cse175 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (= .cse174 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1))) (= .cse174 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse174 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse174 (select (store .cse176 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse178 (store .cse6 v_arrayElimCell_194 0)) (.cse177 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse179 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse177 (select (store .cse178 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (or (= .cse177 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse177 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)))) (= .cse177 (select (store .cse179 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse177 (select (store .cse178 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse177 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse177 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse177 (select (store .cse179 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or .cse12 (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse182 (store .cse6 v_arrayElimCell_194 0)) (.cse180 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse181 (store .cse6 v_arrayElimCell_199 0))) (or (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (or (= .cse180 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse180 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse180 (select (store .cse181 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse180 (select (store .cse182 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse180 (select (store .cse182 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse180 (select (store .cse181 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse184 (store .cse6 v_arrayElimCell_194 0)) (.cse183 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (or (= .cse183 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse183 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse183 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse183 (select (store .cse184 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse183 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse183 (select (store .cse184 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse183 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse187 (store .cse6 v_arrayElimCell_194 0)) (.cse186 (store .cse6 v_arrayElimCell_199 0)) (.cse185 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (or (= .cse185 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse185 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse185 (select (store .cse186 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse185 (select (store .cse187 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse185 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse185 (select (store .cse187 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse185 (select (store .cse186 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse185 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse190 (store .cse6 v_arrayElimCell_194 0)) (.cse189 (store .cse6 v_arrayElimCell_199 0)) (.cse188 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse188 (select (store .cse189 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse188 (select (store .cse190 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse188 (select (store .cse190 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse188 (select (store .cse189 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (= .cse188 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse188 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse193 (store .cse6 v_arrayElimCell_194 0)) (.cse192 (store .cse6 v_arrayElimCell_199 0)) (.cse191 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse191 (select (store .cse192 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse191 (select (store .cse193 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse191 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse191 (select (store .cse193 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse191 (select (store .cse192 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (= .cse191 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse195 (store .cse6 v_arrayElimCell_194 0)) (.cse194 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse194 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse194 (select (store .cse195 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse194 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse194 (select (store .cse195 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (= .cse194 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse194 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse197 (store .cse6 v_arrayElimCell_194 0)) (.cse196 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse196 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse196 (select (store .cse197 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse196 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse196 (select (store .cse197 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (= .cse196 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse198 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse198 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (= .cse198 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse198 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse199 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (or (= .cse199 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse199 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse199 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse199 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)))))) .cse2) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse202 (store .cse6 v_arrayElimCell_194 0)) (.cse201 (store .cse6 v_arrayElimCell_199 0)) (.cse200 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (or (= .cse200 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse200 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse200 (select (store .cse201 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse200 (select (store .cse202 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse200 (select (store .cse202 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse200 (select (store .cse201 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse200 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse205 (store .cse6 v_arrayElimCell_194 0)) (.cse203 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse204 (store .cse6 v_arrayElimCell_199 0))) (or (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (or (= .cse203 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse203 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse203 (select (store .cse204 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse203 (select (store .cse205 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse203 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse203 (select (store .cse205 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse203 (select (store .cse204 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse208 (store .cse6 v_arrayElimCell_194 0)) (.cse207 (store .cse6 v_arrayElimCell_199 0)) (.cse206 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse206 (select (store .cse207 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse206 (select (store .cse208 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse206 (select (store .cse208 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse206 (select (store .cse207 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (= .cse206 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse210 (store .cse6 v_arrayElimCell_194 0)) (.cse209 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (or (= .cse209 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse209 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse209 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse209 (select (store .cse210 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse209 (select (store .cse210 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse209 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse212 (store .cse6 v_arrayElimCell_194 0)) (.cse211 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse211 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse211 (select (store .cse212 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse211 (select (store .cse212 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (= .cse211 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse213 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse214 (store .cse6 v_arrayElimCell_194 0))) (or (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (or (= .cse213 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse213 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse213 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse213 (select (store .cse214 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse213 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse213 (select (store .cse214 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse217 (store .cse6 v_arrayElimCell_194 0)) (.cse216 (store .cse6 v_arrayElimCell_199 0)) (.cse215 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse215 (select (store .cse216 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse215 (select (store .cse217 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse215 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse215 (select (store .cse217 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse215 (select (store .cse216 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (= .cse215 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse215 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse219 (store .cse6 v_arrayElimCell_194 0)) (.cse218 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse218 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse218 (select (store .cse219 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse218 (select (store .cse219 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (= .cse218 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse218 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (or .cse21 .cse2) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse220 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse221 (store .cse6 v_arrayElimCell_194 0))) (or (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (or (= .cse220 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse220 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse220 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse220 (select (store .cse221 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse220 (select (store .cse221 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse222 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse223 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse222 (select (store .cse223 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse222 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse222 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse222 (select (store .cse223 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse16 .cse2) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int)) (let ((.cse225 (store .cse6 v_arrayElimCell_194 0)) (.cse224 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse226 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse224 (select (store .cse225 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse224 (select (store .cse226 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse224 (select (store .cse225 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse224 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse224 (select (store .cse226 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse18 .cse19) (or .cse119 .cse121 (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse227 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse227 (select .cse228 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (= .cse227 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse229 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse229 (select .cse228 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse230 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse229 (select (store .cse230 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse229 (select (store .cse230 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse231 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse231 (select .cse228 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (or (= .cse231 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse231 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse232 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse232 (select .cse228 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_200 Int)) (= .cse232 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_199 Int)) (= .cse232 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse228 v_antiDerIndex_entry0_1))) .cse23))) (or (and (or .cse233 .cse2) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse236 (store .cse6 v_arrayElimCell_199 0)) (.cse234 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse234 (select .cse235 v_antiDerIndex_entry0_1)) (= .cse234 (select (store .cse236 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse234 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse234 (select (store .cse236 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse234 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse234 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (or .cse151 .cse2) (or .cse143 .cse2) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse237 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse237 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse237 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse237 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse237 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) .cse2) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse239 (store .cse6 v_arrayElimCell_199 0)) (.cse238 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse238 (select .cse235 v_antiDerIndex_entry0_1)) (= .cse238 (select (store .cse239 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse238 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse238 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse238 (select (store .cse239 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse238 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse241 (store .cse6 v_arrayElimCell_199 0)) (.cse240 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse240 (select .cse235 v_antiDerIndex_entry0_1)) (= .cse240 (select (store .cse241 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse240 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse240 (select (store .cse241 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse240 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse242 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse242 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse242 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse242 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse242 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) .cse2) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse245 (store .cse6 v_arrayElimCell_194 0)) (.cse244 (store .cse6 v_arrayElimCell_199 0)) (.cse243 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse243 (select (store .cse244 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse243 (select (store .cse245 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse243 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse243 (select (store .cse245 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse243 (select (store .cse244 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse243 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse243 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (or .cse133 .cse2) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse246 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse246 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse246 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse246 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse2) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse247 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse247 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse247 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) .cse2) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse249 (store .cse6 v_arrayElimCell_194 0)) (.cse248 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse248 (select .cse235 v_antiDerIndex_entry0_1)) (= .cse248 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse248 (select (store .cse249 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse248 (select (store .cse249 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse248 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse252 (store .cse6 v_arrayElimCell_194 0)) (.cse251 (store .cse6 v_arrayElimCell_199 0)) (.cse250 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse250 (select (store .cse251 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse250 (select (store .cse252 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse250 (select (store .cse252 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse250 (select (store .cse251 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse250 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse254 (store .cse6 v_arrayElimCell_199 0)) (.cse253 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse253 (select (store .cse254 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse253 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse253 (select (store .cse254 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse253 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse256 (store .cse6 v_arrayElimCell_199 0)) (.cse255 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse255 (select (store .cse256 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse255 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse255 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse255 (select (store .cse256 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse255 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse257 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse257 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse257 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse257 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) .cse2) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse260 (store .cse6 v_arrayElimCell_194 0)) (.cse259 (store .cse6 v_arrayElimCell_199 0)) (.cse258 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse258 (select (store .cse259 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse258 (select (store .cse260 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse258 (select (store .cse260 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse258 (select (store .cse259 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse258 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse258 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (or .cse261 .cse2) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse262 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse262 (select .cse235 v_antiDerIndex_entry0_1)) (= .cse262 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse262 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse262 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse262 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse262 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse263 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse263 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse263 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse263 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse264 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse264 (select .cse235 v_antiDerIndex_entry0_1)) (= .cse264 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse264 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse265 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse265 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse265 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse64) .cse23) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse268 (store .cse6 v_arrayElimCell_194 0)) (.cse267 (store .cse6 v_arrayElimCell_199 0)) (.cse266 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse266 (select .cse235 v_antiDerIndex_entry0_1)) (= .cse266 (select (store .cse267 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse266 (select (store .cse268 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse266 (select (store .cse268 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse266 (select (store .cse267 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse266 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse266 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse270 (store .cse6 v_arrayElimCell_194 0)) (.cse269 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse269 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse269 (select (store .cse270 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse269 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse269 (select (store .cse270 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse269 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse271 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse271 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse271 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse271 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) .cse2) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse272 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse272 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse272 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse272 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse272 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse274 (store .cse6 v_arrayElimCell_199 0)) (.cse273 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse273 (select .cse235 v_antiDerIndex_entry0_1)) (= .cse273 (select (store .cse274 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse273 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse273 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse273 (select (store .cse274 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse273 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse273 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse275 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse275 (select .cse235 v_antiDerIndex_entry0_1)) (= .cse275 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse275 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse275 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse275 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse278 (store .cse6 v_arrayElimCell_194 0)) (.cse277 (store .cse6 v_arrayElimCell_199 0)) (.cse276 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse276 (select .cse235 v_antiDerIndex_entry0_1)) (= .cse276 (select (store .cse277 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse276 (select (store .cse278 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse276 (select (store .cse278 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse276 (select (store .cse277 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse276 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse279 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse279 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse279 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse279 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse279 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (or .cse280 .cse2) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse282 (store .cse6 v_arrayElimCell_199 0)) (.cse281 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse281 (select (store .cse282 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse281 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse281 (select (store .cse282 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse281 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse281 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (or .cse135 .cse2) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse284 (store .cse6 v_arrayElimCell_194 0)) (.cse283 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse283 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse283 (select (store .cse284 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse283 (select (store .cse284 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse283 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse286 (store .cse6 v_arrayElimCell_194 0)) (.cse285 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse285 (select .cse235 v_antiDerIndex_entry0_1)) (= .cse285 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse285 (select (store .cse286 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse285 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse285 (select (store .cse286 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse285 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse285 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse289 (store .cse6 v_arrayElimCell_194 0)) (.cse288 (store .cse6 v_arrayElimCell_199 0)) (.cse287 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse287 (select (store .cse288 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse287 (select (store .cse289 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse287 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse287 (select (store .cse289 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse287 (select (store .cse288 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse287 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse291 (store .cse6 v_arrayElimCell_194 0)) (.cse290 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse290 (select (store .cse291 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse290 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse290 (select (store .cse291 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse290 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse2) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse294 (store .cse6 v_arrayElimCell_194 0)) (.cse293 (store .cse6 v_arrayElimCell_199 0)) (.cse292 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse292 (select .cse235 v_antiDerIndex_entry0_1)) (= .cse292 (select (store .cse293 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse292 (select (store .cse294 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse292 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse292 (select (store .cse294 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse292 (select (store .cse293 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse292 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse292 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse296 (store .cse6 v_arrayElimCell_199 0)) (.cse295 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse295 (select (store .cse296 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse295 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse295 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse295 (select (store .cse296 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse295 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse295 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse298 (store .cse6 v_arrayElimCell_194 0)) (.cse297 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse297 (select .cse235 v_antiDerIndex_entry0_1)) (= .cse297 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse297 (select (store .cse298 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse297 (select (store .cse298 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse297 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse297 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse299 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse299 (select .cse235 v_antiDerIndex_entry0_1)) (= .cse299 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse299 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse299 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or (and .cse76 .cse77 .cse300 .cse301) .cse2) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse302 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse303 (store .cse6 v_arrayElimCell_194 0))) (or (= .cse302 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse302 (select (store .cse303 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse302 (select (store .cse303 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse2) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse306 (store .cse6 v_arrayElimCell_194 0)) (.cse305 (store .cse6 v_arrayElimCell_199 0)) (.cse304 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse304 (select .cse235 v_antiDerIndex_entry0_1)) (= .cse304 (select (store .cse305 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse304 (select (store .cse306 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse304 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse304 (select (store .cse306 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse304 (select (store .cse305 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse304 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or .cse307 .cse2) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse309 (store .cse6 v_arrayElimCell_194 0)) (.cse308 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse308 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse308 (select (store .cse309 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse308 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse308 (select (store .cse309 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse308 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse308 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse311 (store .cse6 v_arrayElimCell_194 0)) (.cse310 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse310 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse310 (select (store .cse311 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse310 (select (store .cse311 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse310 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse310 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse313 (store .cse6 v_arrayElimCell_194 0)) (.cse312 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse312 (select .cse235 v_antiDerIndex_entry0_1)) (= .cse312 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse312 (select (store .cse313 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse312 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse312 (select (store .cse313 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse312 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse314 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse314 (select .cse235 v_antiDerIndex_entry0_1)) (= .cse314 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse314 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse314 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse314 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse315 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse315 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse315 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse315 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_198 Int)) (= .cse315 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= .cse315 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)))))) .cse119) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse318 (store .cse6 v_arrayElimCell_194 0)) (.cse317 (store .cse6 v_arrayElimCell_199 0)) (.cse316 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse319 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse316 (select (store .cse317 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse316 (select (store .cse318 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse316 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse316 (select (store .cse319 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse316 (select (store .cse318 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse316 (select (store .cse317 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse316 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse316 (select (store .cse319 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse16) (or (let ((.cse329 (forall ((v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse347 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse348 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse347 (select (store .cse348 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse347 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse347 (select (store .cse348 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse320 (forall ((v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse346 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse346 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse346 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (and (or .cse320 .cse23) (or (forall ((v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse321 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse321 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse321 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse321 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse2) (forall ((v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse322 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_200 Int)) (or (= .cse322 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse323 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse322 (select (store .cse323 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse322 (select (store .cse323 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse322 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse322 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_194 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse324 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse325 (store .cse6 v_arrayElimCell_196 0))) (or (forall ((v_arrayElimCell_199 Int)) (= .cse324 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse324 (select (store .cse325 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse324 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse324 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse324 (select (store .cse325 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_194 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse326 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse328 (store .cse6 v_arrayElimCell_196 0))) (or (forall ((v_arrayElimCell_200 Int)) (or (= .cse326 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse327 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse326 (select (store .cse327 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse326 (select (store .cse327 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse326 (select (store .cse328 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse326 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse326 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse326 (select (store .cse328 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse329 .cse2) (or .cse23 .cse329) (forall ((v_arrayElimCell_194 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse330 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse331 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse330 (select (store .cse331 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse330 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse332 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse330 (select (store .cse332 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse330 (select (store .cse332 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse330 (select (store .cse331 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_194 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse333 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse334 (store .cse6 v_arrayElimCell_196 0))) (or (forall ((v_arrayElimCell_199 Int)) (= .cse333 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse333 (select (store .cse334 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse333 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse333 (select (store .cse334 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse335 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_199 Int)) (= .cse335 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse335 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse335 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_194 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse336 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse338 (store .cse6 v_arrayElimCell_196 0))) (or (forall ((v_arrayElimCell_200 Int)) (or (= .cse336 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse337 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse336 (select (store .cse337 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse336 (select (store .cse337 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse336 (select (store .cse338 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse336 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse336 (select (store .cse338 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse147 .cse2) (forall ((v_arrayElimCell_194 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse339 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse340 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse339 (select (store .cse340 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse339 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse339 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse341 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse339 (select (store .cse341 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse339 (select (store .cse341 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse339 (select (store .cse340 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse320 .cse2) (forall ((v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse342 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse342 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse343 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse342 (select (store .cse343 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse342 (select (store .cse343 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse342 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse344 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse345 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse344 (select (store .cse345 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse344 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse344 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse344 (select (store .cse345 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse23))) .cse18 .cse19) (or .cse116 (and .cse117 .cse118 .cse129 .cse134 (or .cse119 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse349 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse350 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse349 (select (store .cse350 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse349 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse349 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse349 (select (store .cse350 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse352 (store .cse6 v_arrayElimCell_199 0)) (.cse351 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse351 (select (store .cse352 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse351 (select (store (store .cse6 v_arrayElimCell_194 0) v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse351 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse351 (select (store .cse352 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse351 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) .cse119) .cse136 .cse140 .cse141 .cse144 (or .cse119 .cse233) .cse152 .cse153 (or (and .cse145 (or .cse76 .cse119) (or .cse147 .cse18 .cse19) .cse148 (or .cse146 .cse353)) .cse2) .cse154 (or .cse149 .cse18 .cse19) (or .cse119 (and .cse166 .cse47 .cse167 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse354 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse354 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int)) (let ((.cse355 (store .cse6 v_arrayElimCell_194 0))) (or (= .cse354 (select (store .cse355 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse354 (select (store .cse355 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse354 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1))))) .cse98 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse356 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_195 Int)) (= .cse356 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))) (= .cse356 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_194 Int)) (= .cse356 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse356 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1))))) .cse48 .cse99 (or .cse120 .cse121) .cse168)) (or .cse119 .cse261) .cse156 (or .cse353 .cse161) .cse169)) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int)) (let ((.cse358 (store .cse6 v_arrayElimCell_194 0)) (.cse357 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse359 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse357 (select (store .cse358 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse357 (select (store .cse359 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse357 (select (store .cse358 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse357 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse357 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse357 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse357 (select (store .cse359 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse18 .cse19) (or .cse18 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int)) (let ((.cse361 (store .cse6 v_arrayElimCell_194 0)) (.cse360 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse362 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse360 (select (store .cse361 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse360 (select (store .cse362 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse360 (select (store .cse361 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse360 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse360 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse360 (select (store .cse362 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse19) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse365 (store .cse6 v_arrayElimCell_194 0)) (.cse364 (store .cse6 v_arrayElimCell_199 0)) (.cse363 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse366 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse363 (select (store .cse364 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse363 (select (store .cse365 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse363 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse363 (select (store .cse366 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse363 (select (store .cse365 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse363 (select (store .cse364 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse363 (select (store .cse366 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse16) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse369 (store .cse6 v_arrayElimCell_194 0)) (.cse368 (store .cse6 v_arrayElimCell_199 0)) (.cse367 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse370 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse367 (select (store .cse368 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse367 (select (store .cse369 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse367 (select (store .cse370 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse367 (select (store .cse369 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse367 (select (store .cse368 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse367 (select (store .cse370 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse16) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse373 (store .cse6 v_arrayElimCell_194 0)) (.cse372 (store .cse6 v_arrayElimCell_199 0)) (.cse371 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse374 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse371 (select (store .cse372 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse371 (select (store .cse373 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse371 (select (store .cse374 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse371 (select (store .cse373 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse371 (select (store .cse372 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse371 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse371 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse371 (select (store .cse374 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse16) (or (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse376 (store .cse6 v_arrayElimCell_194 0)) (.cse375 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse377 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse375 (select (store .cse376 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (or (= .cse375 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse375 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)))) (= .cse375 (select (store .cse377 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse375 (select (store .cse376 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse375 (select (store .cse377 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse379 (store .cse6 v_arrayElimCell_194 0)) (.cse378 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse380 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse378 (select (store .cse379 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse378 (select (store .cse380 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse378 (select (store .cse379 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (= .cse378 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1))) (= .cse378 (select (store .cse380 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse12) (or .cse1 (let ((.cse385 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse388 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse388 (select .cse382 v_antiDerIndex_entry0_1)) (= .cse388 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))))) (and (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse381 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse381 (select .cse382 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_200 Int)) (= .cse381 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1))) (= .cse381 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse383 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse383 (select .cse382 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_200 Int)) (or (= .cse383 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse384 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse383 (select (store .cse384 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse383 (select (store .cse384 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse383 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (or .cse23 .cse385) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse386 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse386 (select .cse382 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (= .cse386 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1))) (= .cse386 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse387 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse387 (select .cse382 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (or (= .cse387 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse387 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)))) (= .cse387 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1))))) (or .cse385 .cse2))) .cse3) (or .cse121 (let ((.cse397 (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse442 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse443 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse442 (select .cse382 v_antiDerIndex_entry0_1)) (= .cse442 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse442 (select (store .cse443 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse442 (select (store .cse443 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse395 (and .cse440 .cse441)) (.cse389 (and (or .cse440 .cse170) .cse171 .cse441)) (.cse396 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse439 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse439 (select .cse382 v_antiDerIndex_entry0_1)) (= .cse439 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse439 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (and (or .cse389 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse391 (store .cse6 v_arrayElimCell_199 0)) (.cse390 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse390 (select .cse382 v_antiDerIndex_entry0_1)) (= .cse390 (select (store .cse391 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse390 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse390 (select (store .cse391 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse390 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse393 (store .cse6 v_arrayElimCell_199 0)) (.cse392 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse394 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse392 (select .cse382 v_antiDerIndex_entry0_1)) (= .cse392 (select (store .cse393 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse392 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse392 (select (store .cse393 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse392 (select (store .cse394 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse392 (select (store .cse394 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse395) (or .cse12 .cse396) (or .cse397 .cse1 .cse3) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse398 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse399 (store .cse6 v_arrayElimCell_196 0))) (or (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (= .cse398 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1))) (= .cse398 (select (store .cse399 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse398 (select (store .cse399 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse400 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse401 (store .cse6 v_arrayElimCell_196 0))) (or (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (or (= .cse400 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse400 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)))) (= .cse400 (select (store .cse401 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse400 (select (store .cse401 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse12) (or .cse389 (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse402 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse402 (select .cse382 v_antiDerIndex_entry0_1)) (= .cse402 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse23) (or (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse403 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse403 (select .cse382 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_200 Int)) (or (= .cse403 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse404 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse403 (select (store .cse404 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse403 (select (store .cse404 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse405 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse405 (select .cse382 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_200 Int)) (= .cse405 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse382 v_antiDerIndex_entry0_1))) .cse23) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse406 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse406 (select .cse382 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (or (= .cse406 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse406 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse407 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse407 (select .cse382 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (= .cse407 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1))))))) .cse1 .cse3) (or .cse12 .cse397) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse409 (store .cse6 v_arrayElimCell_199 0)) (.cse408 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse408 (select .cse382 v_antiDerIndex_entry0_1)) (= .cse408 (select (store .cse409 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse408 (select (store .cse409 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse408 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse12) (or (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse411 (store .cse6 v_arrayElimCell_199 0)) (.cse410 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse412 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse410 (select (store .cse411 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse410 (select (store .cse411 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse410 (select (store .cse412 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse410 (select (store .cse412 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse16) (or .cse389 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse413 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse413 (select .cse382 v_antiDerIndex_entry0_1)) (= .cse413 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse413 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse413 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse12 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse414 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse415 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse414 (select (store .cse415 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse414 (select (store .cse415 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse414 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse23) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse416 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (or (= .cse416 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse416 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)))) (= .cse416 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse417 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_200 Int)) (or (= .cse417 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse418 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse417 (select (store .cse418 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse417 (select (store .cse418 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse417 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse419 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (= .cse419 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1))) (= .cse419 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse420 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse421 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse420 (select .cse382 v_antiDerIndex_entry0_1)) (= .cse420 (select (store .cse421 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse420 (select (store .cse421 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse23 .cse395) (or .cse389 (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse422 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse423 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse422 (select .cse382 v_antiDerIndex_entry0_1)) (= .cse422 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse422 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse422 (select (store .cse423 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse422 (select (store .cse423 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_200 Int)) (let ((.cse424 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse424 (select .cse382 v_antiDerIndex_entry0_1)) (= .cse424 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse424 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse1 .cse3) (or .cse18 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_199 Int)) (let ((.cse425 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse426 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse425 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse425 (select (store .cse426 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse425 (select (store .cse426 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse19) (or (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse428 (store .cse6 v_arrayElimCell_199 0)) (.cse427 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse429 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse427 (select .cse382 v_antiDerIndex_entry0_1)) (= .cse427 (select (store .cse428 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse427 (select (store .cse428 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse427 (select (store .cse429 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse427 (select (store .cse429 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse16) (or .cse396 .cse1 .cse3) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_199 Int)) (let ((.cse430 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse431 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse430 (select .cse382 v_antiDerIndex_entry0_1)) (= .cse430 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse430 (select (store .cse431 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse430 (select (store .cse431 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse18 .cse19) (or (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_200 Int)) (let ((.cse432 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse433 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse432 (select .cse382 v_antiDerIndex_entry0_1)) (= .cse432 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse432 (select (store .cse433 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse432 (select (store .cse433 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse1 .cse3) (or (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse435 (store .cse6 v_arrayElimCell_199 0)) (.cse434 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse436 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse434 (select (store .cse435 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse434 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse434 (select (store .cse435 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse434 (select (store .cse436 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse434 (select (store .cse436 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse16) (or .cse23 (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse437 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse438 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse437 (select (store .cse438 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse437 (select (store .cse438 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse16)))) (or .cse121 .cse444 .cse18 .cse19) (or .cse18 .cse19 (and (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse445 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse445 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse445 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse445 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse2) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse448 (store .cse6 v_arrayElimCell_194 0)) (.cse446 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_200 Int)) (or (= .cse446 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse447 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse446 (select (store .cse447 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse446 (select (store .cse447 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse446 (select (store .cse448 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse446 (select (store .cse448 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse446 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse446 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse17 .cse2) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse450 (store .cse6 v_arrayElimCell_194 0)) (.cse449 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse449 (select (store .cse450 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (= .cse449 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse449 (select (store .cse450 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse449 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse449 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse452 (store .cse6 v_arrayElimCell_194 0)) (.cse451 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse451 (select (store .cse452 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse451 (select (store .cse452 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse453 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse451 (select (store .cse453 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse451 (select (store .cse453 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse451 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse455 (store .cse6 v_arrayElimCell_194 0)) (.cse454 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse454 (select (store .cse455 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse454 (select (store .cse455 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse454 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse456 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse454 (select (store .cse456 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse454 (select (store .cse456 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse454 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse459 (store .cse6 v_arrayElimCell_194 0)) (.cse457 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_200 Int)) (or (= .cse457 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse458 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse457 (select (store .cse458 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse457 (select (store .cse458 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (= .cse457 (select (store .cse459 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse457 (select (store .cse459 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse457 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse461 (store .cse6 v_arrayElimCell_194 0)) (.cse460 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse460 (select (store .cse461 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int)) (= .cse460 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse460 (select (store .cse461 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse460 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse462 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse462 (select (store (store .cse6 v_arrayElimCell_194 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse462 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse462 (select (store .cse7 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse462 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse16 .cse2) (or (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse464 (store .cse6 v_arrayElimCell_194 0)) (.cse463 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse465 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse463 (select (store .cse464 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (or (= .cse463 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse463 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)))) (= .cse463 (select (store .cse465 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse463 (select (store .cse464 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse463 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse463 (select (store .cse465 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse467 (store .cse6 v_arrayElimCell_194 0)) (.cse466 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse468 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse466 (select (store .cse467 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse466 (select (store .cse468 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse466 (select (store .cse467 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (= .cse466 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1))) (= .cse466 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse466 (select (store .cse468 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse12) (or (and (or (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int)) (let ((.cse469 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse470 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse469 (select (store .cse470 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse469 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse469 (select (store .cse470 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse18 .cse19) (or .cse12 (and (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse471 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse472 (store .cse6 v_arrayElimCell_196 0))) (or (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (or (= .cse471 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse471 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)))) (= .cse471 (select (store .cse472 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse471 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse471 (select (store .cse472 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse473 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse474 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse473 (select (store .cse474 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (= .cse473 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1))) (= .cse473 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse473 (select (store .cse474 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse476 (store .cse6 v_arrayElimCell_199 0)) (.cse475 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse477 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse475 (select (store .cse476 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse475 (select (store .cse477 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse475 (select (store .cse476 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse475 (select (store .cse477 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse16) (or .cse12 (and (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse478 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse479 (store .cse6 v_arrayElimCell_196 0))) (or (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (or (= .cse478 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse478 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)))) (= .cse478 (select (store .cse479 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse478 (select (store .cse479 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse480 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse481 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse480 (select (store .cse481 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (= .cse480 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1))) (= .cse480 (select (store .cse481 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or .cse16 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse483 (store .cse6 v_arrayElimCell_199 0)) (.cse482 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse484 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse482 (select (store .cse483 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse482 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse482 (select (store .cse484 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse482 (select (store .cse483 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse482 (select (store .cse484 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse486 (store .cse6 v_arrayElimCell_199 0)) (.cse485 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse487 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse485 (select (store .cse486 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse485 (select (store .cse487 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse485 (select (store .cse486 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse485 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse485 (select (store .cse487 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse16) (or .cse16 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse489 (store .cse6 v_arrayElimCell_199 0)) (.cse488 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse490 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse488 (select (store .cse489 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse488 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse488 (select (store .cse490 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse488 (select (store .cse489 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse488 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse488 (select (store .cse490 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse444 .cse18 .cse19) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int)) (let ((.cse491 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse492 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse491 (select (store .cse492 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse491 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse491 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse491 (select (store .cse492 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse18 .cse19) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse493 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse493 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (= .cse493 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse494 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (or (= .cse494 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse494 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse494 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse494 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse496 (store .cse6 v_arrayElimCell_199 0)) (.cse495 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse495 (select (store .cse496 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse495 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse495 (select (store .cse496 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (= .cse495 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse497 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse497 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse497 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) .cse23) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse498 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse499 (store .cse6 v_arrayElimCell_199 0))) (or (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (or (= .cse498 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse498 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse498 (select (store .cse499 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse498 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse498 (select (store .cse499 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse500 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse501 (store .cse6 v_arrayElimCell_199 0))) (or (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (or (= .cse500 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse500 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse500 (select (store .cse501 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse500 (select (store .cse501 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse503 (store .cse6 v_arrayElimCell_199 0)) (.cse502 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse502 (select (store .cse503 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse502 (select (store .cse503 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (= .cse502 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse504 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse504 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse504 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (= .cse504 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse505 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (or (= .cse505 (select (store (store .cse6 v_arrayElimCell_196 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse505 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse505 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)))))) .cse12) (or .cse23 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse506 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse507 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse506 (select (store .cse507 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse506 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse506 (select (store .cse507 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse16) (or (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse508 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse509 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse508 (select (store .cse509 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse508 (select (store .cse509 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse23 .cse16)) .cse121) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int)) (let ((.cse511 (store .cse6 v_arrayElimCell_194 0)) (.cse510 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse512 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse510 (select (store .cse511 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse510 (select (store .cse512 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse510 (select (store .cse511 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse510 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse510 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse510 (select (store .cse512 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse18 .cse19) (or (and .cse300 .cse301) .cse16 .cse2) (or (and (or .cse119 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse513 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse513 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (= .cse513 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse514 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse514 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (or (= .cse514 (select (store (store .cse6 v_arrayElimCell_199 0) v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse514 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1))))))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse515 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse516 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse515 (select .cse235 v_antiDerIndex_entry0_1)) (= .cse515 (select (store .cse516 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse515 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse515 (select (store .cse516 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse353) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int)) (let ((.cse517 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse517 (select .cse235 v_antiDerIndex_entry0_1)) (= .cse517 (select (store (store .cse6 v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse18 .cse19) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse518 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse519 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse518 (select (store .cse519 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse518 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse518 (select (store .cse519 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse119) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse520 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse521 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse520 (select .cse235 v_antiDerIndex_entry0_1)) (= .cse520 (select (store .cse521 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse520 (select (store .cse521 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse18 .cse19) (or .cse119 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse522 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse523 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse522 (select (store .cse523 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse522 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse522 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse522 (select (store .cse523 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse353 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse524 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse525 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse524 (select .cse235 v_antiDerIndex_entry0_1)) (= .cse524 (select (store .cse525 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse524 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse524 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse524 (select (store .cse525 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_200 Int)) (let ((.cse526 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse527 (store .cse6 v_arrayElimCell_199 0))) (or (= .cse526 (select .cse235 v_antiDerIndex_entry0_1)) (= .cse526 (select (store .cse527 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse526 (select (store .cse7 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse526 (select (store .cse527 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse18 .cse19) (or (and (or .cse18 (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse235 v_antiDerIndex_entry0_1))) .cse19) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse528 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse528 (select .cse235 v_antiDerIndex_entry0_1)) (= .cse528 (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse353) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse228 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) .cse119)) .cse23)) .cse121) (or (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_198 Int) (v_arrayElimCell_200 Int)) (let ((.cse531 (store .cse6 v_arrayElimCell_194 0)) (.cse530 (store .cse6 v_arrayElimCell_199 0)) (.cse529 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse532 (store .cse6 v_arrayElimCell_196 0))) (or (= .cse529 (select (store .cse530 v_arrayElimCell_200 0) v_antiDerIndex_entry0_1)) (= .cse529 (select (store .cse531 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse529 (select (store .cse532 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse529 (select (store .cse531 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse529 (select (store .cse530 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse529 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse529 (select (store .cse532 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse16) (or .cse16 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_194 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int) (v_arrayElimCell_198 Int)) (let ((.cse534 (store .cse6 v_arrayElimCell_194 0)) (.cse533 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse533 (select (store .cse534 v_arrayElimCell_195 0) v_antiDerIndex_entry0_1)) (= .cse533 (select (store .cse534 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse533 (select (store .cse7 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (= .cse533 (select (store (store .cse6 v_arrayElimCell_196 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse2)))))) is different from false [2022-11-02 20:26:33,538 WARN L234 SmtUtils]: Spent 31.31s on a formula simplification. DAG size of input: 226 DAG size of output: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:26:46,031 WARN L234 SmtUtils]: Spent 10.13s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-02 20:26:48,903 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-11-02 20:26:48,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643861703] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-02 20:26:48,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-02 20:26:48,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19, 20] total 59 [2022-11-02 20:26:48,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479018045] [2022-11-02 20:26:48,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-02 20:26:48,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-11-02 20:26:48,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:26:48,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-11-02 20:26:48,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=2811, Unknown=11, NotChecked=550, Total=3540 [2022-11-02 20:26:48,906 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 60 states, 59 states have (on average 1.8135593220338984) internal successors, (107), 60 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)