./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30e01a73 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_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire/config/TaipanReach.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:10:13,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:10:13,082 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-11-23 21:10:13,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:10:13,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:10:13,116 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:10:13,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:10:13,117 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:10:13,118 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:10:13,119 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:10:13,120 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 21:10:13,120 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 21:10:13,121 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 21:10:13,122 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-23 21:10:13,122 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 21:10:13,123 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 21:10:13,123 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-23 21:10:13,124 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-23 21:10:13,124 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 21:10:13,125 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-23 21:10:13,125 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-23 21:10:13,126 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-23 21:10:13,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:10:13,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 21:10:13,128 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:10:13,128 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:10:13,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:10:13,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:10:13,130 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 21:10:13,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:10:13,131 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 21:10:13,131 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:10:13,131 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 21:10:13,133 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:10:13,133 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:10:13,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:10:13,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:10:13,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:10:13,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:10:13,136 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:10:13,136 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 21:10:13,136 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-23 21:10:13,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:10:13,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:10:13,138 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 21:10:13,138 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 21:10:13,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:10:13,138 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire/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_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 [2023-11-23 21:10:13,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:10:13,509 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:10:13,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:10:13,513 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:10:13,516 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:10:13,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2023-11-23 21:10:16,737 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:10:16,999 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:10:17,004 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2023-11-23 21:10:17,023 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire/data/b75cd65c6/3ae15bd752244445a17fdb44560cd572/FLAG1a8c28e37 [2023-11-23 21:10:17,041 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire/data/b75cd65c6/3ae15bd752244445a17fdb44560cd572 [2023-11-23 21:10:17,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:10:17,051 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:10:17,055 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:10:17,056 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:10:17,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:10:17,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:10:17" (1/1) ... [2023-11-23 21:10:17,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1db82a71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:17, skipping insertion in model container [2023-11-23 21:10:17,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:10:17" (1/1) ... [2023-11-23 21:10:17,132 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:10:17,507 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i[24211,24224] [2023-11-23 21:10:17,516 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:10:17,536 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:10:17,596 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i[24211,24224] [2023-11-23 21:10:17,597 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:10:17,630 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:10:17,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:17 WrapperNode [2023-11-23 21:10:17,631 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:10:17,632 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:10:17,632 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:10:17,632 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:10:17,640 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:17" (1/1) ... [2023-11-23 21:10:17,654 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:17" (1/1) ... [2023-11-23 21:10:17,678 INFO L138 Inliner]: procedures = 122, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 93 [2023-11-23 21:10:17,679 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:10:17,680 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:10:17,680 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:10:17,680 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:10:17,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:17" (1/1) ... [2023-11-23 21:10:17,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:17" (1/1) ... [2023-11-23 21:10:17,697 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:17" (1/1) ... [2023-11-23 21:10:17,698 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:17" (1/1) ... [2023-11-23 21:10:17,708 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:17" (1/1) ... [2023-11-23 21:10:17,712 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:17" (1/1) ... [2023-11-23 21:10:17,714 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:17" (1/1) ... [2023-11-23 21:10:17,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:17" (1/1) ... [2023-11-23 21:10:17,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:10:17,719 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:10:17,720 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:10:17,720 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:10:17,721 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:17" (1/1) ... [2023-11-23 21:10:17,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:10:17,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:10:17,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:10:17,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:10:17,841 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-23 21:10:17,842 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-23 21:10:17,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 21:10:17,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 21:10:17,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-23 21:10:17,845 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:10:17,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 21:10:17,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 21:10:17,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:10:17,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 21:10:17,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:10:17,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:10:18,035 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:10:18,038 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:10:18,089 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-23 21:10:18,284 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:10:18,379 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:10:18,379 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-23 21:10:18,381 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:10:18 BoogieIcfgContainer [2023-11-23 21:10:18,383 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:10:18,386 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:10:18,387 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:10:18,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:10:18,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:10:17" (1/3) ... [2023-11-23 21:10:18,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@297e4af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:10:18, skipping insertion in model container [2023-11-23 21:10:18,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:10:17" (2/3) ... [2023-11-23 21:10:18,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@297e4af6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:10:18, skipping insertion in model container [2023-11-23 21:10:18,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:10:18" (3/3) ... [2023-11-23 21:10:18,397 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2023-11-23 21:10:18,419 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:10:18,419 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 21:10:18,522 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:10:18,529 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@3edf9bb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:10:18,529 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 21:10:18,534 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 20 states have internal predecessors, (28), 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) [2023-11-23 21:10:18,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-23 21:10:18,542 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:10:18,543 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:10:18,543 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:10:18,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:10:18,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1372459767, now seen corresponding path program 1 times [2023-11-23 21:10:18,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:10:18,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371743486] [2023-11-23 21:10:18,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:10:18,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:10:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:10:19,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:10:19,012 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:10:19,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371743486] [2023-11-23 21:10:19,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371743486] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:10:19,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:10:19,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:10:19,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077230912] [2023-11-23 21:10:19,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:10:19,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:10:19,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:10:19,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:10:19,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:10:19,069 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 20 states have internal predecessors, (28), 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, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:10:19,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:10:19,138 INFO L93 Difference]: Finished difference Result 38 states and 53 transitions. [2023-11-23 21:10:19,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:10:19,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2023-11-23 21:10:19,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:10:19,149 INFO L225 Difference]: With dead ends: 38 [2023-11-23 21:10:19,149 INFO L226 Difference]: Without dead ends: 18 [2023-11-23 21:10:19,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 [2023-11-23 21:10:19,156 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 21:10:19,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 41 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 21:10:19,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-23 21:10:19,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2023-11-23 21:10:19,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:10:19,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2023-11-23 21:10:19,189 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 7 [2023-11-23 21:10:19,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:10:19,190 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2023-11-23 21:10:19,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:10:19,191 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2023-11-23 21:10:19,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-23 21:10:19,191 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:10:19,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:10:19,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:10:19,192 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:10:19,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:10:19,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1451408273, now seen corresponding path program 1 times [2023-11-23 21:10:19,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:10:19,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648260592] [2023-11-23 21:10:19,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:10:19,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:10:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:10:19,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:10:19,382 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:10:19,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648260592] [2023-11-23 21:10:19,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648260592] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:10:19,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431316289] [2023-11-23 21:10:19,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:10:19,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:10:19,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:10:19,392 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:10:19,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 21:10:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:10:19,593 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 21:10:19,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:10:19,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:10:19,663 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:10:19,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:10:19,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431316289] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:10:19,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1432054298] [2023-11-23 21:10:19,714 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-11-23 21:10:19,714 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 21:10:19,718 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-23 21:10:19,724 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-23 21:10:19,725 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-23 21:10:21,316 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-23 21:10:22,010 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '156#(and (= |ULTIMATE.start_main_~data_new~0#1| 1) (<= 1 |#StackHeapBarrier|) (exists ((|v_#memory_int_33| (Array Int (Array Int Int))) (|v_#memory_int_56| (Array Int (Array Int Int)))) (and (= |#memory_int| (store |v_#memory_int_33| |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_33| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8 (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)))) (= (store |v_#memory_int_56| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8) (store (select |v_#memory_int_56| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) 4 (select (select |v_#memory_int_33| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) 4))) |v_#memory_int_33|))) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) (= |ULTIMATE.start_main_~data_init~0#1| 1) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~head~1#1.base|) (exists ((|v_#memory_$Pointer$.base_36| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.base| (store (store |v_#memory_$Pointer$.base_36| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8) (store (select |v_#memory_$Pointer$.base_36| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) 4 |ULTIMATE.start_dll_circular_create_#res#1.base|)) |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select (store |v_#memory_$Pointer$.base_36| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8) (store (select |v_#memory_$Pointer$.base_36| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) 4 |ULTIMATE.start_dll_circular_create_#res#1.base|)) |ULTIMATE.start_dll_circular_create_#res#1.base|) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8))))) (= |ULTIMATE.start_main_~len~0#1| 5) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (exists ((|v_#memory_$Pointer$.offset_36| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_36| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8) (store (select |v_#memory_$Pointer$.offset_36| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) 4 0)) |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select (store |v_#memory_$Pointer$.offset_36| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8) (store (select |v_#memory_$Pointer$.offset_36| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) 4 0)) |ULTIMATE.start_dll_circular_create_#res#1.base|) 8 0)))) (= |ULTIMATE.start_main_~head~1#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| |ULTIMATE.start_main_~head~1#1.base|))' at error location [2023-11-23 21:10:22,011 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-23 21:10:22,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:10:22,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-11-23 21:10:22,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910128827] [2023-11-23 21:10:22,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:10:22,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:10:22,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:10:22,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:10:22,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-11-23 21:10:22,015 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:10:22,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:10:22,090 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2023-11-23 21:10:22,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:10:22,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-23 21:10:22,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:10:22,093 INFO L225 Difference]: With dead ends: 34 [2023-11-23 21:10:22,093 INFO L226 Difference]: Without dead ends: 25 [2023-11-23 21:10:22,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-11-23 21:10:22,095 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 21:10:22,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 28 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 21:10:22,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-11-23 21:10:22,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-11-23 21:10:22,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 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) [2023-11-23 21:10:22,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-11-23 21:10:22,107 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 10 [2023-11-23 21:10:22,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:10:22,108 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-11-23 21:10:22,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:10:22,110 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-11-23 21:10:22,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-23 21:10:22,115 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:10:22,116 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:10:22,148 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 21:10:22,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:10:22,336 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:10:22,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:10:22,337 INFO L85 PathProgramCache]: Analyzing trace with hash -2044865783, now seen corresponding path program 2 times [2023-11-23 21:10:22,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:10:22,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147488669] [2023-11-23 21:10:22,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:10:22,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:10:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:10:23,766 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 21:10:23,767 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:10:23,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147488669] [2023-11-23 21:10:23,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147488669] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:10:23,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676664576] [2023-11-23 21:10:23,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 21:10:23,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:10:23,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:10:23,774 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:10:23,797 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 21:10:24,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-23 21:10:24,284 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 21:10:24,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-23 21:10:24,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:10:24,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 21:10:24,543 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-23 21:10:24,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-23 21:10:24,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-23 21:10:24,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 21:10:24,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 11 [2023-11-23 21:10:24,719 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 21:10:24,720 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:10:24,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:10:24,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 32 [2023-11-23 21:10:24,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:10:24,870 INFO L378 Elim1Store]: Elim1 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 222 treesize of output 214 [2023-11-23 21:10:24,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 154 treesize of output 146 [2023-11-23 21:10:25,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2023-11-23 21:10:25,271 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-23 21:10:25,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676664576] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 21:10:25,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [201579487] [2023-11-23 21:10:25,287 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-11-23 21:10:25,287 INFO L166 IcfgInterpreter]: Building call graph [2023-11-23 21:10:25,287 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-11-23 21:10:25,287 INFO L176 IcfgInterpreter]: Starting interpretation [2023-11-23 21:10:25,288 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-11-23 21:10:26,164 INFO L180 IcfgInterpreter]: Interpretation finished [2023-11-23 21:10:27,106 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '371#(and (= |ULTIMATE.start_main_~data_new~0#1| 1) (<= 1 |#StackHeapBarrier|) (not (= (select (select |#memory_int| |ULTIMATE.start_main_~ptr~0#1.base|) 0) 1)) (= |ULTIMATE.start_main_~data_init~0#1| 1) (= |ULTIMATE.start_main_~ptr~0#1.offset| 0) (= |ULTIMATE.start_dll_circular_create_#res#1.base| |ULTIMATE.start_main_~head~1#1.base|) (exists ((|v_#memory_$Pointer$.offset_56| (Array Int (Array Int Int)))) (= |#memory_$Pointer$.offset| (store (store |v_#memory_$Pointer$.offset_56| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8) (store (select |v_#memory_$Pointer$.offset_56| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) 4 0)) |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select (store |v_#memory_$Pointer$.offset_56| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8) (store (select |v_#memory_$Pointer$.offset_56| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) 4 0)) |ULTIMATE.start_dll_circular_create_#res#1.base|) 8 0)))) (= |ULTIMATE.start_main_~len~0#1| 5) (exists ((|v_#memory_int_85| (Array Int (Array Int Int))) (|v_#memory_int_33| (Array Int (Array Int Int)))) (and (= |v_#memory_int_33| (store |v_#memory_int_85| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8) (store (select |v_#memory_int_85| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) 4 (select (select |v_#memory_int_33| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) 4)))) (= |#memory_int| (store |v_#memory_int_33| |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select |v_#memory_int_33| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8 (select (select |#memory_int| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)))))) (= |ULTIMATE.start_dll_circular_create_#res#1.offset| 0) (= |ULTIMATE.start_main_~head~1#1.offset| 0) (= |ULTIMATE.start_main_~ptr~0#1.base| |ULTIMATE.start_main_~head~1#1.base|) (exists ((|v_#memory_$Pointer$.base_56| (Array Int (Array Int Int)))) (= (store (store |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8) (store (select |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) 4 |ULTIMATE.start_dll_circular_create_#res#1.base|)) |ULTIMATE.start_dll_circular_create_#res#1.base| (store (select (store |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8) (store (select |v_#memory_$Pointer$.base_56| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8)) 4 |ULTIMATE.start_dll_circular_create_#res#1.base|)) |ULTIMATE.start_dll_circular_create_#res#1.base|) 8 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_dll_circular_create_#res#1.base|) 8))) |#memory_$Pointer$.base|)))' at error location [2023-11-23 21:10:27,106 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-11-23 21:10:27,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 21:10:27,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 24 [2023-11-23 21:10:27,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489088807] [2023-11-23 21:10:27,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 21:10:27,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-23 21:10:27,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 21:10:27,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-23 21:10:27,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=895, Unknown=0, NotChecked=0, Total=992 [2023-11-23 21:10:27,111 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 25 states, 25 states have (on average 1.92) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:10:27,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 21:10:27,733 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2023-11-23 21:10:27,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 21:10:27,734 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-23 21:10:27,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 21:10:27,735 INFO L225 Difference]: With dead ends: 29 [2023-11-23 21:10:27,735 INFO L226 Difference]: Without dead ends: 27 [2023-11-23 21:10:27,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=175, Invalid=1231, Unknown=0, NotChecked=0, Total=1406 [2023-11-23 21:10:27,738 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 11 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 21:10:27,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 128 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 21:10:27,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-23 21:10:27,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-23 21:10:27,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 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) [2023-11-23 21:10:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2023-11-23 21:10:27,747 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 19 [2023-11-23 21:10:27,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 21:10:27,748 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2023-11-23 21:10:27,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.92) internal successors, (48), 24 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:10:27,748 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2023-11-23 21:10:27,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-23 21:10:27,750 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 21:10:27,750 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:10:27,774 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-23 21:10:27,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:10:27,968 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 21:10:27,969 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:10:27,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1220729213, now seen corresponding path program 1 times [2023-11-23 21:10:27,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 21:10:27,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873339143] [2023-11-23 21:10:27,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:10:27,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:10:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:10:30,037 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 11 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 21:10:30,038 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 21:10:30,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873339143] [2023-11-23 21:10:30,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873339143] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 21:10:30,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [771902480] [2023-11-23 21:10:30,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:10:30,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 21:10:30,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 21:10:30,044 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 21:10:30,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2d46776c-975a-4a44-a1e5-88c3f8ba0e3f/bin/utaipan-verify-mE87zJ7Ire/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 21:10:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:10:30,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 91 conjunts are in the unsatisfiable core [2023-11-23 21:10:30,236 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 21:10:30,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-23 21:10:30,345 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-23 21:10:30,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-23 21:10:30,434 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-23 21:10:30,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-23 21:10:30,588 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-23 21:10:30,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-11-23 21:10:30,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-23 21:10:30,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-23 21:10:30,891 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-11-23 21:10:30,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2023-11-23 21:10:31,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2023-11-23 21:10:31,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-23 21:10:31,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:10:31,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2023-11-23 21:10:31,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-23 21:10:31,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-11-23 21:10:31,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2023-11-23 21:10:31,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-23 21:10:31,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2023-11-23 21:10:31,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2023-11-23 21:10:31,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2023-11-23 21:10:31,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:10:31,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2023-11-23 21:10:31,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-11-23 21:10:31,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 27 [2023-11-23 21:10:31,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-23 21:10:31,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2023-11-23 21:10:31,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 17 [2023-11-23 21:10:31,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-23 21:10:31,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:10:31,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 23 [2023-11-23 21:10:31,539 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:10:31,539 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 21:10:31,635 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_561 Int) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_563) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1))) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2023-11-23 21:10:31,660 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:10:31,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 97 [2023-11-23 21:10:31,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 290 treesize of output 288 [2023-11-23 21:10:31,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 274 treesize of output 266 [2023-11-23 21:10:31,720 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:10:31,721 INFO L378 Elim1Store]: Elim1 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 6118 treesize of output 6092 [2023-11-23 21:10:31,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 438 treesize of output 422 [2023-11-23 21:10:31,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 206 [2023-11-23 21:10:35,324 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse22 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse4 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse15 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse46 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_arrayElimCell_38 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse69 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse69 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563) v_arrayElimCell_38) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_550 (store (select .cse69 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))))))) (.cse12 (not .cse22))) (let ((.cse25 (forall ((v_arrayElimCell_41 Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_arrayElimCell_38 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int)) (let ((.cse68 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (let ((.cse67 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse68 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (= (select (select .cse67 v_arrayElimCell_42) v_arrayElimCell_41) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse67 v_arrayElimCell_38) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_550 (store (select .cse68 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4))))))))) (.cse26 (or .cse46 .cse12)) (.cse27 (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (forall ((v_ArrVal_550 (Array Int Int))) (let ((.cse65 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (not (= v_ArrVal_550 (store (select .cse65 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))) (forall ((v_arrayElimCell_41 Int) (v_ArrVal_561 Int) (v_arrayElimCell_38 Int) (v_ArrVal_563 (Array Int Int))) (let ((.cse66 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse65 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563) v_arrayElimCell_38))) (or (= (select .cse66 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse66 v_arrayElimCell_41) |c_ULTIMATE.start_main_~data_init~0#1|)))))))))) (.cse28 (or (forall ((v_arrayElimCell_41 Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_arrayElimCell_38 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse64 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse64 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563) v_arrayElimCell_38) v_arrayElimCell_41) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_550 (store (select .cse64 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4))))))) .cse22)) (.cse32 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse37 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_arrayElimCell_38 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse63 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (let ((.cse62 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse63 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563) v_arrayElimCell_38))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (= (select .cse62 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_550 (store (select .cse63 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse62 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) (.cse38 (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (.cse30 (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((v_ArrVal_550 (Array Int Int))) (let ((.cse61 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (forall ((v_arrayElimCell_41 Int) (v_ArrVal_561 Int) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int)) (let ((.cse59 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse61 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (or (= (select (select .cse59 v_arrayElimCell_42) v_arrayElimCell_41) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_38 Int)) (let ((.cse60 (select .cse59 v_arrayElimCell_38))) (or (= (select .cse60 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse60 v_arrayElimCell_41) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (not (= v_ArrVal_550 (store (select .cse61 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4))))))) (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|))))) (.cse31 (or (forall ((v_arrayElimCell_41 Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_arrayElimCell_38 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int)) (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (let ((.cse57 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse58 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (= (select (select .cse57 v_arrayElimCell_42) v_arrayElimCell_41) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse57 v_arrayElimCell_38) v_arrayElimCell_41) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_550 (store (select .cse58 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))))))) .cse22)) (.cse8 (not .cse15))) (and (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (forall ((v_ArrVal_550 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (forall ((v_arrayElimCell_41 Int) (v_ArrVal_561 Int) (v_arrayElimCell_38 Int) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int)) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (let ((.cse1 (select .cse0 v_arrayElimCell_38))) (or (= (select (select .cse0 v_arrayElimCell_42) v_arrayElimCell_41) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse1 v_arrayElimCell_41) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (not (= v_ArrVal_550 (store (select .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4))))))))) (or (and (or (forall ((v_arrayElimCell_41 Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_arrayElimCell_38 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (let ((.cse5 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (let ((.cse6 (select .cse5 v_arrayElimCell_38))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (= (select (select .cse5 v_arrayElimCell_42) v_arrayElimCell_41) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_550 (store (select .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) .cse8) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((v_ArrVal_550 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (forall ((v_arrayElimCell_41 Int) (v_ArrVal_561 Int) (v_arrayElimCell_38 Int) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int)) (let ((.cse9 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse11 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (let ((.cse10 (select .cse9 v_arrayElimCell_38))) (or (= (select (select .cse9 v_arrayElimCell_42) v_arrayElimCell_41) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse10 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (not (= v_ArrVal_550 (store (select .cse11 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4))))))) (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|))))) .cse12) (or (forall ((v_arrayElimCell_41 Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (let ((.cse13 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (= (select (select .cse13 v_arrayElimCell_42) v_arrayElimCell_41) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_550 (store (select .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))))))) .cse15) (or (and (or (forall ((v_arrayElimCell_41 Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_arrayElimCell_38 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int)) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (let ((.cse16 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse18 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (let ((.cse17 (select .cse16 v_arrayElimCell_38))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (= (select (select .cse16 v_arrayElimCell_42) v_arrayElimCell_41) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse17 v_arrayElimCell_41) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_550 (store (select .cse18 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse17 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) .cse8) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (forall ((v_ArrVal_550 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (not (= v_ArrVal_550 (store (select .cse19 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))) (forall ((v_arrayElimCell_41 Int) (v_ArrVal_561 Int) (v_arrayElimCell_38 Int) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int)) (let ((.cse20 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse19 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (let ((.cse21 (select .cse20 v_arrayElimCell_38))) (or (= (select (select .cse20 v_arrayElimCell_42) v_arrayElimCell_41) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse21 v_arrayElimCell_41) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse20 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse21 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))))))))) .cse22) (or (and (forall ((v_arrayElimArr_7 (Array Int Int))) (or (forall ((v_ArrVal_550 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (not (= v_ArrVal_550 (store (select .cse23 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))) (forall ((v_arrayElimCell_41 Int) (v_ArrVal_561 Int) (v_arrayElimCell_38 Int) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int)) (let ((.cse24 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse23 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (or (= (select (select .cse24 v_arrayElimCell_42) v_arrayElimCell_41) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse24 v_arrayElimCell_38) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse24 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)))) (or .cse25 .cse8)) .cse12) (or (and (or (and .cse26 .cse27 .cse28) .cse8) (or .cse15 (forall ((v_arrayElimCell_41 Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int)) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse29 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563) v_arrayElimCell_42) v_arrayElimCell_41) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_550 (store (select .cse29 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))))))) .cse30 (or .cse25 .cse12) .cse31) (not .cse32)) (or (and .cse26 (or .cse22 (forall ((v_arrayElimCell_41 Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_arrayElimCell_38 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse34 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (let ((.cse33 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse34 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563) v_arrayElimCell_38))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (= (select .cse33 v_arrayElimCell_41) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_550 (store (select .cse34 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse33 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (forall ((v_ArrVal_550 (Array Int Int))) (let ((.cse36 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (forall ((v_arrayElimCell_41 Int) (v_ArrVal_561 Int) (v_arrayElimCell_38 Int) (v_ArrVal_563 (Array Int Int))) (let ((.cse35 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse36 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563) v_arrayElimCell_38))) (or (= (select .cse35 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse35 v_arrayElimCell_41) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse35 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (not (= v_ArrVal_550 (store (select .cse36 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4))))))))) (or .cse37 .cse12) (or .cse38 (and .cse27 .cse28))) .cse8) (or .cse32 (and (or (and (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (forall ((v_ArrVal_550 (Array Int Int))) (let ((.cse40 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (forall ((v_ArrVal_561 Int) (v_arrayElimCell_38 Int) (v_ArrVal_563 (Array Int Int))) (let ((.cse39 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse40 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (or (= (select (select .cse39 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse39 v_arrayElimCell_38) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (not (= v_ArrVal_550 (store (select .cse40 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4))))))))) (or (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_arrayElimCell_38 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (not (= v_ArrVal_550 (store (select .cse41 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse41 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563) v_arrayElimCell_38) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) .cse8)) .cse22) (or .cse37 .cse8) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (forall ((v_ArrVal_550 (Array Int Int))) (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (forall ((v_ArrVal_561 Int) (v_arrayElimCell_38 Int) (v_ArrVal_563 (Array Int Int))) (let ((.cse43 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse44 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (let ((.cse42 (select .cse43 v_arrayElimCell_38))) (or (= (select .cse42 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse43 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse42 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) (not (= v_ArrVal_550 (store (select .cse44 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4))))))))) (or .cse15 (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (let ((.cse45 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse45 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_550 (store (select .cse45 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))))))) (or .cse12 (and (or .cse46 .cse8) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (forall ((v_ArrVal_550 (Array Int Int))) (let ((.cse48 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (forall ((v_ArrVal_561 Int) (v_arrayElimCell_38 Int) (v_ArrVal_563 (Array Int Int))) (let ((.cse47 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse48 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (or (= (select (select .cse47 v_arrayElimCell_38) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse47 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= v_ArrVal_550 (store (select .cse48 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4))))))))))))) (or (forall ((v_arrayElimCell_41 Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_arrayElimCell_38 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int)) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (let ((.cse49 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse51 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (let ((.cse50 (select .cse49 v_arrayElimCell_38))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (= (select (select .cse49 v_arrayElimCell_42) v_arrayElimCell_41) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse50 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse50 v_arrayElimCell_41) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_550 (store (select .cse51 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select .cse50 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) .cse8) (or .cse38 (and (or (forall ((v_arrayElimCell_41 Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_561 Int) (v_arrayElimCell_38 Int) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_563 (Array Int Int)) (v_arrayElimCell_42 Int)) (let ((.cse53 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (let ((.cse52 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse53 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (= (select (select .cse52 v_arrayElimCell_42) v_arrayElimCell_41) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse52 v_arrayElimCell_38) v_arrayElimCell_41) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse52 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_550 (store (select .cse53 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4)))))))) .cse22) (or (and .cse30 .cse31) .cse8) (forall ((v_arrayElimArr_7 (Array Int Int))) (or (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~data#1|)) (forall ((v_ArrVal_550 (Array Int Int))) (let ((.cse56 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_7))) (or (forall ((v_ArrVal_561 Int) (v_ArrVal_563 (Array Int Int))) (let ((.cse54 (store (store (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse56 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_550) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_561)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_563))) (or (= (select (select .cse54 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_42 Int)) (or (= (select (select .cse54 v_arrayElimCell_42) v_arrayElimCell_41) |c_ULTIMATE.start_main_~data_init~0#1|) (forall ((v_arrayElimCell_38 Int)) (let ((.cse55 (select .cse54 v_arrayElimCell_38))) (or (= (select .cse55 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select .cse55 v_arrayElimCell_41) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (not (= v_ArrVal_550 (store (select .cse56 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_550 .cse4))))))))))))))) is different from false [2023-11-23 21:10:38,225 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2023-11-23 21:10:38,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-11-23 21:10:38,300 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2023-11-23 21:10:38,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-11-23 21:10:38,353 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2023-11-23 21:10:38,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-11-23 21:10:38,413 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2023-11-23 21:10:38,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-11-23 21:10:38,465 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2023-11-23 21:10:38,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-11-23 21:10:38,509 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2023-11-23 21:10:38,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-11-23 21:10:38,564 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2023-11-23 21:10:38,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-11-23 21:10:51,576 INFO L349 Elim1Store]: treesize reduction 58, result has 55.4 percent of original size [2023-11-23 21:10:51,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 1949 treesize of output 1948 [2023-11-23 21:10:51,674 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:10:51,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 322 treesize of output 322 [2023-11-23 21:10:51,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:10:51,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 151 [2023-11-23 21:10:51,919 INFO L349 Elim1Store]: treesize reduction 48, result has 52.5 percent of original size [2023-11-23 21:10:51,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 230 treesize of output 267 [2023-11-23 21:10:52,047 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2023-11-23 21:10:52,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 85 [2023-11-23 21:10:52,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-23 21:10:52,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:10:52,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2023-11-23 21:10:53,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:10:53,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2023-11-23 21:10:54,391 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:10:54,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 87 [2023-11-23 21:10:54,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2023-11-23 21:10:54,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2023-11-23 21:10:54,825 INFO L349 Elim1Store]: treesize reduction 24, result has 57.1 percent of original size [2023-11-23 21:10:54,826 INFO L378 Elim1Store]: Elim1 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 94 treesize of output 112 [2023-11-23 21:10:55,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:10:55,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 49 [2023-11-23 21:10:55,308 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 21:10:55,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 49 [2023-11-23 21:10:55,749 INFO L349 Elim1Store]: treesize reduction 48, result has 52.5 percent of original size [2023-11-23 21:10:55,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 684 treesize of output 704