./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:46:30,450 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:46:30,538 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:46:30,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:46:30,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:46:30,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:46:30,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:46:30,575 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:46:30,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:46:30,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:46:30,578 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:46:30,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:46:30,579 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:46:30,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:46:30,580 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:46:30,581 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:46:30,582 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:46:30,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:46:30,583 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:46:30,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:46:30,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:46:30,585 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:46:30,586 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:46:30,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:46:30,587 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:46:30,587 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:46:30,588 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:46:30,589 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:46:30,589 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:46:30,590 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:46:30,590 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:46:30,591 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:46:30,591 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:46:30,592 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:46:30,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:46:30,592 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:46:30,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:46:30,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:46:30,594 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:46:30,594 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu/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_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e0e4fff172a515598d076941b225a1a1f31b97f5ac14127a866784b10a4e3537 [2023-11-19 07:46:30,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:46:30,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:46:30,857 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:46:30,858 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:46:30,859 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:46:30,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2023-11-19 07:46:34,043 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:46:34,342 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:46:34,347 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i [2023-11-19 07:46:34,366 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu/data/bbb58c51a/5cd45b6f204c4cdd9de569e49101402b/FLAG5de14288e [2023-11-19 07:46:34,380 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu/data/bbb58c51a/5cd45b6f204c4cdd9de569e49101402b [2023-11-19 07:46:34,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:46:34,384 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:46:34,386 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:46:34,386 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:46:34,403 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:46:34,404 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:46:34" (1/1) ... [2023-11-19 07:46:34,405 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29c6bf27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:34, skipping insertion in model container [2023-11-19 07:46:34,406 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:46:34" (1/1) ... [2023-11-19 07:46:34,451 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:46:34,856 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_295b7a17-989c-44c5-ae32-57aec3ebc5ec/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i[24640,24653] [2023-11-19 07:46:34,863 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:46:34,873 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:46:34,944 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_295b7a17-989c-44c5-ae32-57aec3ebc5ec/sv-benchmarks/c/list-simple/dll2c_prepend_equal.i[24640,24653] [2023-11-19 07:46:34,948 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:46:34,986 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:46:34,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:34 WrapperNode [2023-11-19 07:46:34,987 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:46:34,989 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:46:34,989 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:46:34,989 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:46:34,997 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:34" (1/1) ... [2023-11-19 07:46:35,016 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:34" (1/1) ... [2023-11-19 07:46:35,043 INFO L138 Inliner]: procedures = 127, calls = 47, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 137 [2023-11-19 07:46:35,044 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:46:35,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:46:35,045 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:46:35,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:46:35,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:34" (1/1) ... [2023-11-19 07:46:35,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:34" (1/1) ... [2023-11-19 07:46:35,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:34" (1/1) ... [2023-11-19 07:46:35,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:34" (1/1) ... [2023-11-19 07:46:35,074 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:34" (1/1) ... [2023-11-19 07:46:35,078 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:34" (1/1) ... [2023-11-19 07:46:35,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:34" (1/1) ... [2023-11-19 07:46:35,082 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:34" (1/1) ... [2023-11-19 07:46:35,086 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:46:35,087 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:46:35,087 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:46:35,087 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:46:35,088 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:34" (1/1) ... [2023-11-19 07:46:35,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:46:35,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:46:35,133 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:46:35,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:46:35,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:46:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:46:35,183 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-19 07:46:35,183 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-19 07:46:35,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 07:46:35,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:46:35,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:46:35,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-19 07:46:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-19 07:46:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:46:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-19 07:46:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:46:35,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:46:35,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:46:35,361 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:46:35,364 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:46:35,777 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:46:35,785 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:46:35,785 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-19 07:46:35,789 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:46:35 BoogieIcfgContainer [2023-11-19 07:46:35,789 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:46:35,792 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:46:35,792 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:46:35,796 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:46:35,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:46:34" (1/3) ... [2023-11-19 07:46:35,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50180302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:46:35, skipping insertion in model container [2023-11-19 07:46:35,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:46:34" (2/3) ... [2023-11-19 07:46:35,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50180302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:46:35, skipping insertion in model container [2023-11-19 07:46:35,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:46:35" (3/3) ... [2023-11-19 07:46:35,800 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_equal.i [2023-11-19 07:46:35,819 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:46:35,819 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:46:35,869 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:46:35,876 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=PETRI_NET, 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;@1ddfed2b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:46:35,876 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-19 07:46:35,880 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:46:35,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-19 07:46:35,889 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:46:35,889 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:35,890 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:46:35,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:35,896 INFO L85 PathProgramCache]: Analyzing trace with hash 976010426, now seen corresponding path program 1 times [2023-11-19 07:46:35,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:35,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905330370] [2023-11-19 07:46:35,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:35,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:36,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:46:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:36,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:46:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:36,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 07:46:36,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:36,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905330370] [2023-11-19 07:46:36,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905330370] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:36,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:36,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:46:36,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797368090] [2023-11-19 07:46:36,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:36,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:46:36,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:36,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:46:36,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:46:36,321 INFO L87 Difference]: Start difference. First operand has 35 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 30 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:46:36,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:46:36,467 INFO L93 Difference]: Finished difference Result 61 states and 82 transitions. [2023-11-19 07:46:36,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:46:36,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-11-19 07:46:36,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:46:36,477 INFO L225 Difference]: With dead ends: 61 [2023-11-19 07:46:36,477 INFO L226 Difference]: Without dead ends: 27 [2023-11-19 07:46:36,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-19 07:46:36,486 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:46:36,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 64 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:46:36,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-19 07:46:36,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-11-19 07:46:36,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:46:36,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2023-11-19 07:46:36,533 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 24 [2023-11-19 07:46:36,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:46:36,535 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2023-11-19 07:46:36,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:46:36,536 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2023-11-19 07:46:36,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-19 07:46:36,538 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:46:36,538 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:36,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:46:36,539 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:46:36,540 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:36,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1442307826, now seen corresponding path program 1 times [2023-11-19 07:46:36,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:36,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438478667] [2023-11-19 07:46:36,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:36,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:36,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:36,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:46:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:36,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:46:36,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:36,922 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-19 07:46:36,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:36,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438478667] [2023-11-19 07:46:36,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438478667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:46:36,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:46:36,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:46:36,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972111154] [2023-11-19 07:46:36,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:46:36,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:46:36,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:36,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:46:36,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:46:36,928 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:46:37,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:46:37,075 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2023-11-19 07:46:37,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:46:37,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 24 [2023-11-19 07:46:37,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:46:37,077 INFO L225 Difference]: With dead ends: 50 [2023-11-19 07:46:37,077 INFO L226 Difference]: Without dead ends: 32 [2023-11-19 07:46:37,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:46:37,080 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:46:37,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 68 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:46:37,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-19 07:46:37,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2023-11-19 07:46:37,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-19 07:46:37,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2023-11-19 07:46:37,089 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 24 [2023-11-19 07:46:37,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:46:37,089 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2023-11-19 07:46:37,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-19 07:46:37,090 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2023-11-19 07:46:37,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-19 07:46:37,091 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:46:37,092 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:37,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:46:37,092 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:46:37,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:37,093 INFO L85 PathProgramCache]: Analyzing trace with hash 915772386, now seen corresponding path program 1 times [2023-11-19 07:46:37,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:37,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578447622] [2023-11-19 07:46:37,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:37,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:37,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:37,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:46:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:37,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:46:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:37,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:46:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 07:46:37,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:37,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578447622] [2023-11-19 07:46:37,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578447622] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:46:37,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210105600] [2023-11-19 07:46:37,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:37,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:46:37,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:46:37,963 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:46:37,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:46:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:38,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-19 07:46:38,215 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:46:38,370 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 8 treesize of output 4 [2023-11-19 07:46:38,416 WARN L876 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$.base| |node_create_~temp~0#1.base|))))) is different from true [2023-11-19 07:46:38,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:46:38,443 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 17 treesize of output 12 [2023-11-19 07:46:38,468 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 16 treesize of output 8 [2023-11-19 07:46:38,484 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-11-19 07:46:38,485 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:46:38,532 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_7| Int) (v_ArrVal_420 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_7| v_ArrVal_420) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 0)) (< |c_#StackHeapBarrier| (+ |v_node_create_~temp~0#1.base_7| 1)))) is different from false [2023-11-19 07:46:38,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210105600] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:46:38,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:46:38,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 20 [2023-11-19 07:46:38,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145150252] [2023-11-19 07:46:38,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:46:38,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-19 07:46:38,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:38,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-19 07:46:38,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=293, Unknown=2, NotChecked=70, Total=420 [2023-11-19 07:46:38,538 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 20 states, 18 states have (on average 2.0) internal successors, (36), 15 states have internal predecessors, (36), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 07:46:39,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:46:39,277 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2023-11-19 07:46:39,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-19 07:46:39,279 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.0) internal successors, (36), 15 states have internal predecessors, (36), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2023-11-19 07:46:39,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:46:39,280 INFO L225 Difference]: With dead ends: 55 [2023-11-19 07:46:39,280 INFO L226 Difference]: Without dead ends: 32 [2023-11-19 07:46:39,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=556, Unknown=2, NotChecked=98, Total=756 [2023-11-19 07:46:39,283 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 32 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-19 07:46:39,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 182 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 36 Unchecked, 0.6s Time] [2023-11-19 07:46:39,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-19 07:46:39,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2023-11-19 07:46:39,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 07:46:39,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2023-11-19 07:46:39,305 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 34 [2023-11-19 07:46:39,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:46:39,306 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2023-11-19 07:46:39,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.0) internal successors, (36), 15 states have internal predecessors, (36), 3 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-11-19 07:46:39,307 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2023-11-19 07:46:39,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-19 07:46:39,309 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:46:39,309 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:46:39,336 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:46:39,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:46:39,531 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:46:39,531 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:46:39,531 INFO L85 PathProgramCache]: Analyzing trace with hash 917619428, now seen corresponding path program 1 times [2023-11-19 07:46:39,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:46:39,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855814893] [2023-11-19 07:46:39,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:39,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:46:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:42,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:46:42,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:42,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:46:42,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:42,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:46:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:43,229 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 07:46:43,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:46:43,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855814893] [2023-11-19 07:46:43,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855814893] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:46:43,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824779953] [2023-11-19 07:46:43,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:46:43,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:46:43,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:46:43,233 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:46:43,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:46:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:46:43,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 120 conjunts are in the unsatisfiable core [2023-11-19 07:46:43,464 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:46:43,476 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-19 07:46:43,533 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 5 treesize of output 3 [2023-11-19 07:46:43,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:46:43,682 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 12 treesize of output 14 [2023-11-19 07:46:43,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:46:43,853 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 11 treesize of output 7 [2023-11-19 07:46:44,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:46:44,066 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-19 07:46:44,066 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-19 07:46:44,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:46:44,488 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 22 treesize of output 22 [2023-11-19 07:46:44,495 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 12 treesize of output 1 [2023-11-19 07:46:44,782 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-19 07:46:44,783 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 27 [2023-11-19 07:46:44,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-19 07:46:44,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:46:44,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-19 07:46:44,929 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-19 07:46:45,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:46:45,078 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-19 07:46:45,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:46:45,102 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-19 07:46:45,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 51 [2023-11-19 07:46:45,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:46:45,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:46:45,154 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-19 07:46:45,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-11-19 07:46:45,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:46:45,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:46:45,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:46:45,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:46:45,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:46:45,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 17 [2023-11-19 07:46:45,540 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-19 07:46:45,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 158 treesize of output 83 [2023-11-19 07:46:45,552 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2023-11-19 07:46:45,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:46:45,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:46:45,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 11 [2023-11-19 07:46:45,592 INFO L349 Elim1Store]: treesize reduction 97, result has 4.9 percent of original size [2023-11-19 07:46:45,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 112 treesize of output 84 [2023-11-19 07:46:45,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 37 treesize of output 15 [2023-11-19 07:46:45,609 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 18 treesize of output 14 [2023-11-19 07:46:45,681 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 28 treesize of output 16 [2023-11-19 07:46:45,685 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 7 treesize of output 3 [2023-11-19 07:46:45,794 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:46:45,794 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:46:45,879 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_696 Int) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_702 Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) (+ (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_701))) (store (store (store .cse0 .cse1 v_ArrVal_705) .cse2 v_ArrVal_703) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select (store (store (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| v_ArrVal_702)) .cse1 v_ArrVal_705) .cse2 v_ArrVal_703) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset| 4) v_ArrVal_696))) (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base|)) .cse1 v_ArrVal_704) .cse2 v_ArrVal_706) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offset|)) .cse1 v_ArrVal_698) .cse2 v_ArrVal_695) |c_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.base| v_ArrVal_699) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))))) is different from false [2023-11-19 07:46:47,911 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_696 Int) (v_ArrVal_701 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_703 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_ArrVal_702 Int) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse1) (+ (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|) 4)))) (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_701))) (store (store (store .cse0 .cse1 v_ArrVal_705) .cse2 v_ArrVal_703) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select (store (store (store .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| v_ArrVal_702)) .cse1 v_ArrVal_705) .cse2 v_ArrVal_703) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|) (+ |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset| 4) v_ArrVal_696))) (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base|)) .cse1 v_ArrVal_704) .cse2 v_ArrVal_706) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.offset|)) .cse1 v_ArrVal_698) .cse2 v_ArrVal_695) |c_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base| v_ArrVal_699) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8))))))) is different from false [2023-11-19 07:46:48,232 INFO L349 Elim1Store]: treesize reduction 233, result has 51.3 percent of original size [2023-11-19 07:46:48,233 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 11662 treesize of output 11550 [2023-11-19 07:46:48,377 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:46:48,378 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 6384 treesize of output 6372 [2023-11-19 07:46:48,463 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 9076 treesize of output 8554 [2023-11-19 07:46:48,641 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 9506 treesize of output 8346 [2023-11-19 07:46:48,725 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 9322 treesize of output 8742 [2023-11-19 07:46:48,835 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 62 treesize of output 4 [2023-11-19 07:46:52,256 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:46:52,257 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 4143 treesize of output 4029 [2023-11-19 07:46:55,031 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 44 treesize of output 40 [2023-11-19 07:46:57,161 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse9 (= |c_ULTIMATE.start_main_~data~0#1| |c_ULTIMATE.start_dll_circular_prepend_~data#1|))) (and (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| 1)) (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_715))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse4 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse1 (select (select .cse5 .cse3) (+ 4 (select .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))))) (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_694 (Array Int Int))) (let ((.cse0 (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) .cse3 v_ArrVal_704) .cse1 v_ArrVal_706) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse0 .cse1)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| .cse0)))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| 0)) .cse3 v_ArrVal_698) .cse1 v_ArrVal_695) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_699) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))))) (or (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| 1)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (select (select (store (let ((.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_715))) (let ((.cse6 (select .cse8 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse6 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) .cse7 v_ArrVal_704) (select (select .cse8 .cse7) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) v_ArrVal_706)))) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) .cse9) (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| Int)) (or (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_715))) (let ((.cse14 (select .cse15 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse11 (select .cse14 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse10 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse12 (select (select .cse15 .cse11) (+ 4 (select .cse10 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))))) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse10 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| 0)) .cse11 v_ArrVal_698) .cse12 v_ArrVal_695) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_699) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_694 (Array Int Int))) (let ((.cse13 (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse14 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) .cse11 v_ArrVal_704) .cse12 v_ArrVal_706) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse13 |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| .cse13)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| 1)))) (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) 0)) (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (let ((.cse21 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_715))) (let ((.cse18 (select .cse21 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse16 (select .cse18 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse20 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse19 (select (select .cse21 .cse16) (+ 4 (select .cse20 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))))) (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_694 (Array Int Int))) (let ((.cse17 (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse18 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) .cse16 v_ArrVal_704) .cse19 v_ArrVal_706) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse16 .cse17)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| .cse17)))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse20 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| 0)) .cse16 v_ArrVal_698) .cse19 v_ArrVal_695) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_699) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| 1)))) (or (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (v_arrayElimCell_45 Int)) (let ((.cse23 (select v_ArrVal_715 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (or (let ((.cse22 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_715) .cse23) (+ 4 v_arrayElimCell_45)))) (= .cse22 (select (select (store (store (store |c_#memory_$Pointer$.base| .cse23 v_ArrVal_704) .cse22 v_ArrVal_706) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| .cse23)))) (< |c_#StackHeapBarrier| (+ |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| 1)) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) 0))) (or (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_694 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| Int)) (let ((.cse27 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_715))) (let ((.cse24 (select .cse27 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse25 (select .cse24 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (or (let ((.cse26 (select (select .cse27 .cse25) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse24 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) .cse25 v_ArrVal_704) .cse26 v_ArrVal_706) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse26)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| 1)) (= .cse25 |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)))))) .cse9) (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| 1)) (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (let ((.cse32 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_715))) (let ((.cse28 (select .cse32 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse29 (select .cse28 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse31 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse30 (select (select .cse32 .cse29) (+ 4 (select .cse31 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))))) (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_694 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse28 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) .cse29 v_ArrVal_704) .cse30 v_ArrVal_706) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse31 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| 0)) .cse29 v_ArrVal_698) .cse30 v_ArrVal_695) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_699) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))))) (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| 1)) (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_694 (Array Int Int))) (let ((.cse36 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_715))) (let ((.cse35 (select .cse36 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse33 (select .cse35 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (let ((.cse34 (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse35 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) .cse33 v_ArrVal_704) (select (select .cse36 .cse33) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) v_ArrVal_706) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse33 .cse34)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| .cse34))))))))) (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| 1)) (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_694 (Array Int Int))) (not (let ((.cse40 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_715))) (let ((.cse37 (select .cse40 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse38 (select .cse37 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (let ((.cse39 (select (select .cse40 .cse38) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse37 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) .cse38 v_ArrVal_704) .cse39 v_ArrVal_706) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse39))))))))) (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| 1)) (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (let ((.cse46 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_715))) (let ((.cse43 (select .cse46 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse44 (select .cse43 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse45 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse42 (select (select .cse46 .cse44) (+ 4 (select .cse45 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))))) (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_694 (Array Int Int))) (let ((.cse41 (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse43 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) .cse44 v_ArrVal_704) .cse42 v_ArrVal_706) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse41 .cse42) (= .cse41 |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse45 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| 0)) .cse44 v_ArrVal_698) .cse42 v_ArrVal_695) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_699) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))))) (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| Int)) (or (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_694 (Array Int Int))) (let ((.cse51 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_715))) (let ((.cse50 (select .cse51 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse49 (select .cse50 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (let ((.cse48 (select (select .cse51 .cse49) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))))) (let ((.cse47 (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse50 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) .cse49 v_ArrVal_704) .cse48 v_ArrVal_706) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse47 .cse48) (= .cse47 |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) (= .cse49 .cse47)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| 1)))) (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| 1)) (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_694 (Array Int Int))) (let ((.cse52 (select (select (store (let ((.cse55 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_715))) (let ((.cse53 (select .cse55 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse54 (select .cse53 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse53 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) .cse54 v_ArrVal_704) (select (select .cse55 .cse54) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) v_ArrVal_706)))) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse52 |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| .cse52)))))) (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| Int)) (or (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_694 (Array Int Int))) (let ((.cse60 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_715))) (let ((.cse58 (select .cse60 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse59 (select .cse58 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (let ((.cse57 (select (select .cse60 .cse59) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))))) (let ((.cse56 (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse58 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) .cse59 v_ArrVal_704) .cse57 v_ArrVal_706) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse56 .cse57) (= .cse56 |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| 1)))) (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| Int)) (or (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_694 (Array Int Int))) (let ((.cse65 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_715))) (let ((.cse63 (select .cse65 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse64 (select .cse63 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (let ((.cse62 (select (select .cse65 .cse64) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))))) (let ((.cse61 (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse63 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) .cse64 v_ArrVal_704) .cse62 v_ArrVal_706) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (not (= .cse61 .cse62)) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| .cse61)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| 1)))) (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| Int)) (or (forall ((v_ArrVal_715 (Array Int Int))) (let ((.cse70 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_715))) (let ((.cse69 (select .cse70 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse66 (select .cse69 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (or (not (= .cse66 |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (let ((.cse67 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse68 (select (select .cse70 .cse66) (+ 4 (select .cse67 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))))) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse67 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| 0)) .cse66 v_ArrVal_698) .cse68 v_ArrVal_695) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_699) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_694 (Array Int Int))) (not (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse69 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) .cse66 v_ArrVal_704) .cse68 v_ArrVal_706) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)))))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| 1)))) (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| Int)) (or (forall ((v_ArrVal_715 (Array Int Int))) (let ((.cse75 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_715))) (let ((.cse71 (select .cse75 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse72 (select .cse71 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_694 (Array Int Int))) (let ((.cse74 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse73 (select (select .cse75 .cse72) (+ 4 (select .cse74 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))))) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse71 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) .cse72 v_ArrVal_704) .cse73 v_ArrVal_706) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse73) (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (not (= (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse74 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| 0)) .cse72 v_ArrVal_698) .cse73 v_ArrVal_695) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_699) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) 0))))))) (= .cse72 |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| 1)))) (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| 1)) (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_694 (Array Int Int))) (let ((.cse80 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_715))) (let ((.cse76 (select .cse80 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse77 (select .cse76 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse79 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse78 (select (select .cse80 .cse77) (+ 4 (select .cse79 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))))) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse76 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) .cse77 v_ArrVal_704) .cse78 v_ArrVal_706) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse78) (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (not (= (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse79 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| 0)) .cse77 v_ArrVal_698) .cse78 v_ArrVal_695) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_699) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) 0))))))))))) (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| 1)) (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (let ((.cse84 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_715))) (let ((.cse83 (select (select .cse84 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse82 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse81 (select (select .cse84 .cse83) (+ 4 (select .cse82 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))))) (or (not (= |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| .cse81)) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse82 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| 0)) .cse83 v_ArrVal_698) .cse81 v_ArrVal_695) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_699) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))))) (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| 1)) (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (let ((.cse89 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_715))) (let ((.cse85 (select .cse89 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse86 (select .cse85 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse88 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse87 (select (select .cse89 .cse86) (+ 4 (select .cse88 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))))) (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_694 (Array Int Int))) (not (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse85 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) .cse86 v_ArrVal_704) .cse87 v_ArrVal_706) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse87))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse88 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| 0)) .cse86 v_ArrVal_698) .cse87 v_ArrVal_695) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_699) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))))) (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| Int)) (or (forall ((v_ArrVal_715 (Array Int Int))) (let ((.cse93 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_715))) (let ((.cse91 (select .cse93 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse90 (select .cse91 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (or (not (= .cse90 |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_694 (Array Int Int))) (let ((.cse92 (select (select .cse93 .cse90) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse91 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) .cse90 v_ArrVal_704) .cse92 v_ArrVal_706) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse92)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| 1)))) (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| Int)) (or (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int))) (not (= |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| (select (let ((.cse94 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_715))) (select .cse94 (select (select .cse94 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| 1)))) (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| 1)) (forall ((v_ArrVal_715 (Array Int Int))) (let ((.cse99 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_715))) (let ((.cse98 (select .cse99 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse95 (select .cse98 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (or (not (= .cse95 |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (let ((.cse96 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse97 (select (select .cse99 .cse95) (+ 4 (select .cse96 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))))) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse96 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| 0)) .cse95 v_ArrVal_698) .cse97 v_ArrVal_695) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_699) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_694 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse98 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) .cse95 v_ArrVal_704) .cse97 v_ArrVal_706) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse97))))))))))))) (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| 1)) (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (let ((.cse104 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_715))) (let ((.cse103 (select .cse104 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse101 (select .cse103 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse100 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse102 (select (select .cse104 .cse101) (+ 4 (select .cse100 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))))) (or (not (= (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse100 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| 0)) .cse101 v_ArrVal_698) .cse102 v_ArrVal_695) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_699) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4) 0)) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_694 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse103 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) .cse101 v_ArrVal_704) .cse102 v_ArrVal_706) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))))) (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| Int)) (or (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (let ((.cse109 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_715))) (let ((.cse105 (select .cse109 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse106 (select .cse105 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse108 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse107 (select (select .cse109 .cse106) (+ 4 (select .cse108 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))))) (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_694 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse105 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) .cse106 v_ArrVal_704) .cse107 v_ArrVal_706) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (+ (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse108 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| 0)) .cse106 v_ArrVal_698) .cse107 v_ArrVal_695) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_699) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 8) 0)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| 1)))) (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| 1)) (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_715 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (let ((.cse115 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_715))) (let ((.cse113 (select .cse115 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse112 (select .cse113 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse114 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse111 (select (select .cse115 .cse112) (+ 4 (select .cse114 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))))) (or (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_694 (Array Int Int))) (let ((.cse110 (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse113 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) .cse112 v_ArrVal_704) .cse111 v_ArrVal_706) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (or (= .cse110 .cse111) (= .cse110 |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) (= .cse112 .cse110)))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse114 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| 0)) .cse112 v_ArrVal_698) .cse111 v_ArrVal_695) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_699) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))))))))) (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| Int)) (or (forall ((v_ArrVal_715 (Array Int Int)) (v_ArrVal_704 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_694 (Array Int Int))) (let ((.cse120 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_715))) (let ((.cse116 (select .cse120 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse117 (select .cse116 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|)) (.cse119 (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse118 (select (select .cse120 .cse117) (+ 4 (select .cse119 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))))) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse116 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) .cse117 v_ArrVal_704) .cse118 v_ArrVal_706) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) .cse118) (= .cse117 |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) (forall ((v_ArrVal_699 (Array Int Int)) (v_ArrVal_695 (Array Int Int)) (v_ArrVal_698 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse119 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| 0)) .cse117 v_ArrVal_698) .cse118 v_ArrVal_695) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_699) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| 1)))) (forall ((|v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| 1)) (forall ((v_ArrVal_715 (Array Int Int))) (let ((.cse123 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_715))) (let ((.cse122 (select .cse123 |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|))) (let ((.cse121 (select .cse122 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) (or (not (= .cse121 |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) (forall ((v_ArrVal_704 (Array Int Int)) (v_ArrVal_714 (Array Int Int)) (v_ArrVal_706 (Array Int Int)) (v_ArrVal_694 (Array Int Int))) (not (= (select (select (store (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_prepend_~head#1.base| (store .cse122 |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)) .cse121 v_ArrVal_704) (select (select .cse123 .cse121) (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_714) |c_ULTIMATE.start_dll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_dll_circular_prepend_~head#1.offset|))) v_ArrVal_706) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13| v_ArrVal_694) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) |v_ULTIMATE.start_dll_circular_prepend_#t~ret9#1.base_13|)))))))))))) is different from true [2023-11-19 07:46:57,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824779953] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:46:57,175 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:46:57,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2023-11-19 07:46:57,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999403965] [2023-11-19 07:46:57,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-19 07:46:57,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-19 07:46:57,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:46:57,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-19 07:46:57,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1671, Unknown=3, NotChecked=252, Total=2070 [2023-11-19 07:46:57,180 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 42 states, 38 states have (on average 1.394736842105263) internal successors, (53), 33 states have internal predecessors, (53), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:47:00,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:47:00,416 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2023-11-19 07:47:00,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-19 07:47:00,417 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 38 states have (on average 1.394736842105263) internal successors, (53), 33 states have internal predecessors, (53), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2023-11-19 07:47:00,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:47:00,418 INFO L225 Difference]: With dead ends: 36 [2023-11-19 07:47:00,418 INFO L226 Difference]: Without dead ends: 34 [2023-11-19 07:47:00,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=253, Invalid=2618, Unknown=3, NotChecked=318, Total=3192 [2023-11-19 07:47:00,421 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:47:00,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 258 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-19 07:47:00,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-11-19 07:47:00,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2023-11-19 07:47:00,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-19 07:47:00,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2023-11-19 07:47:00,430 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 34 [2023-11-19 07:47:00,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:47:00,431 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2023-11-19 07:47:00,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 38 states have (on average 1.394736842105263) internal successors, (53), 33 states have internal predecessors, (53), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-19 07:47:00,432 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2023-11-19 07:47:00,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-11-19 07:47:00,433 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:47:00,433 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:47:00,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:47:00,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-11-19 07:47:00,652 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-19 07:47:00,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:47:00,652 INFO L85 PathProgramCache]: Analyzing trace with hash -665604212, now seen corresponding path program 1 times [2023-11-19 07:47:00,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:47:00,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12494490] [2023-11-19 07:47:00,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:00,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:47:00,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:03,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-19 07:47:03,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:03,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-19 07:47:03,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:03,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-19 07:47:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:03,668 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-19 07:47:03,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:47:03,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12494490] [2023-11-19 07:47:03,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12494490] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:47:03,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196837238] [2023-11-19 07:47:03,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:47:03,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:47:03,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:47:03,673 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:47:03,695 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_295b7a17-989c-44c5-ae32-57aec3ebc5ec/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 07:47:03,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:47:03,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 97 conjunts are in the unsatisfiable core [2023-11-19 07:47:03,907 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:47:03,919 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-19 07:47:04,208 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 5 treesize of output 3 [2023-11-19 07:47:04,408 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-19 07:47:04,409 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-19 07:47:04,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:47:04,819 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 22 treesize of output 22 [2023-11-19 07:47:04,825 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 12 treesize of output 1 [2023-11-19 07:47:05,107 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-19 07:47:05,108 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 28 [2023-11-19 07:47:05,118 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 11 treesize of output 7 [2023-11-19 07:47:05,124 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 7 treesize of output 3 [2023-11-19 07:47:05,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:47:05,347 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-19 07:47:05,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 52 [2023-11-19 07:47:05,387 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-19 07:47:05,388 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 28 treesize of output 30 [2023-11-19 07:47:05,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:47:05,408 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-19 07:47:05,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:47:05,734 INFO L349 Elim1Store]: treesize reduction 98, result has 6.7 percent of original size [2023-11-19 07:47:05,735 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 210 treesize of output 122 [2023-11-19 07:47:05,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:47:05,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:47:06,307 INFO L349 Elim1Store]: treesize reduction 1015, result has 13.0 percent of original size [2023-11-19 07:47:06,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 11 new quantified variables, introduced 29 case distinctions, treesize of input 1034 treesize of output 608 [2023-11-19 07:47:06,323 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 9 treesize of output 7 [2023-11-19 07:47:06,354 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2023-11-19 07:47:06,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:47:06,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:47:06,406 INFO L349 Elim1Store]: treesize reduction 88, result has 5.4 percent of original size [2023-11-19 07:47:06,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 521 treesize of output 429 [2023-11-19 07:47:06,427 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 88 treesize of output 72 [2023-11-19 07:47:06,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:47:06,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:47:06,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:47:06,460 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:47:06,473 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:47:06,481 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:47:06,489 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 143 [2023-11-19 07:47:06,555 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 343 treesize of output 230 [2023-11-19 07:47:06,652 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-19 07:47:06,766 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 293 treesize of output 265 [2023-11-19 07:47:07,220 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 288 treesize of output 260 [2023-11-19 07:47:07,634 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 290 treesize of output 262 [2023-11-19 07:47:09,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:47:09,619 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 186 treesize of output 142 [2023-11-19 07:47:09,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:47:09,966 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 32 treesize of output 30 [2023-11-19 07:47:10,235 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 50 treesize of output 26 [2023-11-19 07:47:10,310 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 49 treesize of output 25 [2023-11-19 07:47:10,449 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 72 treesize of output 36 [2023-11-19 07:47:10,501 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 62 treesize of output 32 [2023-11-19 07:47:11,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:47:11,079 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 225 treesize of output 183 [2023-11-19 07:47:11,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:47:11,578 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 230 treesize of output 186 [2023-11-19 07:47:12,310 INFO L349 Elim1Store]: treesize reduction 47, result has 28.8 percent of original size [2023-11-19 07:47:12,311 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 201 treesize of output 137 [2023-11-19 07:47:12,450 INFO L349 Elim1Store]: treesize reduction 47, result has 28.8 percent of original size [2023-11-19 07:47:12,451 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 279 treesize of output 225 [2023-11-19 07:47:12,689 INFO L349 Elim1Store]: treesize reduction 47, result has 28.8 percent of original size [2023-11-19 07:47:12,689 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 1008 treesize of output 758 [2023-11-19 07:47:13,537 INFO L349 Elim1Store]: treesize reduction 47, result has 28.8 percent of original size [2023-11-19 07:47:13,538 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 196 treesize of output 134 [2023-11-19 07:47:13,772 INFO L349 Elim1Store]: treesize reduction 47, result has 28.8 percent of original size [2023-11-19 07:47:13,773 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 211 treesize of output 141 [2023-11-19 07:47:13,839 INFO L349 Elim1Store]: treesize reduction 47, result has 28.8 percent of original size [2023-11-19 07:47:13,840 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 206 treesize of output 138 [2023-11-19 07:47:14,137 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 225 treesize of output 154 [2023-11-19 07:47:14,215 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 177 treesize of output 106 [2023-11-19 07:47:14,278 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 167 treesize of output 102 [2023-11-19 07:47:14,320 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 194 treesize of output 117 [2023-11-19 07:47:14,408 INFO L349 Elim1Store]: treesize reduction 47, result has 28.8 percent of original size [2023-11-19 07:47:14,409 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 211 treesize of output 141 [2023-11-19 07:47:14,477 INFO L349 Elim1Store]: treesize reduction 47, result has 28.8 percent of original size [2023-11-19 07:47:14,478 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 206 treesize of output 138 [2023-11-19 07:47:14,592 INFO L349 Elim1Store]: treesize reduction 47, result has 28.8 percent of original size [2023-11-19 07:47:14,593 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 223 treesize of output 149 [2023-11-19 07:47:14,758 INFO L349 Elim1Store]: treesize reduction 47, result has 28.8 percent of original size [2023-11-19 07:47:14,759 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 219 treesize of output 149 [2023-11-19 07:47:15,237 INFO L349 Elim1Store]: treesize reduction 47, result has 28.8 percent of original size [2023-11-19 07:47:15,237 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 173 treesize of output 125 [2023-11-19 07:47:15,313 INFO L349 Elim1Store]: treesize reduction 47, result has 28.8 percent of original size [2023-11-19 07:47:15,314 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 201 treesize of output 141 [2023-11-19 07:47:15,484 INFO L349 Elim1Store]: treesize reduction 47, result has 28.8 percent of original size [2023-11-19 07:47:15,484 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 231 treesize of output 177 [2023-11-19 07:47:15,570 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 225 treesize of output 154 [2023-11-19 07:47:15,618 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 167 treesize of output 102 [2023-11-19 07:47:15,748 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 177 treesize of output 106 [2023-11-19 07:47:15,815 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 194 treesize of output 117 [2023-11-19 07:47:16,200 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 177 treesize of output 106 [2023-11-19 07:47:16,494 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 181 treesize of output 110 [2023-11-19 07:47:16,545 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 191 treesize of output 114 [2023-11-19 07:47:16,668 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 167 treesize of output 102 [2023-11-19 07:47:16,740 INFO L349 Elim1Store]: treesize reduction 47, result has 28.8 percent of original size [2023-11-19 07:47:16,740 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 183 treesize of output 129 [2023-11-19 07:47:16,818 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 167 treesize of output 102 [2023-11-19 07:47:16,912 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 167 treesize of output 102