./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 71fe950642bac282d48da6f500677ae534e71a907f9a56d9941372cc95f40daa --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:53:05,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:53:05,413 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-08 17:53:05,422 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:53:05,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:53:05,452 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:53:05,453 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:53:05,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:53:05,454 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:53:05,454 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:53:05,455 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:53:05,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:53:05,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:53:05,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:53:05,457 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:53:05,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:53:05,458 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:53:05,458 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:53:05,459 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:53:05,459 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:53:05,460 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 17:53:05,460 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 17:53:05,461 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 17:53:05,461 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:53:05,462 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:53:05,462 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:53:05,463 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 17:53:05,463 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:53:05,464 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:53:05,464 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:53:05,464 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:53:05,465 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:53:05,465 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:53:05,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:53:05,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:53:05,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:53:05,467 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:53:05,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:53:05,468 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:53:05,468 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:53:05,468 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:53:05,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:53:05,473 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_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/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_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 71fe950642bac282d48da6f500677ae534e71a907f9a56d9941372cc95f40daa [2024-11-08 17:53:05,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:53:05,886 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:53:05,890 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:53:05,892 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:53:05,892 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:53:05,894 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i Unable to find full path for "g++" [2024-11-08 17:53:08,356 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:53:08,783 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:53:08,784 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-1.i [2024-11-08 17:53:08,816 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/data/2620351e3/4ed5baa267a741eea6f83691d9fc69bf/FLAGb029051ba [2024-11-08 17:53:08,844 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/data/2620351e3/4ed5baa267a741eea6f83691d9fc69bf [2024-11-08 17:53:08,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:53:08,849 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:53:08,852 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:53:08,852 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:53:08,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:53:08,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:53:08" (1/1) ... [2024-11-08 17:53:08,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c443bef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:53:08, skipping insertion in model container [2024-11-08 17:53:08,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:53:08" (1/1) ... [2024-11-08 17:53:08,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:53:09,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:53:09,529 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:53:09,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:53:09,631 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:53:09,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:53:09 WrapperNode [2024-11-08 17:53:09,631 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:53:09,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:53:09,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:53:09,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:53:09,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:53:09" (1/1) ... [2024-11-08 17:53:09,670 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:53:09" (1/1) ... [2024-11-08 17:53:09,712 INFO L138 Inliner]: procedures = 122, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 94 [2024-11-08 17:53:09,717 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:53:09,718 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:53:09,718 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:53:09,721 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:53:09,735 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:53:09" (1/1) ... [2024-11-08 17:53:09,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:53:09" (1/1) ... [2024-11-08 17:53:09,739 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:53:09" (1/1) ... [2024-11-08 17:53:09,761 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2024-11-08 17:53:09,761 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:53:09" (1/1) ... [2024-11-08 17:53:09,761 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:53:09" (1/1) ... [2024-11-08 17:53:09,775 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:53:09" (1/1) ... [2024-11-08 17:53:09,783 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:53:09" (1/1) ... [2024-11-08 17:53:09,789 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:53:09" (1/1) ... [2024-11-08 17:53:09,791 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:53:09" (1/1) ... [2024-11-08 17:53:09,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:53:09,803 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:53:09,803 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:53:09,803 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:53:09,804 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:53:09" (1/1) ... [2024-11-08 17:53:09,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:53:09,834 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:53:09,849 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:53:09,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:53:09,897 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-08 17:53:09,898 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-08 17:53:09,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 17:53:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 17:53:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 17:53:09,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 17:53:09,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 17:53:09,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:53:09,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 17:53:09,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 17:53:09,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 17:53:09,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 17:53:09,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 17:53:09,902 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:53:09,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 17:53:09,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:53:09,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:53:10,063 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:53:10,066 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:53:10,092 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-08 17:53:10,106 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-08 17:53:10,463 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: assume !false; [2024-11-08 17:53:10,463 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##29: assume false; [2024-11-08 17:53:10,463 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume !false; [2024-11-08 17:53:10,463 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume false; [2024-11-08 17:53:10,464 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false; [2024-11-08 17:53:10,494 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2024-11-08 17:53:10,494 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:53:10,511 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:53:10,512 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-08 17:53:10,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:53:10 BoogieIcfgContainer [2024-11-08 17:53:10,512 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:53:10,516 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:53:10,516 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:53:10,520 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:53:10,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:53:08" (1/3) ... [2024-11-08 17:53:10,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cfd66b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:53:10, skipping insertion in model container [2024-11-08 17:53:10,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:53:09" (2/3) ... [2024-11-08 17:53:10,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cfd66b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:53:10, skipping insertion in model container [2024-11-08 17:53:10,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:53:10" (3/3) ... [2024-11-08 17:53:10,524 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-1.i [2024-11-08 17:53:10,549 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:53:10,550 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2024-11-08 17:53:10,613 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:53:10,623 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@29d14cfd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:53:10,624 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2024-11-08 17:53:10,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 41 states have (on average 2.024390243902439) internal successors, (83), 74 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:10,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 17:53:10,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:53:10,644 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 17:53:10,645 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-08 17:53:10,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:53:10,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2024-11-08 17:53:10,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:53:10,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135877819] [2024-11-08 17:53:10,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:10,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:53:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:10,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:53:10,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:53:10,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135877819] [2024-11-08 17:53:10,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135877819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:53:10,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:53:10,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:53:10,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538755182] [2024-11-08 17:53:10,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:53:10,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:53:10,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:53:10,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:53:10,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:53:10,999 INFO L87 Difference]: Start difference. First operand has 76 states, 41 states have (on average 2.024390243902439) internal successors, (83), 74 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:11,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:53:11,182 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2024-11-08 17:53:11,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:53:11,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-08 17:53:11,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:53:11,198 INFO L225 Difference]: With dead ends: 72 [2024-11-08 17:53:11,198 INFO L226 Difference]: Without dead ends: 66 [2024-11-08 17:53:11,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:53:11,204 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 23 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:53:11,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 87 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:53:11,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-08 17:53:11,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-08 17:53:11,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 38 states have (on average 1.868421052631579) internal successors, (71), 65 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:11,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2024-11-08 17:53:11,262 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 4 [2024-11-08 17:53:11,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:53:11,263 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2024-11-08 17:53:11,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:11,264 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2024-11-08 17:53:11,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 17:53:11,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:53:11,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 17:53:11,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:53:11,268 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-08 17:53:11,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:53:11,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2024-11-08 17:53:11,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:53:11,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848921653] [2024-11-08 17:53:11,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:11,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:53:11,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:53:11,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:53:11,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848921653] [2024-11-08 17:53:11,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848921653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:53:11,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:53:11,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:53:11,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068999495] [2024-11-08 17:53:11,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:53:11,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:53:11,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:53:11,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:53:11,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:53:11,503 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:53:11,605 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2024-11-08 17:53:11,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:53:11,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-08 17:53:11,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:53:11,607 INFO L225 Difference]: With dead ends: 62 [2024-11-08 17:53:11,608 INFO L226 Difference]: Without dead ends: 62 [2024-11-08 17:53:11,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:53:11,610 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 21 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:53:11,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 80 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:53:11,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-08 17:53:11,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-08 17:53:11,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.763157894736842) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2024-11-08 17:53:11,620 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 4 [2024-11-08 17:53:11,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:53:11,621 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2024-11-08 17:53:11,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:11,622 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2024-11-08 17:53:11,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 17:53:11,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:53:11,623 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:53:11,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:53:11,624 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-08 17:53:11,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:53:11,625 INFO L85 PathProgramCache]: Analyzing trace with hash -401961688, now seen corresponding path program 1 times [2024-11-08 17:53:11,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:53:11,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428895607] [2024-11-08 17:53:11,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:11,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:53:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:11,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:53:11,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:53:11,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428895607] [2024-11-08 17:53:11,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428895607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:53:11,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:53:11,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:53:11,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653878581] [2024-11-08 17:53:11,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:53:11,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:53:11,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:53:11,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:53:11,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:53:11,876 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:11,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:53:11,925 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2024-11-08 17:53:11,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:53:11,926 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-08 17:53:11,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:53:11,927 INFO L225 Difference]: With dead ends: 75 [2024-11-08 17:53:11,927 INFO L226 Difference]: Without dead ends: 75 [2024-11-08 17:53:11,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:53:11,929 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 12 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:53:11,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 119 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:53:11,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-08 17:53:11,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 64. [2024-11-08 17:53:11,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.725) internal successors, (69), 63 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:11,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2024-11-08 17:53:11,944 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 10 [2024-11-08 17:53:11,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:53:11,944 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2024-11-08 17:53:11,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:11,945 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2024-11-08 17:53:11,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 17:53:11,946 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:53:11,946 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:53:11,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:53:11,947 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-08 17:53:11,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:53:11,948 INFO L85 PathProgramCache]: Analyzing trace with hash 423353848, now seen corresponding path program 1 times [2024-11-08 17:53:11,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:53:11,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318821917] [2024-11-08 17:53:11,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:11,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:53:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:12,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:53:12,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:53:12,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318821917] [2024-11-08 17:53:12,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318821917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:53:12,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:53:12,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:53:12,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321242530] [2024-11-08 17:53:12,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:53:12,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:53:12,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:53:12,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:53:12,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:53:12,133 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:12,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:53:12,243 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2024-11-08 17:53:12,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:53:12,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-08 17:53:12,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:53:12,245 INFO L225 Difference]: With dead ends: 62 [2024-11-08 17:53:12,245 INFO L226 Difference]: Without dead ends: 62 [2024-11-08 17:53:12,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:53:12,247 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 5 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:53:12,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 88 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:53:12,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-08 17:53:12,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-08 17:53:12,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.675) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2024-11-08 17:53:12,266 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 11 [2024-11-08 17:53:12,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:53:12,267 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2024-11-08 17:53:12,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:12,267 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2024-11-08 17:53:12,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 17:53:12,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:53:12,268 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:53:12,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:53:12,273 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-08 17:53:12,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:53:12,274 INFO L85 PathProgramCache]: Analyzing trace with hash 423353849, now seen corresponding path program 1 times [2024-11-08 17:53:12,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:53:12,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68400868] [2024-11-08 17:53:12,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:12,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:53:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:12,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:53:12,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:53:12,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68400868] [2024-11-08 17:53:12,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68400868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:53:12,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:53:12,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:53:12,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620952747] [2024-11-08 17:53:12,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:53:12,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:53:12,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:53:12,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:53:12,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:53:12,437 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:12,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:53:12,517 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2024-11-08 17:53:12,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:53:12,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-08 17:53:12,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:53:12,519 INFO L225 Difference]: With dead ends: 60 [2024-11-08 17:53:12,519 INFO L226 Difference]: Without dead ends: 60 [2024-11-08 17:53:12,519 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:53:12,521 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:53:12,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 91 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:53:12,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-11-08 17:53:12,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-11-08 17:53:12,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.625) internal successors, (65), 59 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:12,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2024-11-08 17:53:12,528 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 11 [2024-11-08 17:53:12,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:53:12,529 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2024-11-08 17:53:12,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:12,529 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2024-11-08 17:53:12,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 17:53:12,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:53:12,530 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:53:12,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:53:12,531 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-08 17:53:12,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:53:12,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1178844741, now seen corresponding path program 1 times [2024-11-08 17:53:12,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:53:12,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517267441] [2024-11-08 17:53:12,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:12,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:53:12,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:12,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:53:12,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:53:12,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517267441] [2024-11-08 17:53:12,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517267441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:53:12,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:53:12,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:53:12,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733282848] [2024-11-08 17:53:12,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:53:12,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:53:12,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:53:12,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:53:12,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:53:12,818 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:12,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:53:12,960 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2024-11-08 17:53:12,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:53:12,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-08 17:53:12,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:53:12,962 INFO L225 Difference]: With dead ends: 64 [2024-11-08 17:53:12,962 INFO L226 Difference]: Without dead ends: 64 [2024-11-08 17:53:12,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:53:12,964 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 21 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:53:12,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 99 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:53:12,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-08 17:53:12,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-08 17:53:12,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.5909090909090908) internal successors, (70), 63 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:12,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2024-11-08 17:53:12,971 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 13 [2024-11-08 17:53:12,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:53:12,971 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2024-11-08 17:53:12,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:12,972 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2024-11-08 17:53:12,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 17:53:12,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:53:12,973 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:53:12,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:53:12,973 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-08 17:53:12,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:53:12,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1178844740, now seen corresponding path program 1 times [2024-11-08 17:53:12,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:53:12,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367975068] [2024-11-08 17:53:12,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:12,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:53:13,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:13,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:53:13,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:53:13,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367975068] [2024-11-08 17:53:13,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367975068] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:53:13,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:53:13,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:53:13,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175781123] [2024-11-08 17:53:13,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:53:13,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:53:13,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:53:13,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:53:13,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:53:13,261 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:13,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:53:13,413 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2024-11-08 17:53:13,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:53:13,414 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-08 17:53:13,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:53:13,414 INFO L225 Difference]: With dead ends: 64 [2024-11-08 17:53:13,415 INFO L226 Difference]: Without dead ends: 64 [2024-11-08 17:53:13,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:53:13,417 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 42 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:53:13,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 107 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:53:13,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-08 17:53:13,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-08 17:53:13,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 63 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:13,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2024-11-08 17:53:13,429 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 13 [2024-11-08 17:53:13,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:53:13,429 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2024-11-08 17:53:13,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:13,430 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2024-11-08 17:53:13,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 17:53:13,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:53:13,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:53:13,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:53:13,437 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-08 17:53:13,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:53:13,438 INFO L85 PathProgramCache]: Analyzing trace with hash 436754752, now seen corresponding path program 1 times [2024-11-08 17:53:13,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:53:13,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735416100] [2024-11-08 17:53:13,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:13,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:53:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:13,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:53:13,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:53:13,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735416100] [2024-11-08 17:53:13,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735416100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:53:13,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:53:13,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:53:13,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384432584] [2024-11-08 17:53:13,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:53:13,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:53:13,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:53:13,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:53:13,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:53:13,570 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:13,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:53:13,699 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2024-11-08 17:53:13,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:53:13,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-08 17:53:13,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:53:13,701 INFO L225 Difference]: With dead ends: 62 [2024-11-08 17:53:13,701 INFO L226 Difference]: Without dead ends: 62 [2024-11-08 17:53:13,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:53:13,703 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 8 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:53:13,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 108 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:53:13,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-08 17:53:13,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-08 17:53:13,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.5227272727272727) internal successors, (67), 61 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:13,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2024-11-08 17:53:13,709 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 17 [2024-11-08 17:53:13,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:53:13,709 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2024-11-08 17:53:13,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:13,710 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2024-11-08 17:53:13,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 17:53:13,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:53:13,711 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:53:13,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:53:13,712 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-08 17:53:13,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:53:13,713 INFO L85 PathProgramCache]: Analyzing trace with hash 436754753, now seen corresponding path program 1 times [2024-11-08 17:53:13,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:53:13,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261181055] [2024-11-08 17:53:13,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:13,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:53:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:13,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:53:13,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:53:13,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261181055] [2024-11-08 17:53:13,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261181055] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:53:13,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523580701] [2024-11-08 17:53:13,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:13,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:53:13,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:53:13,874 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:53:13,876 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:53:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:14,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 17:53:14,079 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:53:14,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:53:14,174 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:53:14,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:53:14,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [523580701] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:53:14,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:53:14,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-11-08 17:53:14,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168290388] [2024-11-08 17:53:14,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:53:14,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:53:14,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:53:14,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:53:14,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:53:14,255 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:14,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:53:14,311 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-11-08 17:53:14,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:53:14,312 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-08 17:53:14,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:53:14,313 INFO L225 Difference]: With dead ends: 80 [2024-11-08 17:53:14,313 INFO L226 Difference]: Without dead ends: 80 [2024-11-08 17:53:14,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:53:14,314 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 15 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:53:14,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 204 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:53:14,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-08 17:53:14,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2024-11-08 17:53:14,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.4) internal successors, (84), 77 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:14,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2024-11-08 17:53:14,328 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 17 [2024-11-08 17:53:14,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:53:14,328 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2024-11-08 17:53:14,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2024-11-08 17:53:14,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-08 17:53:14,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:53:14,333 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:53:14,362 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:53:14,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:53:14,535 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-08 17:53:14,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:53:14,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1197858468, now seen corresponding path program 1 times [2024-11-08 17:53:14,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:53:14,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649454091] [2024-11-08 17:53:14,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:14,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:53:14,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:14,835 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:53:14,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:53:14,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649454091] [2024-11-08 17:53:14,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649454091] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:53:14,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678695897] [2024-11-08 17:53:14,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:14,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:53:14,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:53:14,839 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:53:14,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 17:53:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:15,051 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 17:53:15,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:53:15,131 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 [2024-11-08 17:53:15,222 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-08 17:53:15,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-08 17:53:15,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:53:15,263 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:53:15,472 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:53:15,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678695897] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:53:15,472 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:53:15,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 6 [2024-11-08 17:53:15,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844798659] [2024-11-08 17:53:15,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:53:15,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:53:15,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:53:15,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:53:15,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:53:15,474 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:15,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:53:15,643 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2024-11-08 17:53:15,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:53:15,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-08 17:53:15,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:53:15,645 INFO L225 Difference]: With dead ends: 76 [2024-11-08 17:53:15,645 INFO L226 Difference]: Without dead ends: 76 [2024-11-08 17:53:15,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:53:15,646 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 3 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:53:15,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 173 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:53:15,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-08 17:53:15,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-08 17:53:15,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 75 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:15,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2024-11-08 17:53:15,659 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 20 [2024-11-08 17:53:15,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:53:15,660 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2024-11-08 17:53:15,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:15,660 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2024-11-08 17:53:15,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 17:53:15,661 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:53:15,661 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:53:15,689 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 17:53:15,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 17:53:15,863 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-08 17:53:15,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:53:15,863 INFO L85 PathProgramCache]: Analyzing trace with hash -2121528198, now seen corresponding path program 1 times [2024-11-08 17:53:15,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:53:15,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017383731] [2024-11-08 17:53:15,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:15,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:53:15,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:16,212 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-08 17:53:16,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:53:16,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017383731] [2024-11-08 17:53:16,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017383731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:53:16,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:53:16,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:53:16,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851147030] [2024-11-08 17:53:16,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:53:16,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:53:16,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:53:16,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:53:16,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:53:16,218 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:16,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:53:16,400 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2024-11-08 17:53:16,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:53:16,401 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-08 17:53:16,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:53:16,402 INFO L225 Difference]: With dead ends: 75 [2024-11-08 17:53:16,402 INFO L226 Difference]: Without dead ends: 75 [2024-11-08 17:53:16,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:53:16,403 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 18 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:53:16,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 107 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:53:16,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-08 17:53:16,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2024-11-08 17:53:16,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.278688524590164) internal successors, (78), 72 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:16,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2024-11-08 17:53:16,410 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 41 [2024-11-08 17:53:16,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:53:16,413 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2024-11-08 17:53:16,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:16,414 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2024-11-08 17:53:16,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-08 17:53:16,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:53:16,415 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:53:16,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 17:53:16,415 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-08 17:53:16,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:53:16,416 INFO L85 PathProgramCache]: Analyzing trace with hash -2121528197, now seen corresponding path program 1 times [2024-11-08 17:53:16,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:53:16,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872654538] [2024-11-08 17:53:16,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:16,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:53:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:16,855 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-08 17:53:16,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:53:16,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872654538] [2024-11-08 17:53:16,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872654538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:53:16,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:53:16,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:53:16,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437166091] [2024-11-08 17:53:16,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:53:16,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:53:16,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:53:16,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:53:16,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:53:16,862 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:17,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:53:17,036 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2024-11-08 17:53:17,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:53:17,037 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-08 17:53:17,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:53:17,038 INFO L225 Difference]: With dead ends: 79 [2024-11-08 17:53:17,038 INFO L226 Difference]: Without dead ends: 79 [2024-11-08 17:53:17,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:53:17,040 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:53:17,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 193 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:53:17,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-08 17:53:17,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2024-11-08 17:53:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 64 states have (on average 1.265625) internal successors, (81), 75 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:17,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2024-11-08 17:53:17,048 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 41 [2024-11-08 17:53:17,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:53:17,049 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2024-11-08 17:53:17,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:17,049 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2024-11-08 17:53:17,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-08 17:53:17,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:53:17,076 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:53:17,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 17:53:17,077 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-08 17:53:17,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:53:17,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2002743312, now seen corresponding path program 1 times [2024-11-08 17:53:17,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:53:17,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161166238] [2024-11-08 17:53:17,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:17,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:53:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-08 17:53:18,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:53:18,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161166238] [2024-11-08 17:53:18,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161166238] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:53:18,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21913929] [2024-11-08 17:53:18,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:18,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:53:18,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:53:18,477 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:53:18,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 17:53:18,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:18,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-08 17:53:18,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:53:18,983 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 17:53:18,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-08 17:53:19,207 INFO L349 Elim1Store]: treesize reduction 10, result has 64.3 percent of original size [2024-11-08 17:53:19,208 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 21 treesize of output 33 [2024-11-08 17:53:19,551 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-08 17:53:19,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-11-08 17:53:19,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 17:53:19,716 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 16 treesize of output 11 [2024-11-08 17:53:19,832 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 [2024-11-08 17:53:19,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-08 17:53:20,041 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:53:20,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:53:20,071 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_843) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2024-11-08 17:53:20,246 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:53:20,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-11-08 17:53:20,253 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 122 treesize of output 110 [2024-11-08 17:53:20,263 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 23 treesize of output 21 [2024-11-08 17:53:20,271 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 20 treesize of output 16 [2024-11-08 17:53:21,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:53:21,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 146 treesize of output 216 [2024-11-08 17:53:22,072 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-08 17:53:22,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21913929] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:53:22,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:53:22,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 18] total 41 [2024-11-08 17:53:22,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876273659] [2024-11-08 17:53:22,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:53:22,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-08 17:53:22,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:53:22,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-08 17:53:22,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1387, Unknown=21, NotChecked=76, Total=1640 [2024-11-08 17:53:22,083 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 41 states, 41 states have (on average 2.707317073170732) internal successors, (111), 41 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:53:23,294 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2024-11-08 17:53:23,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:53:23,295 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.707317073170732) internal successors, (111), 41 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2024-11-08 17:53:23,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:53:23,296 INFO L225 Difference]: With dead ends: 76 [2024-11-08 17:53:23,296 INFO L226 Difference]: Without dead ends: 76 [2024-11-08 17:53:23,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 590 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=368, Invalid=2165, Unknown=21, NotChecked=98, Total=2652 [2024-11-08 17:53:23,299 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 77 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 17:53:23,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 690 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 490 Invalid, 0 Unknown, 30 Unchecked, 0.6s Time] [2024-11-08 17:53:23,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-08 17:53:23,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-08 17:53:23,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 64 states have (on average 1.25) internal successors, (80), 75 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:23,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2024-11-08 17:53:23,303 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 44 [2024-11-08 17:53:23,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:53:23,304 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2024-11-08 17:53:23,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.707317073170732) internal successors, (111), 41 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:23,304 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2024-11-08 17:53:23,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 17:53:23,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:53:23,305 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:53:23,335 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 17:53:23,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-08 17:53:23,510 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-08 17:53:23,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:53:23,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1961743780, now seen corresponding path program 1 times [2024-11-08 17:53:23,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:53:23,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983063434] [2024-11-08 17:53:23,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:23,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:53:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:23,766 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-08 17:53:23,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:53:23,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983063434] [2024-11-08 17:53:23,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983063434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:53:23,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:53:23,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:53:23,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470609477] [2024-11-08 17:53:23,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:53:23,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:53:23,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:53:23,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:53:23,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:53:23,770 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:23,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:53:23,975 INFO L93 Difference]: Finished difference Result 80 states and 82 transitions. [2024-11-08 17:53:23,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:53:23,976 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-08 17:53:23,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:53:23,976 INFO L225 Difference]: With dead ends: 80 [2024-11-08 17:53:23,977 INFO L226 Difference]: Without dead ends: 80 [2024-11-08 17:53:23,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:53:23,978 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 44 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:53:23,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 102 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:53:23,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-08 17:53:23,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2024-11-08 17:53:23,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 64 states have (on average 1.234375) internal successors, (79), 74 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:23,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2024-11-08 17:53:23,982 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 47 [2024-11-08 17:53:23,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:53:23,983 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2024-11-08 17:53:23,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:23,983 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2024-11-08 17:53:23,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 17:53:23,985 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:53:23,985 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:53:23,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 17:53:23,985 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-08 17:53:23,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:53:23,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1961743781, now seen corresponding path program 1 times [2024-11-08 17:53:23,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:53:23,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643030472] [2024-11-08 17:53:23,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:23,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:53:24,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:24,436 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-11-08 17:53:24,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:53:24,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643030472] [2024-11-08 17:53:24,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643030472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:53:24,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:53:24,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:53:24,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20001376] [2024-11-08 17:53:24,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:53:24,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:53:24,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:53:24,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:53:24,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:53:24,438 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:24,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:53:24,660 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2024-11-08 17:53:24,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:53:24,660 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-08 17:53:24,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:53:24,661 INFO L225 Difference]: With dead ends: 77 [2024-11-08 17:53:24,662 INFO L226 Difference]: Without dead ends: 77 [2024-11-08 17:53:24,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:53:24,663 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 25 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:53:24,663 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 165 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:53:24,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-08 17:53:24,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2024-11-08 17:53:24,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.21875) internal successors, (78), 73 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:24,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2024-11-08 17:53:24,667 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 47 [2024-11-08 17:53:24,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:53:24,667 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2024-11-08 17:53:24,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:24,668 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2024-11-08 17:53:24,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 17:53:24,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:53:24,672 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:53:24,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 17:53:24,673 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-08 17:53:24,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:53:24,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1961743819, now seen corresponding path program 1 times [2024-11-08 17:53:24,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:53:24,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279801630] [2024-11-08 17:53:24,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:24,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:53:24,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:26,325 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 17:53:26,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:53:26,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279801630] [2024-11-08 17:53:26,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279801630] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:53:26,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981179426] [2024-11-08 17:53:26,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:26,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:53:26,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:53:26,329 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:53:26,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 17:53:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:26,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-08 17:53:26,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:53:26,716 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 [2024-11-08 17:53:26,840 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 17:53:26,840 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 [2024-11-08 17:53:26,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 17:53:27,032 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 23 treesize of output 11 [2024-11-08 17:53:27,069 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 17:53:27,069 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 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-08 17:53:27,237 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-08 17:53:27,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2024-11-08 17:53:27,367 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 17:53:27,368 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 50 [2024-11-08 17:53:27,802 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 17:53:27,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 52 [2024-11-08 17:53:27,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:53:27,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 42 [2024-11-08 17:53:28,093 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 35 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 17:53:28,094 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:53:28,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:53:28,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 46 [2024-11-08 17:53:28,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:53:28,483 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 272 treesize of output 264 [2024-11-08 17:53:28,505 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 182 treesize of output 166 [2024-11-08 17:53:28,812 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 82 treesize of output 74 [2024-11-08 17:53:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 17:53:29,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981179426] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:53:29,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:53:29,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 13] total 39 [2024-11-08 17:53:29,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243431250] [2024-11-08 17:53:29,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:53:29,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-08 17:53:29,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:53:29,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-08 17:53:29,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1402, Unknown=4, NotChecked=0, Total=1560 [2024-11-08 17:53:29,419 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 40 states, 39 states have (on average 2.8974358974358974) internal successors, (113), 40 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:31,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:53:31,040 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2024-11-08 17:53:31,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 17:53:31,041 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 2.8974358974358974) internal successors, (113), 40 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-08 17:53:31,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:53:31,042 INFO L225 Difference]: With dead ends: 86 [2024-11-08 17:53:31,042 INFO L226 Difference]: Without dead ends: 86 [2024-11-08 17:53:31,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=296, Invalid=1956, Unknown=4, NotChecked=0, Total=2256 [2024-11-08 17:53:31,044 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 41 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:53:31,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 390 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 17:53:31,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-08 17:53:31,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 77. [2024-11-08 17:53:31,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 67 states have (on average 1.2388059701492538) internal successors, (83), 76 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:31,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 83 transitions. [2024-11-08 17:53:31,048 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 83 transitions. Word has length 47 [2024-11-08 17:53:31,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:53:31,048 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 83 transitions. [2024-11-08 17:53:31,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.8974358974358974) internal successors, (113), 40 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:31,049 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 83 transitions. [2024-11-08 17:53:31,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-08 17:53:31,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:53:31,050 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:53:31,079 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-08 17:53:31,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-08 17:53:31,255 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-08 17:53:31,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:53:31,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1961743820, now seen corresponding path program 1 times [2024-11-08 17:53:31,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:53:31,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074489303] [2024-11-08 17:53:31,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:31,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:53:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 17:53:34,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:53:34,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074489303] [2024-11-08 17:53:34,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074489303] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:53:34,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601742073] [2024-11-08 17:53:34,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:34,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:53:34,466 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:53:34,468 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:53:34,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 17:53:34,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:34,718 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-08 17:53:34,723 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:53:34,775 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 [2024-11-08 17:53:34,892 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 17:53:34,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-08 17:53:34,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 17:53:34,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 17:53:35,037 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 23 treesize of output 11 [2024-11-08 17:53:35,045 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 23 treesize of output 11 [2024-11-08 17:53:35,080 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 17:53:35,080 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 1 case distinctions, treesize of input 50 treesize of output 45 [2024-11-08 17:53:35,087 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 24 treesize of output 11 [2024-11-08 17:53:35,248 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-08 17:53:35,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-08 17:53:35,278 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-08 17:53:35,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2024-11-08 17:53:35,421 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 17:53:35,422 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-08 17:53:35,445 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 17:53:35,445 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 50 [2024-11-08 17:53:35,963 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 17:53:35,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 35 [2024-11-08 17:53:35,981 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 17:53:35,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 59 [2024-11-08 17:53:36,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:53:36,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 49 [2024-11-08 17:53:36,075 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 17:53:36,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 10 [2024-11-08 17:53:36,286 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 29 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-08 17:53:36,286 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:53:37,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:53:37,020 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 46 treesize of output 50 [2024-11-08 17:53:37,636 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse5 (+ 9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse7 (forall ((v_ArrVal_1573 Int) (v_ArrVal_1575 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1573)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1575) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (and (forall ((v_ArrVal_1571 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1571 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1571)) (forall ((v_ArrVal_1574 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1571) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse1) (< 0 (+ .cse1 1))))))) (or (forall ((v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1571 (Array Int Int))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1571) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1571 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1571)))) (forall ((v_ArrVal_1573 Int) (v_ArrVal_1575 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1573)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1575) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1571 (Array Int Int))) (or (forall ((v_ArrVal_1574 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1571) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse4) (< .cse4 .cse5)))) (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1571 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1571)))) (forall ((v_ArrVal_1573 Int) (v_ArrVal_1575 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_1573)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1575) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (or (forall ((v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1571 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1571 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1571)) (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1571) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) 1)))) .cse7) (or (forall ((v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1571 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1571 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1571)) (< (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1571) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) .cse5))) .cse7)))) is different from false [2024-11-08 17:53:37,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:53:37,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 43 [2024-11-08 17:53:37,689 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 61 treesize of output 43 [2024-11-08 17:53:37,696 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 15 treesize of output 7 [2024-11-08 17:53:37,704 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-08 17:53:37,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 1 [2024-11-08 17:53:37,708 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:53:37,710 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 26 treesize of output 24 [2024-11-08 17:53:37,718 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:53:37,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2024-11-08 17:53:37,724 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:53:37,726 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 33 treesize of output 31 [2024-11-08 17:53:37,734 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:53:37,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2024-11-08 17:53:37,740 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:53:37,742 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 26 treesize of output 24 [2024-11-08 17:53:37,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:53:37,752 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 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-08 17:53:37,756 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 10 [2024-11-08 17:53:37,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:53:37,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 31 [2024-11-08 17:53:37,774 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:53:37,776 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 20 treesize of output 8 [2024-11-08 17:53:37,781 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:53:37,784 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 33 treesize of output 31 [2024-11-08 17:53:37,792 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:53:37,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2024-11-08 17:53:38,129 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 1 not checked. [2024-11-08 17:53:38,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601742073] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:53:38,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:53:38,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15, 13] total 47 [2024-11-08 17:53:38,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085745141] [2024-11-08 17:53:38,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:53:38,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-08 17:53:38,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:53:38,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-08 17:53:38,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1968, Unknown=21, NotChecked=90, Total=2256 [2024-11-08 17:53:38,137 INFO L87 Difference]: Start difference. First operand 77 states and 83 transitions. Second operand has 48 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 48 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:40,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:53:40,895 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2024-11-08 17:53:40,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 17:53:40,896 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 48 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-08 17:53:40,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:53:40,897 INFO L225 Difference]: With dead ends: 85 [2024-11-08 17:53:40,897 INFO L226 Difference]: Without dead ends: 85 [2024-11-08 17:53:40,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 73 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=358, Invalid=3164, Unknown=22, NotChecked=116, Total=3660 [2024-11-08 17:53:40,899 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 57 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 1255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:53:40,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 574 Invalid, 1255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1171 Invalid, 0 Unknown, 59 Unchecked, 1.4s Time] [2024-11-08 17:53:40,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-08 17:53:40,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 79. [2024-11-08 17:53:40,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.2142857142857142) internal successors, (85), 78 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:40,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2024-11-08 17:53:40,903 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 47 [2024-11-08 17:53:40,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:53:40,904 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2024-11-08 17:53:40,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.4468085106382977) internal successors, (115), 48 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:40,904 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2024-11-08 17:53:40,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 17:53:40,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:53:40,906 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:53:40,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-08 17:53:41,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-08 17:53:41,107 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-08 17:53:41,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:53:41,107 INFO L85 PathProgramCache]: Analyzing trace with hash 689015003, now seen corresponding path program 1 times [2024-11-08 17:53:41,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:53:41,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919380894] [2024-11-08 17:53:41,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:41,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:53:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:42,613 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 17:53:42,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:53:42,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919380894] [2024-11-08 17:53:42,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919380894] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:53:42,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1636201894] [2024-11-08 17:53:42,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:42,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:53:42,614 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:53:42,615 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:53:42,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 17:53:42,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:42,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-08 17:53:42,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:53:42,925 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 19 treesize of output 1 [2024-11-08 17:53:43,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:53:43,028 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 27 treesize of output 15 [2024-11-08 17:53:43,101 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 21 treesize of output 9 [2024-11-08 17:53:43,160 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 17:53:43,161 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:53:43,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1636201894] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:53:43,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:53:43,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18] total 26 [2024-11-08 17:53:43,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716299375] [2024-11-08 17:53:43,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:53:43,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:53:43,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:53:43,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:53:43,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=577, Unknown=0, NotChecked=0, Total=650 [2024-11-08 17:53:43,166 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:43,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:53:43,469 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2024-11-08 17:53:43,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 17:53:43,470 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-08 17:53:43,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:53:43,471 INFO L225 Difference]: With dead ends: 88 [2024-11-08 17:53:43,471 INFO L226 Difference]: Without dead ends: 88 [2024-11-08 17:53:43,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=722, Unknown=0, NotChecked=0, Total=812 [2024-11-08 17:53:43,473 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 40 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:53:43,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 128 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:53:43,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-08 17:53:43,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 83. [2024-11-08 17:53:43,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 74 states have (on average 1.2162162162162162) internal successors, (90), 82 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 90 transitions. [2024-11-08 17:53:43,477 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 90 transitions. Word has length 50 [2024-11-08 17:53:43,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:53:43,477 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 90 transitions. [2024-11-08 17:53:43,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:43,478 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 90 transitions. [2024-11-08 17:53:43,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 17:53:43,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:53:43,479 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:53:43,506 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-08 17:53:43,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-08 17:53:43,680 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-08 17:53:43,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:53:43,681 INFO L85 PathProgramCache]: Analyzing trace with hash 689015004, now seen corresponding path program 1 times [2024-11-08 17:53:43,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:53:43,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841944357] [2024-11-08 17:53:43,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:43,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:53:43,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:45,136 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 8 proven. 35 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-08 17:53:45,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:53:45,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841944357] [2024-11-08 17:53:45,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841944357] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:53:45,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466912430] [2024-11-08 17:53:45,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:45,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:53:45,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:53:45,140 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:53:45,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 17:53:45,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:45,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-08 17:53:45,491 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:53:45,583 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 19 treesize of output 1 [2024-11-08 17:53:45,587 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 19 treesize of output 1 [2024-11-08 17:53:45,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:53:45,729 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 35 treesize of output 23 [2024-11-08 17:53:45,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 17:53:45,736 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 44 treesize of output 26 [2024-11-08 17:53:45,849 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 29 treesize of output 17 [2024-11-08 17:53:45,854 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 32 treesize of output 14 [2024-11-08 17:53:45,937 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 17:53:45,937 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:53:45,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466912430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:53:45,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:53:45,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [18] total 27 [2024-11-08 17:53:45,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925651072] [2024-11-08 17:53:45,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:53:45,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 17:53:45,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:53:45,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 17:53:45,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2024-11-08 17:53:45,940 INFO L87 Difference]: Start difference. First operand 83 states and 90 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:46,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:53:46,240 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2024-11-08 17:53:46,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-08 17:53:46,241 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-08 17:53:46,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:53:46,242 INFO L225 Difference]: With dead ends: 93 [2024-11-08 17:53:46,242 INFO L226 Difference]: Without dead ends: 93 [2024-11-08 17:53:46,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=667, Unknown=0, NotChecked=0, Total=756 [2024-11-08 17:53:46,243 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 21 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:53:46,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 198 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:53:46,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-08 17:53:46,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 83. [2024-11-08 17:53:46,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 82 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:46,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2024-11-08 17:53:46,248 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 50 [2024-11-08 17:53:46,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:53:46,249 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2024-11-08 17:53:46,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:53:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2024-11-08 17:53:46,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-08 17:53:46,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:53:46,250 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:53:46,272 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 17:53:46,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:53:46,452 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-08 17:53:46,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:53:46,452 INFO L85 PathProgramCache]: Analyzing trace with hash 690157823, now seen corresponding path program 1 times [2024-11-08 17:53:46,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:53:46,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304318893] [2024-11-08 17:53:46,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:46,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:53:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:49,809 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:53:49,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:53:49,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304318893] [2024-11-08 17:53:49,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304318893] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:53:49,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966275113] [2024-11-08 17:53:49,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:53:49,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:53:49,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:53:49,813 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:53:49,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 17:53:50,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:53:50,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-08 17:53:50,160 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:53:50,377 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 17:53:50,377 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 [2024-11-08 17:53:50,616 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-08 17:53:50,617 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 [2024-11-08 17:53:50,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 17:53:50,878 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 [2024-11-08 17:53:51,172 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-08 17:53:51,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-11-08 17:53:51,307 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 [2024-11-08 17:53:51,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 17:53:51,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 17:53:51,451 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 [2024-11-08 17:53:51,463 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 23 treesize of output 11 [2024-11-08 17:53:51,481 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 23 treesize of output 11 [2024-11-08 17:53:51,534 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 17:53:51,534 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 1 case distinctions, treesize of input 87 treesize of output 74 [2024-11-08 17:53:51,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2024-11-08 17:53:51,554 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 24 treesize of output 11 [2024-11-08 17:53:51,780 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 [2024-11-08 17:53:51,795 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 36 treesize of output 27 [2024-11-08 17:53:51,802 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 20 treesize of output 15 [2024-11-08 17:53:51,836 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 47 treesize of output 27 [2024-11-08 17:53:51,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 17:53:51,863 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 23 treesize of output 11 [2024-11-08 17:53:52,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 34 [2024-11-08 17:53:52,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-08 17:53:52,264 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 23 treesize of output 11 [2024-11-08 17:53:52,296 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:53:52,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 23 [2024-11-08 17:53:52,312 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 [2024-11-08 17:53:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:53:52,577 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:53:53,229 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_2319 (Array Int Int)) (v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2327 (Array Int Int)) (v_ArrVal_2320 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2320) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2318) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2327) .cse0) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2319) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1)) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_ArrVal_2319 (Array Int Int)) (v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2327 (Array Int Int)) (v_ArrVal_2320 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2319) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2318) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2327) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2320) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1)) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) is different from false [2024-11-08 17:53:53,282 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_2319 (Array Int Int)) (v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2327 (Array Int Int)) (v_ArrVal_2320 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2320) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2318) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2327) .cse0) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2319) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2319 (Array Int Int)) (v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2327 (Array Int Int)) (v_ArrVal_2320 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2319) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2318) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2327) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2320) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) .cse2))))))) is different from false [2024-11-08 17:53:53,398 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_2316 (Array Int Int))) (or (not (= v_ArrVal_2316 (store .cse0 .cse1 (select v_ArrVal_2316 .cse1)))) (forall ((v_ArrVal_2319 (Array Int Int)) (v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2327 (Array Int Int)) (v_ArrVal_2315 (Array Int Int)) (v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2320 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2315) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2320) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2316) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2318) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2327) .cse2) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2314) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2319) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (forall ((v_ArrVal_2316 (Array Int Int))) (or (not (= v_ArrVal_2316 (store .cse0 .cse1 (select v_ArrVal_2316 .cse1)))) (forall ((v_ArrVal_2319 (Array Int Int)) (v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2327 (Array Int Int)) (v_ArrVal_2315 (Array Int Int)) (v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2320 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2314) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2319) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2316) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2318) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2327) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2315) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2320) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3)) .cse4)) (= .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))))) is different from false [2024-11-08 17:53:53,553 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse4 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_2312 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2312 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2312)) (forall ((v_ArrVal_2316 (Array Int Int)) (v_ArrVal_2313 (Array Int Int)) (v_ArrVal_2310 Int)) (or (forall ((v_ArrVal_2319 (Array Int Int)) (v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2327 (Array Int Int)) (v_ArrVal_2315 (Array Int Int)) (v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2320 (Array Int Int))) (let ((.cse1 (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2310)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2315) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2320) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2316) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2318) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2327) .cse1) (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2312) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2314) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2319) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2313) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_2316 .cse4)) v_ArrVal_2316)))))) (forall ((v_ArrVal_2312 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_2312 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_2312)) (forall ((v_ArrVal_2316 (Array Int Int)) (v_ArrVal_2313 (Array Int Int)) (v_ArrVal_2310 Int)) (or (not (= (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2313) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse4 (select v_ArrVal_2316 .cse4)) v_ArrVal_2316)) (forall ((v_ArrVal_2319 (Array Int Int)) (v_ArrVal_2318 (Array Int Int)) (v_ArrVal_2327 (Array Int Int)) (v_ArrVal_2315 (Array Int Int)) (v_ArrVal_2314 (Array Int Int)) (v_ArrVal_2320 (Array Int Int))) (let ((.cse5 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2312) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2314) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2319) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse5) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2316) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2318) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_2327) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2310)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2315) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_2320) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) .cse5) |c_ULTIMATE.start_main_~data_init~0#1|)))))))))) is different from false [2024-11-08 17:53:53,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:53:53,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 56 treesize of output 62 [2024-11-08 17:53:53,620 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 364 treesize of output 346 [2024-11-08 17:53:53,635 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 81 treesize of output 77 [2024-11-08 17:53:53,647 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 1155 treesize of output 1153 [2024-11-08 17:53:53,666 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 85 treesize of output 77 [2024-11-08 17:53:53,689 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 54 [2024-11-08 17:53:53,699 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 83 treesize of output 67 [2024-11-08 17:53:54,070 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 13 treesize of output 1 [2024-11-08 17:53:54,308 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 13 treesize of output 1 [2024-11-08 17:53:54,348 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 13 treesize of output 1 [2024-11-08 17:53:55,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:53:55,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 77 [2024-11-08 17:53:55,325 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 241 treesize of output 223 [2024-11-08 17:53:55,342 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 113 treesize of output 105 [2024-11-08 17:53:55,357 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 1030 treesize of output 1028 [2024-11-08 17:53:55,374 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 157 treesize of output 141 [2024-11-08 17:53:55,386 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 110 treesize of output 102 [2024-11-08 17:53:55,398 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 46 [2024-11-08 17:53:55,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:53:55,422 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 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-08 17:53:55,433 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 60 treesize of output 52 [2024-11-08 17:53:55,923 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 13 treesize of output 1 [2024-11-08 17:54:01,471 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 13 treesize of output 1 [2024-11-08 17:54:01,504 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 13 treesize of output 1 [2024-11-08 17:54:01,532 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 13 treesize of output 1 [2024-11-08 17:54:01,553 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 13 treesize of output 1 [2024-11-08 17:54:01,576 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 13 treesize of output 1 [2024-11-08 17:55:13,804 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-08 17:55:13,805 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 3940 treesize of output 3894 [2024-11-08 17:55:13,883 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:13,883 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 460 treesize of output 458 [2024-11-08 17:55:13,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:13,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 422 treesize of output 422 [2024-11-08 17:55:13,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 424 treesize of output 416 [2024-11-08 17:55:14,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:14,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 440 treesize of output 438 [2024-11-08 17:55:14,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:14,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 468 treesize of output 456 [2024-11-08 17:55:14,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 4 [2024-11-08 17:55:16,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 25 treesize of output 21 [2024-11-08 17:55:16,492 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:55:16,592 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-08 17:55:16,593 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 2 case distinctions, treesize of input 3907 treesize of output 3861 [2024-11-08 17:55:16,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:16,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 335 treesize of output 333 [2024-11-08 17:55:16,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:16,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 327 treesize of output 327 [2024-11-08 17:55:16,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:16,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 305 treesize of output 303 [2024-11-08 17:55:16,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 288 treesize of output 272 [2024-11-08 17:55:17,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-08 17:55:18,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:18,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 57 [2024-11-08 17:55:18,501 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:55:18,650 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-08 17:55:18,650 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 2 case distinctions, treesize of input 1971 treesize of output 1957 [2024-11-08 17:55:18,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:18,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 219 [2024-11-08 17:55:18,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:18,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 213 [2024-11-08 17:55:18,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 296 treesize of output 280 [2024-11-08 17:55:18,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:18,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 114 [2024-11-08 17:55:20,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-08 17:55:20,615 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:20,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 121 [2024-11-08 17:55:21,112 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-08 17:55:21,112 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 2 case distinctions, treesize of input 504 treesize of output 506 [2024-11-08 17:55:21,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:21,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 134 [2024-11-08 17:55:21,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 127 treesize of output 121 [2024-11-08 17:55:21,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 54 treesize of output 46 [2024-11-08 17:55:21,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-08 17:55:21,529 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:21,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 49 [2024-11-08 17:55:21,646 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:55:21,875 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2024-11-08 17:55:21,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 5832 treesize of output 5783 [2024-11-08 17:55:22,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:22,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 520 treesize of output 528 [2024-11-08 17:55:22,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:22,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 514 treesize of output 524 [2024-11-08 17:55:22,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:22,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 419 treesize of output 425 [2024-11-08 17:55:22,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:22,332 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 1 case distinctions, treesize of input 575 treesize of output 551 [2024-11-08 17:55:23,930 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 [2024-11-08 17:55:29,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:29,351 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 1 case distinctions, treesize of input 112 treesize of output 110 [2024-11-08 17:55:30,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-08 17:55:46,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:46,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 2 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 1282 treesize of output 1482 [2024-11-08 17:55:50,837 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:55:50,929 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-08 17:55:50,929 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 3907 treesize of output 3861 [2024-11-08 17:55:50,993 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:50,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 335 treesize of output 333 [2024-11-08 17:55:51,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:51,036 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 1 case distinctions, treesize of input 327 treesize of output 327 [2024-11-08 17:55:51,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:51,082 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 1 case distinctions, treesize of input 305 treesize of output 303 [2024-11-08 17:55:51,111 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 272 [2024-11-08 17:55:51,596 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 [2024-11-08 17:55:52,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 17 [2024-11-08 17:55:52,141 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:55:52,365 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2024-11-08 17:55:52,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 5832 treesize of output 5783 [2024-11-08 17:55:52,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:52,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 520 treesize of output 528 [2024-11-08 17:55:52,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:52,694 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 3 case distinctions, treesize of input 514 treesize of output 524 [2024-11-08 17:55:52,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:52,842 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 3 case distinctions, treesize of input 419 treesize of output 425 [2024-11-08 17:55:52,942 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:55:52,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 575 treesize of output 551 [2024-11-08 17:55:53,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 4 [2024-11-08 17:55:57,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2024-11-08 17:55:58,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2024-11-08 17:55:58,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-08 17:55:59,413 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 17:55:59,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 39 [2024-11-08 17:56:15,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:56:15,313 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 3 case distinctions, treesize of input 947 treesize of output 851 [2024-11-08 17:56:16,421 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:56:16,510 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-08 17:56:16,511 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 2 case distinctions, treesize of input 1971 treesize of output 1957 [2024-11-08 17:56:16,559 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:56:16,560 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 237 treesize of output 235 [2024-11-08 17:56:16,584 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 220 treesize of output 204 [2024-11-08 17:56:16,668 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:56:16,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 208 [2024-11-08 17:56:16,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:56:16,713 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 303 treesize of output 303 [2024-11-08 17:56:16,776 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 [2024-11-08 17:56:17,977 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 21 treesize of output 17 [2024-11-08 17:56:18,191 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2024-11-08 17:56:18,192 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 4 case distinctions, treesize of input 759 treesize of output 782 [2024-11-08 17:56:18,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:56:18,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 920 treesize of output 918 [2024-11-08 17:56:18,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:56:18,412 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 3 case distinctions, treesize of input 494 treesize of output 504 [2024-11-08 17:56:18,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:56:18,475 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 1 case distinctions, treesize of input 553 treesize of output 545 [2024-11-08 17:56:18,605 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:56:18,605 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 3 case distinctions, treesize of input 359 treesize of output 365 [2024-11-08 17:56:18,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 4 [2024-11-08 17:56:23,097 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 [2024-11-08 17:56:23,152 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 [2024-11-08 17:56:23,203 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 [2024-11-08 17:56:23,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:56:23,313 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 1 case distinctions, treesize of input 46 treesize of output 50 [2024-11-08 17:56:27,736 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 21 treesize of output 17 [2024-11-08 17:56:27,762 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:56:27,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:56:27,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 507 treesize of output 499 [2024-11-08 17:56:27,808 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:56:27,809 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:56:27,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:56:27,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 83 [2024-11-08 17:56:27,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 65 treesize of output 63 [2024-11-08 17:56:27,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 54 treesize of output 46 [2024-11-08 17:56:27,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-08 17:56:28,016 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:56:28,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2024-11-08 17:56:28,054 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:56:28,272 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2024-11-08 17:56:28,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 5835 treesize of output 5786 [2024-11-08 17:56:28,378 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:56:28,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:56:28,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 520 treesize of output 528 [2024-11-08 17:56:28,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:56:28,548 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 3 case distinctions, treesize of input 514 treesize of output 524 [2024-11-08 17:56:28,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:56:28,656 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 3 case distinctions, treesize of input 419 treesize of output 425 [2024-11-08 17:56:28,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:56:28,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 575 treesize of output 551 [2024-11-08 17:56:30,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 4 [2024-11-08 17:56:52,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-08 17:57:03,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:03,182 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 3 case distinctions, treesize of input 5782 treesize of output 5126 [2024-11-08 17:57:08,854 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:57:08,936 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-08 17:57:08,937 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 2 case distinctions, treesize of input 1971 treesize of output 1957 [2024-11-08 17:57:08,962 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 228 treesize of output 212 [2024-11-08 17:57:09,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:09,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 211 [2024-11-08 17:57:09,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:09,055 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 205 treesize of output 205 [2024-11-08 17:57:09,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:09,104 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 116 treesize of output 114 [2024-11-08 17:57:10,182 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 [2024-11-08 17:57:10,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:10,869 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 210 treesize of output 196 [2024-11-08 17:57:11,432 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:11,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 345 treesize of output 344 [2024-11-08 17:57:11,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:11,469 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 1 case distinctions, treesize of input 215 treesize of output 207 [2024-11-08 17:57:11,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:11,504 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 1 case distinctions, treesize of input 150 treesize of output 150 [2024-11-08 17:57:11,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:11,541 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 1 case distinctions, treesize of input 98 treesize of output 102 [2024-11-08 17:57:12,499 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:57:12,638 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-08 17:57:12,639 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 2 case distinctions, treesize of input 1971 treesize of output 1957 [2024-11-08 17:57:12,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:12,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 219 [2024-11-08 17:57:12,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:12,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 213 [2024-11-08 17:57:12,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 296 treesize of output 280 [2024-11-08 17:57:12,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:12,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 114 [2024-11-08 17:57:13,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-08 17:57:14,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:14,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 142 [2024-11-08 17:57:15,230 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:57:15,506 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2024-11-08 17:57:15,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 5832 treesize of output 5783 [2024-11-08 17:57:15,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:15,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 520 treesize of output 528 [2024-11-08 17:57:15,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:15,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 514 treesize of output 524 [2024-11-08 17:57:15,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:15,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 419 treesize of output 425 [2024-11-08 17:57:16,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:16,016 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 1 case distinctions, treesize of input 575 treesize of output 551 [2024-11-08 17:57:16,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-08 17:57:17,657 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 [2024-11-08 17:57:17,859 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:17,859 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 1 case distinctions, treesize of input 95 treesize of output 99 [2024-11-08 17:57:27,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:27,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 2 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 775 treesize of output 919 [2024-11-08 17:57:29,202 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:57:29,290 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-08 17:57:29,291 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 3907 treesize of output 3861 [2024-11-08 17:57:29,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:29,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 335 treesize of output 333 [2024-11-08 17:57:29,402 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:29,403 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 1 case distinctions, treesize of input 327 treesize of output 327 [2024-11-08 17:57:29,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:29,444 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 1 case distinctions, treesize of input 305 treesize of output 303 [2024-11-08 17:57:29,465 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 272 [2024-11-08 17:57:29,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 6 treesize of output 4 [2024-11-08 17:57:30,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:30,552 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 1 case distinctions, treesize of input 180 treesize of output 182 [2024-11-08 17:57:30,957 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:57:30,965 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:57:31,045 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-08 17:57:31,045 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 279 treesize of output 289 [2024-11-08 17:57:31,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:31,085 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 117 treesize of output 115 [2024-11-08 17:57:31,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:31,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 156 [2024-11-08 17:57:31,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:31,179 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 199 treesize of output 199 [2024-11-08 17:57:31,209 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 [2024-11-08 17:57:31,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:31,561 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 182 treesize of output 182 [2024-11-08 17:57:32,216 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:57:32,224 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:57:32,311 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-08 17:57:32,312 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 2 case distinctions, treesize of input 1014 treesize of output 1000 [2024-11-08 17:57:32,342 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:57:32,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:32,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 159 [2024-11-08 17:57:32,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:32,425 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 153 treesize of output 153 [2024-11-08 17:57:32,471 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:32,471 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 64 treesize of output 62 [2024-11-08 17:57:32,988 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 [2024-11-08 17:57:33,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:33,526 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 134 treesize of output 126 [2024-11-08 17:57:33,755 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:57:33,834 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-08 17:57:33,834 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 1971 treesize of output 1957 [2024-11-08 17:57:33,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:33,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 219 [2024-11-08 17:57:33,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:33,935 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 1 case distinctions, treesize of input 213 treesize of output 213 [2024-11-08 17:57:33,951 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 296 treesize of output 280 [2024-11-08 17:57:33,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:33,994 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 1 case distinctions, treesize of input 116 treesize of output 114 [2024-11-08 17:57:34,627 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 [2024-11-08 17:57:35,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:35,241 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 1 case distinctions, treesize of input 149 treesize of output 141 [2024-11-08 17:57:35,582 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:57:35,663 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-08 17:57:35,663 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 3907 treesize of output 3861 [2024-11-08 17:57:35,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:35,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 335 treesize of output 333 [2024-11-08 17:57:35,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:35,772 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 1 case distinctions, treesize of input 327 treesize of output 327 [2024-11-08 17:57:35,814 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:35,814 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 1 case distinctions, treesize of input 305 treesize of output 303 [2024-11-08 17:57:35,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 288 treesize of output 272 [2024-11-08 17:57:36,146 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 [2024-11-08 17:57:37,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:37,132 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 1 case distinctions, treesize of input 94 treesize of output 92 [2024-11-08 17:57:37,189 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:57:37,384 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2024-11-08 17:57:37,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 5832 treesize of output 5783 [2024-11-08 17:57:37,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:37,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 520 treesize of output 528 [2024-11-08 17:57:37,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:37,646 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 3 case distinctions, treesize of input 514 treesize of output 524 [2024-11-08 17:57:37,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:37,747 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 3 case distinctions, treesize of input 419 treesize of output 425 [2024-11-08 17:57:37,809 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:37,809 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 575 treesize of output 551 [2024-11-08 17:57:38,271 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 [2024-11-08 17:57:41,443 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:41,443 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 73 treesize of output 77 [2024-11-08 17:57:42,254 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 [2024-11-08 17:57:42,364 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 17:57:42,365 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 45 treesize of output 1 [2024-11-08 17:57:49,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:49,117 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 3 case distinctions, treesize of input 291 treesize of output 283 [2024-11-08 17:57:50,091 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:57:50,183 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-08 17:57:50,184 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 2 case distinctions, treesize of input 1971 treesize of output 1957 [2024-11-08 17:57:50,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:50,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 219 [2024-11-08 17:57:50,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:50,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 213 treesize of output 213 [2024-11-08 17:57:50,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 296 treesize of output 280 [2024-11-08 17:57:50,379 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:50,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 114 [2024-11-08 17:57:51,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-08 17:57:51,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:51,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 141 [2024-11-08 17:57:52,394 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:57:52,675 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2024-11-08 17:57:52,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 5835 treesize of output 5786 [2024-11-08 17:57:52,836 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:57:52,921 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:52,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 520 treesize of output 528 [2024-11-08 17:57:53,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:53,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 514 treesize of output 524 [2024-11-08 17:57:53,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:53,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 419 treesize of output 425 [2024-11-08 17:57:53,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:53,218 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 1 case distinctions, treesize of input 575 treesize of output 551 [2024-11-08 17:57:55,173 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 [2024-11-08 17:57:55,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:57:55,994 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 1 case distinctions, treesize of input 73 treesize of output 77 [2024-11-08 17:57:56,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2024-11-08 17:57:56,805 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-08 17:58:13,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 17 [2024-11-08 17:58:13,696 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:58:13,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:58:13,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 46 [2024-11-08 17:58:13,722 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 47 treesize of output 43 [2024-11-08 17:58:13,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:58:13,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 50 [2024-11-08 17:58:13,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:58:13,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2024-11-08 17:58:13,776 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 12 treesize of output 8 [2024-11-08 17:58:13,805 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 18 treesize of output 12 [2024-11-08 17:58:13,821 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 21 treesize of output 17 [2024-11-08 17:58:13,851 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 [2024-11-08 17:58:13,859 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 17:58:13,941 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-08 17:58:13,942 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 1971 treesize of output 1957 [2024-11-08 17:58:14,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:58:14,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 221 treesize of output 219 [2024-11-08 17:58:14,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:58:14,040 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 1 case distinctions, treesize of input 213 treesize of output 213 [2024-11-08 17:58:14,073 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 296 treesize of output 280 [2024-11-08 17:58:14,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:58:14,109 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 1 case distinctions, treesize of input 116 treesize of output 114 [2024-11-08 17:58:14,131 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 [2024-11-08 17:58:15,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:58:15,618 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 1 case distinctions, treesize of input 311 treesize of output 285 [2024-11-08 17:59:44,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:59:44,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 95 treesize of output 363 [2024-11-08 17:59:53,794 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2024-11-08 17:59:53,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966275113] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:59:53,794 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 17:59:53,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 25] total 67 [2024-11-08 17:59:53,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813999984] [2024-11-08 17:59:53,794 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 17:59:53,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-11-08 17:59:53,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:59:53,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-11-08 17:59:53,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=3568, Unknown=91, NotChecked=500, Total=4422 [2024-11-08 17:59:53,798 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 67 states, 67 states have (on average 2.1194029850746268) internal successors, (142), 67 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:59:59,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:00:51,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:00:55,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:00:59,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:01:03,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:01:06,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 18:01:15,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 18:01:15,553 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2024-11-08 18:01:15,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 18:01:15,554 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.1194029850746268) internal successors, (142), 67 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2024-11-08 18:01:15,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 18:01:15,555 INFO L225 Difference]: With dead ends: 79 [2024-11-08 18:01:15,555 INFO L226 Difference]: Without dead ends: 79 [2024-11-08 18:01:15,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1758 ImplicationChecksByTransitivity, 198.8s TimeCoverageRelationStatistics Valid=655, Invalid=5903, Unknown=100, NotChecked=652, Total=7310 [2024-11-08 18:01:15,557 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 47 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 1101 mSolverCounterSat, 29 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1101 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 39.1s IncrementalHoareTripleChecker+Time [2024-11-08 18:01:15,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 817 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1101 Invalid, 3 Unknown, 184 Unchecked, 39.1s Time] [2024-11-08 18:01:15,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-08 18:01:15,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-08 18:01:15,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 78 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:01:15,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2024-11-08 18:01:15,559 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 50 [2024-11-08 18:01:15,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 18:01:15,560 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2024-11-08 18:01:15,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.1194029850746268) internal successors, (142), 67 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 18:01:15,560 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2024-11-08 18:01:15,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-08 18:01:15,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 18:01:15,561 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 18:01:15,579 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-08 18:01:15,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:01:15,762 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 30 more)] === [2024-11-08 18:01:15,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 18:01:15,762 INFO L85 PathProgramCache]: Analyzing trace with hash 485334620, now seen corresponding path program 2 times [2024-11-08 18:01:15,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 18:01:15,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348321919] [2024-11-08 18:01:15,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 18:01:15,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 18:01:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 18:01:24,266 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:01:24,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 18:01:24,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348321919] [2024-11-08 18:01:24,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348321919] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 18:01:24,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988364846] [2024-11-08 18:01:24,267 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 18:01:24,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 18:01:24,267 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 18:01:24,269 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 18:01:24,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8edc47cf-8ff0-497e-a10e-8501ddee663f/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 18:01:24,574 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 18:01:24,574 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 18:01:24,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-08 18:01:24,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 18:01:25,116 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 18:01:25,116 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 [2024-11-08 18:01:25,834 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-08 18:01:25,834 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 [2024-11-08 18:01:26,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 18:01:26,629 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 23 treesize of output 11 [2024-11-08 18:01:26,739 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 18:01:26,740 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 1 case distinctions, treesize of input 42 treesize of output 39 [2024-11-08 18:01:27,672 INFO L349 Elim1Store]: treesize reduction 66, result has 35.3 percent of original size [2024-11-08 18:01:27,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 53 [2024-11-08 18:01:28,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-08 18:01:28,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2024-11-08 18:01:28,724 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 23 treesize of output 11 [2024-11-08 18:01:28,792 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 18:01:28,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 35 [2024-11-08 18:01:28,872 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 18:01:28,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 59 [2024-11-08 18:01:28,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:01:28,931 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 24 treesize of output 11 [2024-11-08 18:01:29,888 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 19 treesize of output 18 [2024-11-08 18:01:29,955 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-08 18:01:29,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 93 treesize of output 61 [2024-11-08 18:01:30,458 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-08 18:01:30,458 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-08 18:01:30,562 INFO L349 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2024-11-08 18:01:30,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 104 treesize of output 68 [2024-11-08 18:01:32,245 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-08 18:01:32,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 124 treesize of output 82 [2024-11-08 18:01:32,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:01:32,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-08 18:01:32,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 18:01:32,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 13 [2024-11-08 18:01:34,709 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-08 18:01:34,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 120 treesize of output 78 [2024-11-08 18:01:35,188 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2024-11-08 18:01:35,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 109 treesize of output 55 [2024-11-08 18:01:36,189 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 27 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 18:01:36,190 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 18:01:44,512 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (let ((.cse3 (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse8 (select .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse4 (store .cse8 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse5 (select .cse8 .cse1))) (and (forall ((v_ArrVal_2599 Int) (v_ArrVal_2590 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2590))) (let ((.cse2 (select (select (store .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< (select (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) 0) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select |c_#valid| (select (select (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2599)) .cse5) (+ .cse2 4))) 1))))) (or (forall ((v_ArrVal_2599 Int) (v_ArrVal_2590 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2590))) (or (< (select (select .cse7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) 0) (= (select |c_#valid| (select (select (store .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2599)) .cse5) (+ (select (select (store .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) 4))) 1)))) (= .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))))) is different from false [2024-11-08 18:01:45,935 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:01:45,935 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 1641 treesize of output 1642 [2024-11-08 18:01:45,958 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 1407 treesize of output 1399 [2024-11-08 18:01:45,982 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 1407 treesize of output 1383 [2024-11-08 18:04:01,640 WARN L286 SmtUtils]: Spent 9.30s on a formula simplification. DAG size of input: 235 DAG size of output: 232 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 18:04:13,153 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (.cse11 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse12 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse13 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8))) (let ((.cse4 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse0 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (.cse14 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 1)) (.cse5 (forall ((v_prenex_424 Int) (v_prenex_425 Int) (v_arrayElimCell_515 Int)) (or (< v_arrayElimCell_515 0) (= (select .cse6 (select (let ((.cse127 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse12 0 v_prenex_425) .cse13 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse125 (store (select .cse127 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse126 (select (store .cse127 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse125) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse125) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse126 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse126 4))))) (+ v_arrayElimCell_515 4))) 1)))) (.cse31 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 1)) (.cse36 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse30 (forall ((v_ArrVal_2586 Int)) (or (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (= (select .cse31 (select (let ((.cse124 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse36 0 v_prenex_425)))) (let ((.cse122 (store (select .cse124 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse13 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse123 (store (select (store .cse124 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse122) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse11 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse122) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (store .cse123 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse123 4))))) (+ v_ArrVal_2586 4))) 1)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586)))) (.cse37 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (.cse26 (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (forall ((v_prenex_424 Int) (v_prenex_425 Int) (v_ArrVal_2586 Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1) (select (let ((.cse121 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse117 (store (select .cse121 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse13 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse120 (store .cse121 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse117))) (let ((.cse118 (store (select .cse120 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse119 (select (store .cse120 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse118) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse117) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse118) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse119 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse119 4))))))) (+ v_ArrVal_2586 4))) 1) (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (.cse28 (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (forall ((v_ArrVal_2586 Int)) (or (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586) (forall ((v_arrayElimCell_515 Int)) (or (< v_arrayElimCell_515 0) (= v_arrayElimCell_515 0) (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse110 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1)) (.cse111 (let ((.cse116 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse112 (store (select .cse116 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse13 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse115 (store .cse116 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse112))) (let ((.cse113 (store (select .cse115 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse114 (select (store .cse115 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse113) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse112) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse113) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse114 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse114 4))))))))) (or (= (select .cse110 (select .cse111 (+ v_ArrVal_2586 4))) 1) (= (select .cse110 (select .cse111 (+ v_arrayElimCell_515 4))) 1))))))))))) (.cse29 (or .cse0 .cse14 .cse5)) (.cse3 (not .cse4)) (.cse74 (and (forall ((v_ArrVal_2586 Int)) (or (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586) (forall ((v_arrayElimCell_515 Int)) (or (< v_arrayElimCell_515 0) (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse106 (let ((.cse109 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse12 0 v_prenex_425) .cse13 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse107 (store (select .cse109 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse108 (select (store .cse109 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse107) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse107) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse108 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse108 4))))))) (or (= (select .cse6 (select .cse106 (+ v_ArrVal_2586 4))) 1) (= (select .cse6 (select .cse106 (+ v_arrayElimCell_515 4))) 1)))))))) (or .cse5 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)))) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse27 (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (forall ((v_ArrVal_2586 Int)) (or (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (= (select (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1) (select (let ((.cse105 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse101 (store (select .cse105 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse13 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse104 (store .cse105 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse101))) (let ((.cse102 (store (select .cse104 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse103 (select (store .cse104 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse102) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse101) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse102) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse103 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse103 4))))))) (+ v_ArrVal_2586 4))) 1)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (and (or .cse0 (let ((.cse2 (and .cse5 (forall ((v_ArrVal_2586 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586) (forall ((v_arrayElimCell_515 Int)) (or (< v_arrayElimCell_515 0) (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse7 (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse12 0 v_prenex_425) .cse13 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse8 (store (select .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse9 (select (store .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse8) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse8) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse9 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse9 4))))))) (or (= (select .cse6 (select .cse7 (+ v_ArrVal_2586 4))) 1) (= (select .cse6 (select .cse7 (+ v_arrayElimCell_515 4))) 1))))))))))) (and (or .cse1 .cse2 .cse3) (or .cse1 .cse2) (or .cse4 .cse2)))) (or .cse0 .cse4 .cse14 .cse5) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (forall ((v_prenex_424 Int) (v_prenex_425 Int) (v_ArrVal_2586 Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1) (select (let ((.cse19 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse15 (store (select .cse19 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse13 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse18 (store .cse19 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse15))) (let ((.cse16 (store (select .cse18 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse17 (select (store .cse18 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse16) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse15) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse16) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse17 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse17 4))))))) (+ v_ArrVal_2586 4))) 1) (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (forall ((v_ArrVal_2586 Int) (v_ArrVal_2599 Int) (v_ArrVal_2589 Int)) (let ((.cse25 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_ArrVal_2589)))) (let ((.cse20 (store (select .cse25 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse13 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse24 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse20))) (let ((.cse21 (store (select .cse24 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse22 (select (store .cse24 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse21) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse23 (select .cse22 4))) (or (= (select (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse20) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse21) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse22 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_ArrVal_2599)) .cse23) (+ v_ArrVal_2586 4))) 1) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse23))))))))))) (or .cse1 .cse4 (and .cse26 .cse27 .cse28 .cse29 (or (and .cse30 (forall ((v_ArrVal_2586 Int)) (or (= v_ArrVal_2586 0) (forall ((v_arrayElimCell_515 Int)) (or (< v_arrayElimCell_515 0) (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse32 (let ((.cse35 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse36 0 v_prenex_425)))) (let ((.cse33 (store (select .cse35 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse13 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse34 (store (select (store .cse35 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse33) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse11 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse33) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (store .cse34 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse34 4))))))) (or (= (select .cse31 (select .cse32 (+ v_ArrVal_2586 4))) 1) (= (select .cse31 (select .cse32 (+ v_arrayElimCell_515 4))) 1)))))) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586)))) .cse37) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (forall ((v_ArrVal_2586 Int)) (or (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (forall ((v_arrayElimCell_515 Int)) (or (< v_arrayElimCell_515 0) (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse38 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1)) (.cse39 (let ((.cse44 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse40 (store (select .cse44 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse13 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse43 (store .cse44 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse40))) (let ((.cse41 (store (select .cse43 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse42 (select (store .cse43 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse41) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse40) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse41) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse42 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse42 4))))))))) (or (= (select .cse38 (select .cse39 (+ v_ArrVal_2586 4))) 1) (= (select .cse38 (select .cse39 (+ v_arrayElimCell_515 4))) 1)))))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (forall ((v_ArrVal_2586 Int)) (or (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586) (forall ((v_arrayElimCell_515 Int)) (or (< v_arrayElimCell_515 0) (= v_arrayElimCell_515 0) (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse45 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1)) (.cse46 (let ((.cse51 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse47 (store (select .cse51 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse13 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse50 (store .cse51 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse47))) (let ((.cse48 (store (select .cse50 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse49 (select (store .cse50 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse48) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse47) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse48) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse49 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse49 4))))))))) (or (= (select .cse45 (select .cse46 (+ v_ArrVal_2586 4))) 1) (= (select .cse45 (select .cse46 (+ v_arrayElimCell_515 4))) 1)))))))))) (or .cse1 .cse4 (and (forall ((v_ArrVal_2586 Int)) (or (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (forall ((v_arrayElimCell_515 Int)) (or (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse52 (let ((.cse55 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse36 0 v_prenex_425)))) (let ((.cse53 (store (select .cse55 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse13 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse54 (store (select (store .cse55 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse53) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse11 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse53) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (store .cse54 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse54 4))))))) (or (= (select .cse31 (select .cse52 (+ v_ArrVal_2586 4))) 1) (= (select .cse31 (select .cse52 (+ v_arrayElimCell_515 4))) 1)))) (= v_arrayElimCell_515 0))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) .cse30 (forall ((v_prenex_424 Int) (v_prenex_425 Int) (v_ArrVal_2586 Int) (v_arrayElimCell_515 Int)) (let ((.cse56 (let ((.cse59 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse36 0 v_prenex_425)))) (let ((.cse57 (store (select .cse59 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse13 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse58 (store (select (store .cse59 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse57) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse11 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse57) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (store .cse58 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse58 4))))))) (or (= v_ArrVal_2586 0) (= (select .cse31 (select .cse56 (+ v_ArrVal_2586 4))) 1) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586) (= (select .cse31 (select .cse56 (+ v_arrayElimCell_515 4))) 1))))) .cse37) (or .cse1 (and .cse27 (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (forall ((v_ArrVal_2586 Int)) (or (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586) (forall ((v_arrayElimCell_515 Int)) (or (< v_arrayElimCell_515 0) (= v_arrayElimCell_515 0) (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse60 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1)) (.cse61 (let ((.cse66 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse62 (store (select .cse66 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse13 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse65 (store .cse66 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse62))) (let ((.cse63 (store (select .cse65 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse64 (select (store .cse65 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse63) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse62) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse63) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse64 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse64 4))))))))) (or (= (select .cse60 (select .cse61 (+ v_ArrVal_2586 4))) 1) (= (select .cse60 (select .cse61 (+ v_arrayElimCell_515 4))) 1)))))))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (forall ((v_ArrVal_2586 Int)) (or (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (forall ((v_arrayElimCell_515 Int)) (or (< v_arrayElimCell_515 0) (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse67 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1)) (.cse68 (let ((.cse73 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse69 (store (select .cse73 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse13 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse72 (store .cse73 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse69))) (let ((.cse70 (store (select .cse72 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse71 (select (store .cse72 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse70) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse69) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse70) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse71 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse71 4))))))))) (or (= (select .cse67 (select .cse68 (+ v_ArrVal_2586 4))) 1) (= (select .cse67 (select .cse68 (+ v_arrayElimCell_515 4))) 1)))))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or .cse1 (and .cse26 .cse28 .cse29 (or .cse0 .cse3 .cse74))) (or .cse0 .cse4 .cse74) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (forall ((v_ArrVal_2586 Int)) (or (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (= (select (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1) (select (let ((.cse79 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse75 (store (select .cse79 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse13 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse78 (store .cse79 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse75))) (let ((.cse76 (store (select .cse78 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse77 (select (store .cse78 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse76) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse75) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse76) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse77 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse77 4))))))) (+ v_ArrVal_2586 4))) 1)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (forall ((v_ArrVal_2586 Int)) (or (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (forall ((v_prenex_424 Int) (v_prenex_425 Int) (v_arrayElimCell_515 Int)) (let ((.cse80 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1)) (.cse81 (let ((.cse86 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse82 (store (select .cse86 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse13 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse85 (store .cse86 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse82))) (let ((.cse83 (store (select .cse85 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse84 (select (store .cse85 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse83) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse82) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse83) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse84 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse84 4))))))))) (or (= (select .cse80 (select .cse81 (+ v_ArrVal_2586 4))) 1) (= (select .cse80 (select .cse81 (+ v_arrayElimCell_515 4))) 1)))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or .cse1 (and .cse27 (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int)) (or (forall ((v_ArrVal_2586 Int)) (or (= v_ArrVal_2586 0) (forall ((v_arrayElimCell_515 Int)) (or (= v_arrayElimCell_515 0) (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse87 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1)) (.cse88 (let ((.cse93 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse89 (store (select .cse93 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse13 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse92 (store .cse93 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse89))) (let ((.cse90 (store (select .cse92 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse91 (select (store .cse92 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse90) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse89) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse90) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse91 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse91 4))))))))) (or (= (select .cse87 (select .cse88 (+ v_ArrVal_2586 4))) 1) (= (select .cse87 (select .cse88 (+ v_arrayElimCell_515 4))) 1)))))) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or .cse4 (forall ((v_prenex_424 Int) (v_prenex_425 Int) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2586 Int) (v_arrayElimCell_515 Int)) (let ((.cse94 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1)) (.cse95 (let ((.cse100 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse96 (store (select .cse100 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse13 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse99 (store .cse100 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse96))) (let ((.cse97 (store (select .cse99 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse98 (select (store .cse99 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse97) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse96) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse97) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse98 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse98 4))))))))) (or (= (select .cse94 (select .cse95 (+ v_ArrVal_2586 4))) 1) (= v_ArrVal_2586 0) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (< v_ArrVal_2586 0) (= (select .cse94 (select .cse95 (+ v_arrayElimCell_515 4))) 1) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))))))))) is different from true [2024-11-08 18:04:21,528 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse4 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (.cse10 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse11 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8))) (let ((.cse71 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 1)) (.cse13 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (.cse41 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 1)) (.cse12 (forall ((v_prenex_424 Int) (v_prenex_425 Int) (v_ArrVal_2582 (Array Int Int)) (v_arrayElimCell_515 Int)) (or (< v_arrayElimCell_515 0) (= (select .cse4 (select (let ((.cse142 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse145 (store .cse142 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store (store (select .cse142 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425) .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse143 (store (select .cse145 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse144 (select (store .cse145 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse143) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (select (store (store .cse142 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse143) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse144 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse144 4)))))) (+ v_arrayElimCell_515 4))) 1)))) (.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse3 (not .cse0)) (.cse15 (and (or .cse12 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (forall ((v_ArrVal_2586 Int) (v_ArrVal_2582 (Array Int Int))) (or (forall ((v_arrayElimCell_515 Int)) (or (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse137 (let ((.cse138 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse141 (store .cse138 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store (store (select .cse138 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425) .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse139 (store (select .cse141 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse140 (select (store .cse141 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse139) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (select (store (store .cse138 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse139) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse140 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse140 4)))))))) (or (= (select .cse4 (select .cse137 (+ v_arrayElimCell_515 4))) 1) (= (select .cse4 (select .cse137 (+ v_ArrVal_2586 4))) 1)))) (< v_arrayElimCell_515 0))) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))))) (.cse14 (or .cse13 .cse41 .cse12)) (.cse16 (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2582 (Array Int Int))) (or (forall ((v_ArrVal_2586 Int)) (or (forall ((v_arrayElimCell_515 Int)) (or (< v_arrayElimCell_515 0) (= v_arrayElimCell_515 0) (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse129 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1)) (.cse130 (let ((.cse131 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse136 (store .cse131 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store (select .cse131 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse132 (store (select .cse136 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse135 (store .cse136 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse132))) (let ((.cse133 (store (select .cse135 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse134 (select (store .cse135 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse133) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store .cse131 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse132) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse133) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse134 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse134 4)))))))))) (or (= (select .cse129 (select .cse130 (+ v_arrayElimCell_515 4))) 1) (= (select .cse129 (select .cse130 (+ v_ArrVal_2586 4))) 1)))))) (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0))))) (.cse17 (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2582 (Array Int Int))) (or (forall ((v_prenex_424 Int) (v_prenex_425 Int) (v_ArrVal_2586 Int)) (or (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (= (select (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1) (select (let ((.cse123 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse128 (store .cse123 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store (select .cse123 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse124 (store (select .cse128 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse127 (store .cse128 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse124))) (let ((.cse125 (store (select .cse127 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse126 (select (store .cse127 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse125) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store .cse123 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse124) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse125) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse126 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse126 4)))))))) (+ v_ArrVal_2586 4))) 1) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (.cse26 (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2582 (Array Int Int))) (or (forall ((v_ArrVal_2586 Int)) (or (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (= (select (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1) (select (let ((.cse117 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse122 (store .cse117 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store (select .cse117 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse118 (store (select .cse122 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse121 (store .cse122 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse118))) (let ((.cse119 (store (select .cse121 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse120 (select (store .cse121 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse119) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store .cse117 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse118) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse119) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse120 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse120 4)))))))) (+ v_ArrVal_2586 4))) 1)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (.cse2 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse77 (forall ((v_ArrVal_2586 Int) (v_ArrVal_2582 (Array Int Int))) (or (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586) (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (= (select .cse71 (select (let ((.cse113 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse116 (store .cse113 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (store (select .cse113 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse114 (store (select .cse116 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse11 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse115 (store (select (store .cse116 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse114) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store (store .cse113 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse114) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (store .cse115 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse115 4)))))) (+ v_ArrVal_2586 4))) 1))))) (.cse78 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) (and (or (let ((.cse1 (and (forall ((v_ArrVal_2586 Int) (v_ArrVal_2582 (Array Int Int))) (or (forall ((v_arrayElimCell_515 Int)) (or (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse9 (store .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store (store (select .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425) .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse7 (store (select .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse8 (select (store .cse9 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse7) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (select (store (store .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse7) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse8 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse8 4)))))))) (or (= (select .cse4 (select .cse5 (+ v_arrayElimCell_515 4))) 1) (= (select .cse4 (select .cse5 (+ v_ArrVal_2586 4))) 1)))) (< v_arrayElimCell_515 0))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) .cse12))) (and (or .cse0 .cse1) (or .cse2 .cse1) (or .cse2 .cse1 .cse3))) .cse13) (or .cse2 (and .cse14 (or .cse13 .cse15 .cse3) .cse16 .cse17)) (or .cse2 (and (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2582 (Array Int Int))) (or (forall ((v_ArrVal_2586 Int)) (or (forall ((v_arrayElimCell_515 Int)) (or (< v_arrayElimCell_515 0) (= v_arrayElimCell_515 0) (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse18 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1)) (.cse19 (let ((.cse20 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse25 (store .cse20 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store (select .cse20 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse21 (store (select .cse25 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse24 (store .cse25 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse21))) (let ((.cse22 (store (select .cse24 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse23 (select (store .cse24 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse22) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store .cse20 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse21) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse22) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse23 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse23 4)))))))))) (or (= (select .cse18 (select .cse19 (+ v_arrayElimCell_515 4))) 1) (= (select .cse18 (select .cse19 (+ v_ArrVal_2586 4))) 1)))))) (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) .cse26)) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2582 (Array Int Int))) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_2586 Int)) (or (forall ((v_arrayElimCell_515 Int)) (or (< v_arrayElimCell_515 0) (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse27 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1)) (.cse28 (let ((.cse29 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse34 (store .cse29 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store (select .cse29 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse30 (store (select .cse34 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse33 (store .cse34 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse30))) (let ((.cse31 (store (select .cse33 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse32 (select (store .cse33 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse31) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store .cse29 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse30) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse31) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse32 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse32 4)))))))))) (or (= (select .cse27 (select .cse28 (+ v_arrayElimCell_515 4))) 1) (= (select .cse27 (select .cse28 (+ v_ArrVal_2586 4))) 1)))))) (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or .cse13 .cse15 .cse0) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2582 (Array Int Int))) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_2586 Int)) (or (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (= (select (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1) (select (let ((.cse35 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse40 (store .cse35 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store (select .cse35 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse36 (store (select .cse40 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse39 (store .cse40 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse36))) (let ((.cse37 (store (select .cse39 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse38 (select (store .cse39 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse37) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store .cse35 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse36) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse37) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse38 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse38 4)))))))) (+ v_ArrVal_2586 4))) 1)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or .cse13 .cse0 .cse41 .cse12) (or .cse2 (and (or (forall ((v_prenex_424 Int) (v_prenex_425 Int) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2586 Int) (v_ArrVal_2582 (Array Int Int)) (v_arrayElimCell_515 Int)) (let ((.cse42 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1)) (.cse43 (let ((.cse44 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse49 (store .cse44 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store (select .cse44 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse45 (store (select .cse49 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse48 (store .cse49 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse45))) (let ((.cse46 (store (select .cse48 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse47 (select (store .cse48 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse46) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store .cse44 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse45) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse46) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse47 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse47 4)))))))))) (or (= (select .cse42 (select .cse43 (+ v_arrayElimCell_515 4))) 1) (= v_ArrVal_2586 0) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (< v_ArrVal_2586 0) (= (select .cse42 (select .cse43 (+ v_ArrVal_2586 4))) 1) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) .cse0) .cse26 (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2582 (Array Int Int))) (or (forall ((v_ArrVal_2586 Int)) (or (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (forall ((v_arrayElimCell_515 Int)) (or (= v_arrayElimCell_515 0) (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse50 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1)) (.cse51 (let ((.cse52 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse57 (store .cse52 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store (select .cse52 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse53 (store (select .cse57 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse56 (store .cse57 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse53))) (let ((.cse54 (store (select .cse56 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse55 (select (store .cse56 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse54) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store .cse52 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse53) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse54) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse55 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse55 4)))))))))) (or (= (select .cse50 (select .cse51 (+ v_arrayElimCell_515 4))) 1) (= (select .cse50 (select .cse51 (+ v_ArrVal_2586 4))) 1)))))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2582 (Array Int Int))) (or (forall ((v_prenex_424 Int) (v_prenex_425 Int) (v_ArrVal_2586 Int)) (or (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (= (select (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1) (select (let ((.cse58 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse63 (store .cse58 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store (select .cse58 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse59 (store (select .cse63 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse62 (store .cse63 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse59))) (let ((.cse60 (store (select .cse62 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse61 (select (store .cse62 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse60) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store .cse58 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse59) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse60) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse61 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse61 4)))))))) (+ v_ArrVal_2586 4))) 1) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2582 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (forall ((v_ArrVal_2586 Int) (v_ArrVal_2599 Int) (v_ArrVal_2589 Int)) (let ((.cse65 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse70 (store .cse65 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store (select .cse65 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_ArrVal_2589)))) (let ((.cse66 (store (select .cse70 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse69 (store .cse70 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse66))) (let ((.cse67 (store (select .cse69 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse68 (select (store .cse69 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse67) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse64 (select .cse68 4))) (or (< v_ArrVal_2586 0) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse64) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586) (= (select (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1) (select (select (store (store (store .cse65 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse66) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse67) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse68 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_ArrVal_2599)) .cse64) (+ v_ArrVal_2586 4))) 1)))))))))))) (or (and .cse14 .cse16 .cse17 .cse26 (or (and (forall ((v_ArrVal_2586 Int) (v_ArrVal_2582 (Array Int Int))) (or (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586) (forall ((v_arrayElimCell_515 Int)) (or (< v_arrayElimCell_515 0) (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse72 (let ((.cse73 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse76 (store .cse73 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (store (select .cse73 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse74 (store (select .cse76 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse11 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse75 (store (select (store .cse76 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse74) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store (store .cse73 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse74) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (store .cse75 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse75 4)))))))) (or (= (select .cse71 (select .cse72 (+ v_ArrVal_2586 4))) 1) (= (select .cse71 (select .cse72 (+ v_arrayElimCell_515 4))) 1)))))))) .cse77) .cse78) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2582 (Array Int Int))) (or (forall ((v_ArrVal_2586 Int)) (or (forall ((v_arrayElimCell_515 Int)) (or (< v_arrayElimCell_515 0) (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse79 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1)) (.cse80 (let ((.cse81 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse86 (store .cse81 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store (select .cse81 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse82 (store (select .cse86 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse85 (store .cse86 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse82))) (let ((.cse83 (store (select .cse85 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse84 (select (store .cse85 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse83) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store .cse81 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse82) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse83) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse84 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse84 4)))))))))) (or (= (select .cse79 (select .cse80 (+ v_arrayElimCell_515 4))) 1) (= (select .cse79 (select .cse80 (+ v_ArrVal_2586 4))) 1)))))) (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) .cse2 .cse0) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2582 (Array Int Int))) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_2586 Int)) (or (forall ((v_arrayElimCell_515 Int)) (or (< v_arrayElimCell_515 0) (= v_arrayElimCell_515 0) (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse87 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1)) (.cse88 (let ((.cse89 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse94 (store .cse89 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store (select .cse89 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse90 (store (select .cse94 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse93 (store .cse94 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse90))) (let ((.cse91 (store (select .cse93 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse92 (select (store .cse93 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse91) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store .cse89 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse90) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse91) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse92 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse92 4)))))))))) (or (= (select .cse87 (select .cse88 (+ v_arrayElimCell_515 4))) 1) (= (select .cse87 (select .cse88 (+ v_ArrVal_2586 4))) 1)))))) (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)))) (or .cse2 .cse0 (and (forall ((v_prenex_424 Int) (v_prenex_425 Int) (v_ArrVal_2586 Int) (v_ArrVal_2582 (Array Int Int)) (v_arrayElimCell_515 Int)) (let ((.cse95 (let ((.cse96 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse99 (store .cse96 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (store (select .cse96 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse97 (store (select .cse99 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse11 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse98 (store (select (store .cse99 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse97) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store (store .cse96 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse97) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (store .cse98 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse98 4)))))))) (or (= (select .cse71 (select .cse95 (+ v_ArrVal_2586 4))) 1) (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586) (= (select .cse71 (select .cse95 (+ v_arrayElimCell_515 4))) 1)))) .cse77 (forall ((v_ArrVal_2586 Int) (v_ArrVal_2582 (Array Int Int))) (or (= v_ArrVal_2586 0) (forall ((v_arrayElimCell_515 Int)) (or (= v_arrayElimCell_515 0) (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse100 (let ((.cse101 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse104 (store .cse101 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (store (select .cse101 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse102 (store (select .cse104 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse11 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse103 (store (select (store .cse104 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse102) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store (store .cse101 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse102) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (store .cse103 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse103 4)))))))) (or (= (select .cse71 (select .cse100 (+ v_ArrVal_2586 4))) 1) (= (select .cse71 (select .cse100 (+ v_arrayElimCell_515 4))) 1)))))) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586)))) .cse78) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2582 (Array Int Int))) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_2586 Int)) (or (forall ((v_prenex_424 Int) (v_prenex_425 Int) (v_arrayElimCell_515 Int)) (let ((.cse105 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1)) (.cse106 (let ((.cse107 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse112 (store .cse107 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store (select .cse107 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425)))) (let ((.cse108 (store (select .cse112 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse11 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse111 (store .cse112 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse108))) (let ((.cse109 (store (select .cse111 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse10 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse110 (select (store .cse111 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse109) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store .cse107 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse108) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse109) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse110 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse110 4)))))))))) (or (= (select .cse105 (select .cse106 (+ v_arrayElimCell_515 4))) 1) (= (select .cse105 (select .cse106 (+ v_ArrVal_2586 4))) 1)))) (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))))) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) is different from true [2024-11-08 18:04:30,473 WARN L873 $PredicateComparison]: unable to prove that (or (let ((.cse19 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 1)) (.cse7 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse11 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse10 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8))) (let ((.cse45 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 1)) (.cse12 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (.cse15 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 1)) (.cse13 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse14 (forall ((v_prenex_424 Int) (v_prenex_425 Int) (v_ArrVal_2581 Int) (v_ArrVal_2582 (Array Int Int)) (v_arrayElimCell_515 Int)) (or (< v_arrayElimCell_515 0) (= (select .cse19 (select (let ((.cse160 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse163 (store .cse160 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2581)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425) .cse10 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse161 (store (select .cse163 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse162 (select (store .cse163 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse161) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (select (store (store .cse160 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse161) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse162 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse162 4)))))) (+ v_arrayElimCell_515 4))) 1))))) (let ((.cse34 (and (or .cse14 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (forall ((v_ArrVal_2581 Int) (v_ArrVal_2586 Int) (v_ArrVal_2582 (Array Int Int))) (or (< v_ArrVal_2586 0) (forall ((v_arrayElimCell_515 Int)) (or (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse155 (let ((.cse156 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse159 (store .cse156 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2581)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425) .cse10 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse157 (store (select .cse159 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse158 (select (store .cse159 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse157) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (select (store (store .cse156 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse157) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse158 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse158 4)))))))) (or (= (select .cse19 (select .cse155 (+ v_ArrVal_2586 4))) 1) (= (select .cse19 (select .cse155 (+ v_arrayElimCell_515 4))) 1)))) (< v_arrayElimCell_515 0))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))))) (.cse18 (not .cse13)) (.cse74 (forall ((v_ArrVal_2581 Int) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2582 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_prenex_424 Int) (v_prenex_425 Int) (v_ArrVal_2586 Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1) (select (let ((.cse154 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2581)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse153 (store (store (select .cse154 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425))) (let ((.cse148 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582)) (.cse149 (store (select (store .cse154 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse153) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse152 (store (store .cse148 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse153) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse149))) (let ((.cse150 (store (select .cse152 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse7 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse151 (select (store .cse152 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse150) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store .cse148 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse149) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse150) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse151 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse151 4)))))))) (+ v_ArrVal_2586 4))) 1) (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586)))))) (.cse75 (or .cse12 .cse14 .cse15)) (.cse52 (forall ((v_ArrVal_2581 Int) (v_ArrVal_2586 Int) (v_ArrVal_2582 (Array Int Int))) (or (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586) (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (= 1 (select .cse45 (select (let ((.cse147 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2581)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse146 (store (store (select .cse147 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425))) (let ((.cse143 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582)) (.cse144 (store (select (store .cse147 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse146) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse145 (store (select (store (store .cse143 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse146) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse144) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store (store .cse143 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse144) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (store .cse145 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse145 4)))))) (+ v_ArrVal_2586 4)))))))) (.cse59 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (.cse76 (forall ((v_ArrVal_2581 Int) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2582 (Array Int Int))) (or (forall ((v_ArrVal_2586 Int)) (or (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586) (forall ((v_arrayElimCell_515 Int)) (or (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse134 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1)) (.cse135 (let ((.cse142 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2581)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse141 (store (store (select .cse142 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425))) (let ((.cse136 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582)) (.cse137 (store (select (store .cse142 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse141) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse140 (store (store .cse136 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse141) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse137))) (let ((.cse138 (store (select .cse140 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse7 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse139 (select (store .cse140 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse138) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store .cse136 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse137) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse138) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse139 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse139 4)))))))))) (or (= (select .cse134 (select .cse135 (+ v_ArrVal_2586 4))) 1) (= (select .cse134 (select .cse135 (+ v_arrayElimCell_515 4))) 1)))) (< v_arrayElimCell_515 0) (= v_arrayElimCell_515 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0))))) (.cse17 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse44 (forall ((v_ArrVal_2581 Int) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2582 (Array Int Int))) (or (forall ((v_ArrVal_2586 Int)) (or (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (= (select (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1) (select (let ((.cse133 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2581)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse132 (store (store (select .cse133 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425))) (let ((.cse127 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582)) (.cse128 (store (select (store .cse133 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse132) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse131 (store (store .cse127 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse132) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse128))) (let ((.cse129 (store (select .cse131 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse7 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse130 (select (store .cse131 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse129) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store .cse127 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse128) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse129) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse130 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse130 4)))))))) (+ v_ArrVal_2586 4))) 1)) (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (and (forall ((v_ArrVal_2581 Int) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2582 (Array Int Int))) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (forall ((v_ArrVal_2586 Int)) (or (forall ((v_arrayElimCell_515 Int)) (or (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse0 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1)) (.cse1 (let ((.cse9 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2581)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse8 (store (store (select .cse9 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582)) (.cse3 (store (select (store .cse9 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse8) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse6 (store (store .cse2 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse8) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse3))) (let ((.cse4 (store (select .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse7 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse5 (select (store .cse6 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse4) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse3) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse4) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse5 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse5 4)))))))))) (or (= (select .cse0 (select .cse1 (+ v_ArrVal_2586 4))) 1) (= (select .cse0 (select .cse1 (+ v_arrayElimCell_515 4))) 1)))) (< v_arrayElimCell_515 0))) (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or .cse12 .cse13 .cse14 .cse15) (or .cse12 (let ((.cse16 (and .cse14 (forall ((v_ArrVal_2581 Int) (v_ArrVal_2586 Int) (v_ArrVal_2582 (Array Int Int))) (or (forall ((v_arrayElimCell_515 Int)) (or (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse20 (let ((.cse21 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse24 (store .cse21 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store (store (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2581)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425) .cse10 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (let ((.cse22 (store (select .cse24 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse23 (select (store .cse24 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse22) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (select (store (store .cse21 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse22) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (store .cse23 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse23 4)))))))) (or (= (select .cse19 (select .cse20 (+ v_ArrVal_2586 4))) 1) (= (select .cse19 (select .cse20 (+ v_arrayElimCell_515 4))) 1)))) (< v_arrayElimCell_515 0))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586)))))) (and (or .cse16 .cse17) (or .cse16 .cse17 .cse18) (or .cse16 .cse13)))) (forall ((v_ArrVal_2581 Int) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2582 (Array Int Int))) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_2586 Int)) (or (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (forall ((v_prenex_424 Int) (v_prenex_425 Int) (v_arrayElimCell_515 Int)) (let ((.cse25 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1)) (.cse26 (let ((.cse33 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2581)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse32 (store (store (select .cse33 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425))) (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582)) (.cse28 (store (select (store .cse33 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse31 (store (store .cse27 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse32) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse28))) (let ((.cse29 (store (select .cse31 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse7 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse30 (select (store .cse31 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse29) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store .cse27 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse28) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse29) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse30 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse30 4)))))))))) (or (= (select .cse25 (select .cse26 (+ v_ArrVal_2586 4))) 1) (= (select .cse25 (select .cse26 (+ v_arrayElimCell_515 4))) 1)))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or .cse12 .cse13 .cse34) (or (and (forall ((v_ArrVal_2581 Int) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2582 (Array Int Int))) (or (forall ((v_ArrVal_2586 Int)) (or (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586) (forall ((v_arrayElimCell_515 Int)) (or (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse35 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1)) (.cse36 (let ((.cse43 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2581)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse42 (store (store (select .cse43 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425))) (let ((.cse37 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582)) (.cse38 (store (select (store .cse43 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse42) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse41 (store (store .cse37 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse42) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse38))) (let ((.cse39 (store (select .cse41 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse7 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse40 (select (store .cse41 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse39) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store .cse37 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse38) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse39) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse40 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse40 4)))))))))) (or (= (select .cse35 (select .cse36 (+ v_ArrVal_2586 4))) 1) (= (select .cse35 (select .cse36 (+ v_arrayElimCell_515 4))) 1)))) (< v_arrayElimCell_515 0) (= v_arrayElimCell_515 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) .cse44) .cse17) (or .cse17 .cse13 (and (forall ((v_prenex_424 Int) (v_prenex_425 Int) (v_ArrVal_2581 Int) (v_ArrVal_2586 Int) (v_ArrVal_2582 (Array Int Int)) (v_arrayElimCell_515 Int)) (let ((.cse46 (let ((.cse51 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2581)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse50 (store (store (select .cse51 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425))) (let ((.cse47 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582)) (.cse48 (store (select (store .cse51 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse50) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse49 (store (select (store (store .cse47 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse50) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse48) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store (store .cse47 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse48) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (store .cse49 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse49 4)))))))) (or (= 1 (select .cse45 (select .cse46 (+ v_ArrVal_2586 4)))) (= v_ArrVal_2586 0) (= (select .cse45 (select .cse46 (+ v_arrayElimCell_515 4))) 1) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586)))) .cse52 (forall ((v_ArrVal_2581 Int) (v_ArrVal_2586 Int) (v_ArrVal_2582 (Array Int Int))) (or (forall ((v_arrayElimCell_515 Int)) (or (= v_arrayElimCell_515 0) (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse53 (let ((.cse58 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2581)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse57 (store (store (select .cse58 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425))) (let ((.cse54 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582)) (.cse55 (store (select (store .cse58 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse57) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse56 (store (select (store (store .cse54 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse57) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse55) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store (store .cse54 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse55) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (store .cse56 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse56 4)))))))) (or (= 1 (select .cse45 (select .cse53 (+ v_ArrVal_2586 4)))) (= (select .cse45 (select .cse53 (+ v_arrayElimCell_515 4))) 1)))))) (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586)))) .cse59) (forall ((v_ArrVal_2581 Int) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2582 (Array Int Int))) (or (forall ((v_ArrVal_2586 Int)) (or (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (= (select (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1) (select (let ((.cse66 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2581)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse65 (store (store (select .cse66 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425))) (let ((.cse60 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582)) (.cse61 (store (select (store .cse66 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse65) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse64 (store (store .cse60 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse65) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse61))) (let ((.cse62 (store (select .cse64 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse7 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse63 (select (store .cse64 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse62) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store .cse60 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse61) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse62) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse63 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse63 4)))))))) (+ v_ArrVal_2586 4))) 1)) (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_2581 Int) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2582 (Array Int Int))) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_prenex_424 Int) (v_prenex_425 Int) (v_ArrVal_2586 Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1) (select (let ((.cse73 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2581)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse72 (store (store (select .cse73 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425))) (let ((.cse67 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582)) (.cse68 (store (select (store .cse73 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse72) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse71 (store (store .cse67 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse72) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse68))) (let ((.cse69 (store (select .cse71 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse7 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse70 (select (store .cse71 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse69) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store .cse67 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse68) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse69) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse70 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse70 4)))))))) (+ v_ArrVal_2586 4))) 1) (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))))) (or .cse17 (and .cse74 .cse75 .cse76 (or .cse12 .cse34 .cse18))) (forall ((v_ArrVal_2581 Int) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2582 (Array Int Int))) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_2586 Int)) (or (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586) (forall ((v_arrayElimCell_515 Int)) (or (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse77 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1)) (.cse78 (let ((.cse85 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2581)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse84 (store (store (select .cse85 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425))) (let ((.cse79 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582)) (.cse80 (store (select (store .cse85 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse84) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse83 (store (store .cse79 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse84) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse80))) (let ((.cse81 (store (select .cse83 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse7 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse82 (select (store .cse83 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse81) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store .cse79 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse80) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse81) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse82 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse82 4)))))))))) (or (= (select .cse77 (select .cse78 (+ v_ArrVal_2586 4))) 1) (= (select .cse77 (select .cse78 (+ v_arrayElimCell_515 4))) 1)))) (< v_arrayElimCell_515 0) (= v_arrayElimCell_515 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)))) (forall ((v_ArrVal_2581 Int) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2582 (Array Int Int))) (or (forall ((v_ArrVal_2586 Int) (v_ArrVal_2599 Int) (v_ArrVal_2589 Int)) (let ((.cse93 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2581)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse92 (store (store (select .cse93 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_ArrVal_2589))) (let ((.cse87 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582)) (.cse88 (store (select (store .cse93 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse92) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse91 (store (store .cse87 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse92) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse88))) (let ((.cse89 (store (select .cse91 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse7 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse90 (select (store .cse91 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse89) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse86 (select .cse90 4))) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse86) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586) (= (select (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1) (select (select (store (store (store .cse87 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse88) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse89) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse90 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_ArrVal_2599)) .cse86) (+ v_ArrVal_2586 4))) 1)))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)))) (or (and .cse74 .cse44 .cse75 (or (and .cse52 (forall ((v_ArrVal_2581 Int) (v_ArrVal_2586 Int) (v_ArrVal_2582 (Array Int Int))) (or (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (forall ((v_arrayElimCell_515 Int)) (or (< v_arrayElimCell_515 0) (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse94 (let ((.cse99 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2581)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse98 (store (store (select .cse99 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425))) (let ((.cse95 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582)) (.cse96 (store (select (store .cse99 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse98) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse97 (store (select (store (store .cse95 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse98) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse96) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store (store .cse95 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse96) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (store .cse97 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse97 4)))))))) (or (= 1 (select .cse45 (select .cse94 (+ v_ArrVal_2586 4)))) (= (select .cse45 (select .cse94 (+ v_arrayElimCell_515 4))) 1)))))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586)))) .cse59) .cse76 (forall ((v_ArrVal_2581 Int) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2582 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (forall ((v_ArrVal_2586 Int)) (or (forall ((v_arrayElimCell_515 Int)) (or (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse100 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1)) (.cse101 (let ((.cse108 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2581)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse107 (store (store (select .cse108 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425))) (let ((.cse102 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582)) (.cse103 (store (select (store .cse108 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse107) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse106 (store (store .cse102 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse107) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse103))) (let ((.cse104 (store (select .cse106 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse7 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse105 (select (store .cse106 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse104) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store .cse102 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse103) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse104) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse105 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse105 4)))))))))) (or (= (select .cse100 (select .cse101 (+ v_ArrVal_2586 4))) 1) (= (select .cse100 (select .cse101 (+ v_arrayElimCell_515 4))) 1)))) (< v_arrayElimCell_515 0))) (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) .cse17 .cse13) (or .cse17 (and .cse44 (or (forall ((v_prenex_424 Int) (v_prenex_425 Int) (v_ArrVal_2581 Int) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2586 Int) (v_ArrVal_2582 (Array Int Int)) (v_arrayElimCell_515 Int)) (let ((.cse109 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1)) (.cse110 (let ((.cse117 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2581)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse116 (store (store (select .cse117 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425))) (let ((.cse111 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582)) (.cse112 (store (select (store .cse117 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse116) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse115 (store (store .cse111 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse116) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse112))) (let ((.cse113 (store (select .cse115 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse7 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse114 (select (store .cse115 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse113) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store .cse111 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse112) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse113) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse114 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse114 4)))))))))) (or (= (select .cse109 (select .cse110 (+ v_ArrVal_2586 4))) 1) (= v_ArrVal_2586 0) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (< v_ArrVal_2586 0) (= (select .cse109 (select .cse110 (+ v_arrayElimCell_515 4))) 1) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) .cse13) (forall ((v_ArrVal_2581 Int) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| Int) (v_ArrVal_2582 (Array Int Int))) (or (forall ((v_ArrVal_2586 Int)) (or (= v_ArrVal_2586 0) (< v_ArrVal_2586 0) (forall ((v_arrayElimCell_515 Int)) (or (forall ((v_prenex_424 Int) (v_prenex_425 Int)) (let ((.cse118 (store |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| 1)) (.cse119 (let ((.cse126 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse11 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2581)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582))) (let ((.cse125 (store (store (select .cse126 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0 v_prenex_425))) (let ((.cse120 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_2582)) (.cse121 (store (select (store .cse126 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse125) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse10 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse124 (store (store .cse120 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| .cse125) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse121))) (let ((.cse122 (store (select .cse124 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse7 |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (let ((.cse123 (select (store .cse124 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse122) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|))) (select (store (store (store .cse120 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| .cse121) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse122) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| (store (store .cse123 8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0 v_prenex_424)) (select .cse123 4)))))))))) (or (= (select .cse118 (select .cse119 (+ v_ArrVal_2586 4))) 1) (= (select .cse118 (select .cse119 (+ v_arrayElimCell_515 4))) 1)))) (= v_arrayElimCell_515 0))) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_ArrVal_2586))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_52| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))))))) (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) is different from true [2024-11-08 18:04:31,151 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:04:31,167 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:04:31,167 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:04:31,383 INFO L349 Elim1Store]: treesize reduction 18, result has 65.4 percent of original size [2024-11-08 18:04:31,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 29035 treesize of output 23180 [2024-11-08 18:04:31,497 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:04:31,504 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:04:31,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:04:31,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2666 treesize of output 2620 [2024-11-08 18:04:31,590 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:04:31,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:04:31,631 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 2721 treesize of output 2601 [2024-11-08 18:04:31,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:04:31,818 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 1 case distinctions, treesize of input 14 treesize of output 8 [2024-11-08 18:04:32,171 INFO L349 Elim1Store]: treesize reduction 68, result has 48.1 percent of original size [2024-11-08 18:04:32,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 2440 treesize of output 2460 [2024-11-08 18:04:32,668 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2024-11-08 18:04:32,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 77 [2024-11-08 18:04:33,046 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:04:33,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:04:33,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2501 treesize of output 2413 [2024-11-08 18:05:11,351 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:11,352 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:11,832 INFO L349 Elim1Store]: treesize reduction 114, result has 37.7 percent of original size [2024-11-08 18:05:11,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 3587 treesize of output 2333 [2024-11-08 18:05:11,864 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:11,872 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:11,938 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-11-08 18:05:11,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 1089 treesize of output 994 [2024-11-08 18:05:11,966 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:12,161 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:05:12,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 583 treesize of output 579 [2024-11-08 18:05:12,228 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:12,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:05:12,294 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 909 treesize of output 893 [2024-11-08 18:05:12,327 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:12,329 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:12,353 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:12,355 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:12,451 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:05:12,452 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 501 treesize of output 493 [2024-11-08 18:05:13,852 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:13,854 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:14,162 INFO L349 Elim1Store]: treesize reduction 57, result has 41.2 percent of original size [2024-11-08 18:05:14,163 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 1794 treesize of output 1183 [2024-11-08 18:05:14,190 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:14,201 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:14,275 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-11-08 18:05:14,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 550 treesize of output 512 [2024-11-08 18:05:14,301 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:14,309 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 454 treesize of output 442 [2024-11-08 18:05:14,328 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:14,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:05:14,384 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 265 treesize of output 257 [2024-11-08 18:05:14,405 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:14,406 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:14,430 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:14,439 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 142 treesize of output 134 [2024-11-08 18:05:14,638 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:14,639 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:15,107 INFO L349 Elim1Store]: treesize reduction 114, result has 37.7 percent of original size [2024-11-08 18:05:15,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 3587 treesize of output 2333 [2024-11-08 18:05:15,138 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:15,149 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:15,232 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-11-08 18:05:15,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 1089 treesize of output 994 [2024-11-08 18:05:15,287 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:15,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:05:15,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 583 treesize of output 579 [2024-11-08 18:05:15,530 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:15,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:05:15,592 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 909 treesize of output 893 [2024-11-08 18:05:15,619 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:15,662 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:15,688 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:15,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:05:15,750 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 2387 treesize of output 2355 [2024-11-08 18:05:16,893 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:16,897 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:17,009 INFO L349 Elim1Store]: treesize reduction 41, result has 37.9 percent of original size [2024-11-08 18:05:17,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 14848 treesize of output 10226 [2024-11-08 18:05:17,254 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:17,309 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-11-08 18:05:17,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 6810 treesize of output 6329 [2024-11-08 18:05:17,416 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 6350 treesize of output 6270 [2024-11-08 18:05:17,553 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 6256 treesize of output 6200 [2024-11-08 18:05:17,812 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:17,822 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:17,862 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:17,869 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 16775 treesize of output 16647 [2024-11-08 18:05:20,144 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:20,148 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:20,268 INFO L349 Elim1Store]: treesize reduction 41, result has 37.9 percent of original size [2024-11-08 18:05:20,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 14848 treesize of output 10226 [2024-11-08 18:05:20,547 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:20,618 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-11-08 18:05:20,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 6810 treesize of output 6329 [2024-11-08 18:05:20,739 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 6350 treesize of output 6294 [2024-11-08 18:05:20,875 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 6280 treesize of output 6200 [2024-11-08 18:05:21,140 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:21,160 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:21,199 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:21,210 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 951239 treesize of output 943047 [2024-11-08 18:05:23,422 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:23,423 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:23,927 INFO L349 Elim1Store]: treesize reduction 114, result has 37.7 percent of original size [2024-11-08 18:05:23,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 3587 treesize of output 2333 [2024-11-08 18:05:23,959 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:23,967 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:24,028 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-11-08 18:05:24,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 1089 treesize of output 994 [2024-11-08 18:05:24,056 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:24,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:05:24,113 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 933 treesize of output 917 [2024-11-08 18:05:24,138 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:24,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:05:24,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 559 treesize of output 555 [2024-11-08 18:05:24,304 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:24,304 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:24,323 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:24,349 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:24,396 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:05:24,396 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 379 treesize of output 371 [2024-11-08 18:05:25,284 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:25,285 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:25,512 INFO L349 Elim1Store]: treesize reduction 57, result has 41.2 percent of original size [2024-11-08 18:05:25,513 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 1794 treesize of output 1183 [2024-11-08 18:05:25,533 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:25,540 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:25,591 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-11-08 18:05:25,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 550 treesize of output 512 [2024-11-08 18:05:25,606 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:25,613 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 454 treesize of output 442 [2024-11-08 18:05:25,625 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:25,669 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:05:25,669 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 265 treesize of output 257 [2024-11-08 18:05:25,684 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:25,685 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:25,702 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:25,710 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 142 treesize of output 134 [2024-11-08 18:05:25,878 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:25,884 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:25,885 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:26,394 INFO L349 Elim1Store]: treesize reduction 152, result has 35.6 percent of original size [2024-11-08 18:05:26,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 152090 treesize of output 123558 [2024-11-08 18:05:32,889 WARN L286 SmtUtils]: Spent 6.49s on a formula simplification. DAG size of input: 486 DAG size of output: 300 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 18:05:33,931 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:33,940 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:34,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 18:05:34,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 54976 treesize of output 51937 [2024-11-08 18:05:35,470 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:35,472 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:35,491 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:35,493 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 51924 treesize of output 51464 [2024-11-08 18:05:39,496 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 18:05:39,505 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 52912 treesize of output 52528