./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 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_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/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_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/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_2e7214f4-d75c-4778-9938-2420dc74e532/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 f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 16:35:13,685 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 16:35:13,790 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-08 16:35:13,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 16:35:13,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 16:35:13,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 16:35:13,863 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 16:35:13,863 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 16:35:13,864 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 16:35:13,864 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 16:35:13,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 16:35:13,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 16:35:13,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 16:35:13,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 16:35:13,868 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 16:35:13,869 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 16:35:13,869 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 16:35:13,870 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 16:35:13,871 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 16:35:13,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 16:35:13,871 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-08 16:35:13,876 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-08 16:35:13,876 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-08 16:35:13,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 16:35:13,877 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 16:35:13,877 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 16:35:13,878 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-08 16:35:13,878 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 16:35:13,879 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 16:35:13,892 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 16:35:13,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 16:35:13,893 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 16:35:13,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 16:35:13,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:35:13,895 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 16:35:13,896 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 16:35:13,896 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 16:35:13,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 16:35:13,897 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 16:35:13,897 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 16:35:13,897 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 16:35:13,898 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 16:35:13,898 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_2e7214f4-d75c-4778-9938-2420dc74e532/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_2e7214f4-d75c-4778-9938-2420dc74e532/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 -> f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 [2024-11-08 16:35:14,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 16:35:14,238 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 16:35:14,241 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 16:35:14,243 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 16:35:14,244 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 16:35:14,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i Unable to find full path for "g++" [2024-11-08 16:35:16,565 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 16:35:16,898 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 16:35:16,902 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2024-11-08 16:35:16,918 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/data/40511adeb/185e75ac4e3d440ca3f5115a40c01eac/FLAG5ebcab584 [2024-11-08 16:35:16,941 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/data/40511adeb/185e75ac4e3d440ca3f5115a40c01eac [2024-11-08 16:35:16,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 16:35:16,948 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 16:35:16,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 16:35:16,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 16:35:16,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 16:35:16,959 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:35:16" (1/1) ... [2024-11-08 16:35:16,961 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c4f00e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:16, skipping insertion in model container [2024-11-08 16:35:16,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 04:35:16" (1/1) ... [2024-11-08 16:35:17,018 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 16:35:17,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:35:17,587 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 16:35:17,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 16:35:17,702 INFO L204 MainTranslator]: Completed translation [2024-11-08 16:35:17,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:17 WrapperNode [2024-11-08 16:35:17,703 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 16:35:17,704 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 16:35:17,704 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 16:35:17,705 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 16:35:17,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:17" (1/1) ... [2024-11-08 16:35:17,729 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:17" (1/1) ... [2024-11-08 16:35:17,757 INFO L138 Inliner]: procedures = 116, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 132 [2024-11-08 16:35:17,758 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 16:35:17,759 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 16:35:17,759 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 16:35:17,759 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 16:35:17,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:17" (1/1) ... [2024-11-08 16:35:17,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:17" (1/1) ... [2024-11-08 16:35:17,779 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:17" (1/1) ... [2024-11-08 16:35:17,801 INFO L175 MemorySlicer]: Split 8 memory accesses to 1 slices as follows [8]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 6 writes are split as follows [6]. [2024-11-08 16:35:17,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:17" (1/1) ... [2024-11-08 16:35:17,802 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:17" (1/1) ... [2024-11-08 16:35:17,813 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:17" (1/1) ... [2024-11-08 16:35:17,817 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:17" (1/1) ... [2024-11-08 16:35:17,819 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:17" (1/1) ... [2024-11-08 16:35:17,820 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:17" (1/1) ... [2024-11-08 16:35:17,823 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 16:35:17,824 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 16:35:17,825 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 16:35:17,825 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 16:35:17,826 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:17" (1/1) ... [2024-11-08 16:35:17,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 16:35:17,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:35:17,867 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 16:35:17,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 16:35:17,921 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-08 16:35:17,922 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-08 16:35:17,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 16:35:17,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 16:35:17,923 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 16:35:17,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 16:35:17,924 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 16:35:17,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 16:35:18,096 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 16:35:18,098 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 16:35:18,135 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-08 16:35:18,634 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-11-08 16:35:18,634 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 16:35:18,653 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 16:35:18,653 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 16:35:18,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:35:18 BoogieIcfgContainer [2024-11-08 16:35:18,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 16:35:18,658 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 16:35:18,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 16:35:18,662 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 16:35:18,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 04:35:16" (1/3) ... [2024-11-08 16:35:18,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f38c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:35:18, skipping insertion in model container [2024-11-08 16:35:18,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 04:35:17" (2/3) ... [2024-11-08 16:35:18,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f38c48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 04:35:18, skipping insertion in model container [2024-11-08 16:35:18,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 04:35:18" (3/3) ... [2024-11-08 16:35:18,669 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-1.i [2024-11-08 16:35:18,693 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 16:35:18,695 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2024-11-08 16:35:18,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 16:35:18,758 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;@2265f853, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 16:35:18,758 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2024-11-08 16:35:18,764 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 75 states have (on average 1.9466666666666668) internal successors, (146), 138 states have internal predecessors, (146), 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 16:35:18,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 16:35:18,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:35:18,776 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 16:35:18,777 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:35:18,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:18,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2024-11-08 16:35:18,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:18,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399222933] [2024-11-08 16:35:18,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:18,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:19,149 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 16:35:19,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:19,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399222933] [2024-11-08 16:35:19,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399222933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:19,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:19,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:35:19,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105787593] [2024-11-08 16:35:19,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:19,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:35:19,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:19,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:35:19,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:35:19,199 INFO L87 Difference]: Start difference. First operand has 140 states, 75 states have (on average 1.9466666666666668) internal successors, (146), 138 states have internal predecessors, (146), 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 16:35:19,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:35:19,396 INFO L93 Difference]: Finished difference Result 137 states and 145 transitions. [2024-11-08 16:35:19,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:35:19,399 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 16:35:19,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:35:19,410 INFO L225 Difference]: With dead ends: 137 [2024-11-08 16:35:19,410 INFO L226 Difference]: Without dead ends: 131 [2024-11-08 16:35:19,412 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 16:35:19,417 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 19 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:35:19,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 208 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:35:19,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-08 16:35:19,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-08 16:35:19,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 72 states have (on average 1.9027777777777777) internal successors, (137), 130 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:19,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 137 transitions. [2024-11-08 16:35:19,468 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 137 transitions. Word has length 4 [2024-11-08 16:35:19,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:35:19,469 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 137 transitions. [2024-11-08 16:35:19,469 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 16:35:19,470 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 137 transitions. [2024-11-08 16:35:19,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-08 16:35:19,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:35:19,471 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-08 16:35:19,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 16:35:19,471 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:35:19,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:19,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2024-11-08 16:35:19,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:19,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501804852] [2024-11-08 16:35:19,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:19,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:19,652 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 16:35:19,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:19,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501804852] [2024-11-08 16:35:19,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501804852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:19,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:19,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:35:19,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082551138] [2024-11-08 16:35:19,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:19,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:35:19,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:19,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:35:19,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:35:19,660 INFO L87 Difference]: Start difference. First operand 131 states and 137 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 16:35:19,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:35:19,756 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2024-11-08 16:35:19,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:35:19,763 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 16:35:19,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:35:19,767 INFO L225 Difference]: With dead ends: 128 [2024-11-08 16:35:19,767 INFO L226 Difference]: Without dead ends: 128 [2024-11-08 16:35:19,768 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 16:35:19,770 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 17 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:35:19,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 230 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:35:19,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-08 16:35:19,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-08 16:35:19,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 72 states have (on average 1.8611111111111112) internal successors, (134), 127 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:19,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2024-11-08 16:35:19,793 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 4 [2024-11-08 16:35:19,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:35:19,798 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2024-11-08 16:35:19,798 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 16:35:19,799 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2024-11-08 16:35:19,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-08 16:35:19,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:35:19,799 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:35:19,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 16:35:19,800 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:35:19,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:19,801 INFO L85 PathProgramCache]: Analyzing trace with hash 2065264490, now seen corresponding path program 1 times [2024-11-08 16:35:19,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:19,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116811258] [2024-11-08 16:35:19,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:19,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:19,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:19,943 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 16:35:19,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:19,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116811258] [2024-11-08 16:35:19,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116811258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:19,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:19,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 16:35:19,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575321408] [2024-11-08 16:35:19,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:19,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:35:19,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:19,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:35:19,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:35:19,948 INFO L87 Difference]: Start difference. First operand 128 states and 134 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:19,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:35:19,981 INFO L93 Difference]: Finished difference Result 138 states and 144 transitions. [2024-11-08 16:35:19,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:35:19,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-08 16:35:19,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:35:19,986 INFO L225 Difference]: With dead ends: 138 [2024-11-08 16:35:19,986 INFO L226 Difference]: Without dead ends: 138 [2024-11-08 16:35:19,987 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 16:35:19,993 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 9 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 254 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 16:35:19,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 254 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:35:19,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-08 16:35:20,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 130. [2024-11-08 16:35:20,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 74 states have (on average 1.837837837837838) internal successors, (136), 129 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:20,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2024-11-08 16:35:20,017 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 9 [2024-11-08 16:35:20,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:35:20,021 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2024-11-08 16:35:20,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:20,022 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2024-11-08 16:35:20,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 16:35:20,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:35:20,023 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:35:20,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 16:35:20,023 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:35:20,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:20,024 INFO L85 PathProgramCache]: Analyzing trace with hash -401953616, now seen corresponding path program 1 times [2024-11-08 16:35:20,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:20,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412135237] [2024-11-08 16:35:20,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:20,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:20,165 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 16:35:20,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:20,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412135237] [2024-11-08 16:35:20,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412135237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:20,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:20,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:35:20,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466229759] [2024-11-08 16:35:20,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:20,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:35:20,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:20,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:35:20,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:35:20,168 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand has 3 states, 2 states have (on average 5.0) 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 16:35:20,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:35:20,277 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2024-11-08 16:35:20,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:35:20,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) 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 16:35:20,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:35:20,279 INFO L225 Difference]: With dead ends: 129 [2024-11-08 16:35:20,279 INFO L226 Difference]: Without dead ends: 129 [2024-11-08 16:35:20,280 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 16:35:20,281 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 4 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:35:20,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 209 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:35:20,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-08 16:35:20,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-08 16:35:20,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 74 states have (on average 1.8243243243243243) internal successors, (135), 128 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:20,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2024-11-08 16:35:20,298 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 10 [2024-11-08 16:35:20,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:35:20,301 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2024-11-08 16:35:20,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) 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 16:35:20,302 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2024-11-08 16:35:20,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-08 16:35:20,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:35:20,302 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:35:20,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 16:35:20,303 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:35:20,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:20,304 INFO L85 PathProgramCache]: Analyzing trace with hash -401953615, now seen corresponding path program 1 times [2024-11-08 16:35:20,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:20,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442586522] [2024-11-08 16:35:20,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:20,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:20,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:20,457 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 16:35:20,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:20,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442586522] [2024-11-08 16:35:20,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442586522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:20,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:20,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 16:35:20,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558812629] [2024-11-08 16:35:20,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:20,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 16:35:20,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:20,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 16:35:20,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 16:35:20,463 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand has 3 states, 2 states have (on average 5.0) 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 16:35:20,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:35:20,510 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2024-11-08 16:35:20,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 16:35:20,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) 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 16:35:20,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:35:20,512 INFO L225 Difference]: With dead ends: 128 [2024-11-08 16:35:20,512 INFO L226 Difference]: Without dead ends: 128 [2024-11-08 16:35:20,512 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 16:35:20,513 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 4 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:35:20,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 241 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:35:20,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-08 16:35:20,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-08 16:35:20,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 74 states have (on average 1.8108108108108107) internal successors, (134), 127 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:20,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2024-11-08 16:35:20,522 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 10 [2024-11-08 16:35:20,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:35:20,522 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2024-11-08 16:35:20,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) 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 16:35:20,522 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2024-11-08 16:35:20,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 16:35:20,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:35:20,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:35:20,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 16:35:20,524 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:35:20,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:20,524 INFO L85 PathProgramCache]: Analyzing trace with hash 424339803, now seen corresponding path program 1 times [2024-11-08 16:35:20,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:20,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018830917] [2024-11-08 16:35:20,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:20,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:20,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:20,757 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 16:35:20,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:20,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018830917] [2024-11-08 16:35:20,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018830917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:20,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:20,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 16:35:20,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978463565] [2024-11-08 16:35:20,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:20,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:35:20,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:20,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:35:20,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:35:20,760 INFO L87 Difference]: Start difference. First operand 128 states and 134 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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 16:35:20,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:35:20,951 INFO L93 Difference]: Finished difference Result 131 states and 138 transitions. [2024-11-08 16:35:20,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:35:20,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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 16:35:20,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:35:20,956 INFO L225 Difference]: With dead ends: 131 [2024-11-08 16:35:20,957 INFO L226 Difference]: Without dead ends: 131 [2024-11-08 16:35:20,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 16:35:20,958 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 19 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:35:20,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 272 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:35:20,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-08 16:35:20,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-08 16:35:20,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 77 states have (on average 1.7922077922077921) internal successors, (138), 130 states have internal predecessors, (138), 0 states have call successors, (0), 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 16:35:20,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2024-11-08 16:35:20,976 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 11 [2024-11-08 16:35:20,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:35:20,976 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2024-11-08 16:35:20,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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 16:35:20,977 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2024-11-08 16:35:20,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 16:35:20,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:35:20,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:35:20,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 16:35:20,982 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:35:20,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:20,982 INFO L85 PathProgramCache]: Analyzing trace with hash 424339804, now seen corresponding path program 1 times [2024-11-08 16:35:20,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:20,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397504343] [2024-11-08 16:35:20,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:20,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:21,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:21,264 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 16:35:21,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:21,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397504343] [2024-11-08 16:35:21,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397504343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:21,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:21,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:35:21,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325259902] [2024-11-08 16:35:21,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:21,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:35:21,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:21,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:35:21,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:35:21,269 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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 16:35:21,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:35:21,433 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2024-11-08 16:35:21,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:35:21,434 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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 16:35:21,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:35:21,435 INFO L225 Difference]: With dead ends: 131 [2024-11-08 16:35:21,435 INFO L226 Difference]: Without dead ends: 131 [2024-11-08 16:35:21,436 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 16:35:21,437 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 20 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:35:21,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 412 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:35:21,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-08 16:35:21,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-08 16:35:21,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 77 states have (on average 1.7792207792207793) internal successors, (137), 130 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:21,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 137 transitions. [2024-11-08 16:35:21,450 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 137 transitions. Word has length 11 [2024-11-08 16:35:21,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:35:21,450 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 137 transitions. [2024-11-08 16:35:21,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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 16:35:21,451 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 137 transitions. [2024-11-08 16:35:21,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 16:35:21,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:35:21,451 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:35:21,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 16:35:21,455 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:35:21,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:21,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1018650464, now seen corresponding path program 1 times [2024-11-08 16:35:21,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:21,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261347838] [2024-11-08 16:35:21,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:21,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:21,547 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 16:35:21,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:21,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261347838] [2024-11-08 16:35:21,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261347838] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:35:21,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11982604] [2024-11-08 16:35:21,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:21,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:35:21,549 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:35:21,552 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:35:21,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 16:35:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:21,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 16:35:21,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:35:21,788 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 16:35:21,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:35:21,841 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 16:35:21,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11982604] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:35:21,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:35:21,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-08 16:35:21,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673862068] [2024-11-08 16:35:21,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:35:21,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:35:21,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:21,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:35:21,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:35:21,846 INFO L87 Difference]: Start difference. First operand 131 states and 137 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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 16:35:21,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:35:21,867 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2024-11-08 16:35:21,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 16:35:21,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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 15 [2024-11-08 16:35:21,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:35:21,869 INFO L225 Difference]: With dead ends: 133 [2024-11-08 16:35:21,869 INFO L226 Difference]: Without dead ends: 133 [2024-11-08 16:35:21,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:35:21,870 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 7 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:35:21,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 249 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 16:35:21,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-08 16:35:21,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-08 16:35:21,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 79 states have (on average 1.7468354430379747) internal successors, (138), 132 states have internal predecessors, (138), 0 states have call successors, (0), 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 16:35:21,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2024-11-08 16:35:21,883 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 15 [2024-11-08 16:35:21,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:35:21,884 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2024-11-08 16:35:21,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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 16:35:21,884 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2024-11-08 16:35:21,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 16:35:21,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:35:21,885 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:35:21,912 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 16:35:22,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:35:22,086 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:35:22,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:22,087 INFO L85 PathProgramCache]: Analyzing trace with hash -349391919, now seen corresponding path program 1 times [2024-11-08 16:35:22,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:22,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984318545] [2024-11-08 16:35:22,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:22,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:22,231 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:22,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:22,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984318545] [2024-11-08 16:35:22,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984318545] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:35:22,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1187049244] [2024-11-08 16:35:22,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:22,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:35:22,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:35:22,236 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:35:22,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 16:35:22,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:22,350 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 16:35:22,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:35:22,389 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 16:35:22,437 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-08 16:35:22,437 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 16:35:22,462 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:22,462 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:35:22,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:22,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1187049244] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:35:22,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:35:22,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-08 16:35:22,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429048590] [2024-11-08 16:35:22,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:35:22,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 16:35:22,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:22,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 16:35:22,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 16:35:22,510 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:22,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:35:22,687 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2024-11-08 16:35:22,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:35:22,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-08 16:35:22,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:35:22,689 INFO L225 Difference]: With dead ends: 131 [2024-11-08 16:35:22,689 INFO L226 Difference]: Without dead ends: 131 [2024-11-08 16:35:22,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:35:22,690 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 7 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:35:22,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 278 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:35:22,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-08 16:35:22,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-11-08 16:35:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 79 states have (on average 1.7215189873417722) internal successors, (136), 130 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:22,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2024-11-08 16:35:22,695 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 17 [2024-11-08 16:35:22,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:35:22,695 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2024-11-08 16:35:22,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:22,696 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2024-11-08 16:35:22,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-08 16:35:22,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:35:22,696 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:35:22,721 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 16:35:22,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:35:22,901 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:35:22,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:22,901 INFO L85 PathProgramCache]: Analyzing trace with hash -349391918, now seen corresponding path program 1 times [2024-11-08 16:35:22,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:22,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601796094] [2024-11-08 16:35:22,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:22,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:22,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:23,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:23,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:23,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601796094] [2024-11-08 16:35:23,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601796094] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:35:23,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700457095] [2024-11-08 16:35:23,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:23,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:35:23,091 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:35:23,093 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:35:23,094 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-08 16:35:23,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:23,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-08 16:35:23,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:35:23,218 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 16:35:23,297 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-08 16:35:23,297 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 16:35:23,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:23,329 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:35:23,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:23,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700457095] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:35:23,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:35:23,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 6 [2024-11-08 16:35:23,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267520842] [2024-11-08 16:35:23,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:35:23,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:35:23,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:23,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:35:23,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:35:23,539 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:23,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:35:23,655 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2024-11-08 16:35:23,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 16:35:23,656 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-08 16:35:23,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:35:23,656 INFO L225 Difference]: With dead ends: 129 [2024-11-08 16:35:23,657 INFO L226 Difference]: Without dead ends: 129 [2024-11-08 16:35:23,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 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 16:35:23,658 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 3 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:35:23,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 560 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:35:23,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-08 16:35:23,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2024-11-08 16:35:23,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 79 states have (on average 1.6962025316455696) internal successors, (134), 128 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:23,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2024-11-08 16:35:23,667 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 17 [2024-11-08 16:35:23,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:35:23,668 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2024-11-08 16:35:23,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:23,668 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2024-11-08 16:35:23,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 16:35:23,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:35:23,670 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:35:23,693 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-08 16:35:23,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-08 16:35:23,870 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:35:23,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:23,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1384782141, now seen corresponding path program 1 times [2024-11-08 16:35:23,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:23,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394507595] [2024-11-08 16:35:23,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:23,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:24,026 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-08 16:35:24,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:24,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394507595] [2024-11-08 16:35:24,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394507595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:24,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:24,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:35:24,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758280136] [2024-11-08 16:35:24,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:24,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:35:24,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:24,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:35:24,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:35:24,028 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 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 16:35:24,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:35:24,268 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2024-11-08 16:35:24,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:35:24,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-08 16:35:24,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:35:24,270 INFO L225 Difference]: With dead ends: 126 [2024-11-08 16:35:24,270 INFO L226 Difference]: Without dead ends: 126 [2024-11-08 16:35:24,270 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 16:35:24,271 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 25 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:35:24,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 382 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:35:24,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-08 16:35:24,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-08 16:35:24,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 79 states have (on average 1.6582278481012658) internal successors, (131), 125 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:24,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2024-11-08 16:35:24,276 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 24 [2024-11-08 16:35:24,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:35:24,276 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2024-11-08 16:35:24,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 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 16:35:24,277 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2024-11-08 16:35:24,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-08 16:35:24,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:35:24,278 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:35:24,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 16:35:24,278 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:35:24,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:24,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1384782140, now seen corresponding path program 1 times [2024-11-08 16:35:24,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:24,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879744257] [2024-11-08 16:35:24,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:24,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:24,523 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 16:35:24,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:24,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879744257] [2024-11-08 16:35:24,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879744257] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:24,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:24,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 16:35:24,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137781756] [2024-11-08 16:35:24,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:24,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 16:35:24,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:24,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 16:35:24,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 16:35:24,526 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:24,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:35:24,686 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2024-11-08 16:35:24,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 16:35:24,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-08 16:35:24,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:35:24,688 INFO L225 Difference]: With dead ends: 119 [2024-11-08 16:35:24,688 INFO L226 Difference]: Without dead ends: 119 [2024-11-08 16:35:24,688 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 16:35:24,689 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 40 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:35:24,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 450 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 16:35:24,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-08 16:35:24,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-08 16:35:24,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 79 states have (on average 1.5696202531645569) internal successors, (124), 118 states have internal predecessors, (124), 0 states have call successors, (0), 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 16:35:24,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2024-11-08 16:35:24,694 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 24 [2024-11-08 16:35:24,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:35:24,695 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2024-11-08 16:35:24,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:24,695 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2024-11-08 16:35:24,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 16:35:24,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:35:24,696 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:35:24,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 16:35:24,696 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:35:24,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:24,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1531365415, now seen corresponding path program 1 times [2024-11-08 16:35:24,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:24,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999207969] [2024-11-08 16:35:24,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:24,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:24,916 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 16:35:24,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:24,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999207969] [2024-11-08 16:35:24,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999207969] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:24,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:24,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 16:35:24,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047122162] [2024-11-08 16:35:24,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:24,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 16:35:24,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:24,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 16:35:24,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 16:35:24,918 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 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 16:35:25,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:35:25,127 INFO L93 Difference]: Finished difference Result 114 states and 119 transitions. [2024-11-08 16:35:25,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 16:35:25,128 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 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 30 [2024-11-08 16:35:25,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:35:25,128 INFO L225 Difference]: With dead ends: 114 [2024-11-08 16:35:25,128 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 16:35:25,129 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 16:35:25,129 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 44 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:35:25,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 310 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:35:25,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 16:35:25,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-08 16:35:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 79 states have (on average 1.5063291139240507) internal successors, (119), 113 states have internal predecessors, (119), 0 states have call successors, (0), 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 16:35:25,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2024-11-08 16:35:25,133 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 30 [2024-11-08 16:35:25,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:35:25,133 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2024-11-08 16:35:25,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 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 16:35:25,134 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2024-11-08 16:35:25,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 16:35:25,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:35:25,135 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:35:25,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 16:35:25,135 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:35:25,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:25,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1531404397, now seen corresponding path program 1 times [2024-11-08 16:35:25,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:25,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390228345] [2024-11-08 16:35:25,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:25,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:25,645 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 16:35:25,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:25,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390228345] [2024-11-08 16:35:25,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390228345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:25,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:25,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:35:25,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091462858] [2024-11-08 16:35:25,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:25,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:35:25,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:25,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:35:25,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:35:25,649 INFO L87 Difference]: Start difference. First operand 114 states and 119 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 16:35:25,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:35:25,902 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2024-11-08 16:35:25,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 16:35:25,903 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 30 [2024-11-08 16:35:25,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:35:25,904 INFO L225 Difference]: With dead ends: 109 [2024-11-08 16:35:25,904 INFO L226 Difference]: Without dead ends: 109 [2024-11-08 16:35:25,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:35:25,905 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 77 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:35:25,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 589 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 16:35:25,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-08 16:35:25,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-08 16:35:25,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 108 states have internal predecessors, (114), 0 states have call successors, (0), 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 16:35:25,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2024-11-08 16:35:25,911 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 30 [2024-11-08 16:35:25,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:35:25,911 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2024-11-08 16:35:25,912 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 16:35:25,912 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2024-11-08 16:35:25,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 16:35:25,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:35:25,913 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:35:25,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 16:35:25,914 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:35:25,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:25,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1531403181, now seen corresponding path program 1 times [2024-11-08 16:35:25,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:25,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283734003] [2024-11-08 16:35:25,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:25,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:26,742 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:26,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:26,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283734003] [2024-11-08 16:35:26,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283734003] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:35:26,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205513389] [2024-11-08 16:35:26,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:26,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:35:26,743 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:35:26,745 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:35:26,747 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-08 16:35:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:26,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-08 16:35:26,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:35:26,907 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 16:35:27,079 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-08 16:35:27,079 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 16:35:27,148 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 16:35:27,195 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 16:35:27,252 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 16:35:27,269 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 16:35:27,306 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:27,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:35:27,340 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_463) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0)) is different from false [2024-11-08 16:35:27,357 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_463 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_463) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0)) is different from false [2024-11-08 16:35:27,367 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_463 (Array Int Int)) (v_ArrVal_462 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_462) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_463) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0)) is different from false [2024-11-08 16:35:27,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:35:27,382 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 16:35:27,388 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 16:35:27,401 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 16:35:27,414 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 16:35:27,712 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-08 16:35:27,712 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 25 treesize of output 24 [2024-11-08 16:35:27,721 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-08 16:35:27,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205513389] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:35:27,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:35:27,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 28 [2024-11-08 16:35:27,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415495471] [2024-11-08 16:35:27,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:35:27,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-08 16:35:27,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:27,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-08 16:35:27,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=574, Unknown=3, NotChecked=150, Total=812 [2024-11-08 16:35:27,725 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand has 29 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 29 states have internal predecessors, (58), 0 states have call successors, (0), 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 16:35:28,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:35:28,776 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2024-11-08 16:35:28,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 16:35:28,777 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 29 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-08 16:35:28,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:35:28,778 INFO L225 Difference]: With dead ends: 108 [2024-11-08 16:35:28,778 INFO L226 Difference]: Without dead ends: 108 [2024-11-08 16:35:28,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=194, Invalid=1075, Unknown=3, NotChecked=210, Total=1482 [2024-11-08 16:35:28,780 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 81 mSDsluCounter, 1149 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 231 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 16:35:28,780 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1227 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 748 Invalid, 0 Unknown, 231 Unchecked, 0.7s Time] [2024-11-08 16:35:28,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-08 16:35:28,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 104. [2024-11-08 16:35:28,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 79 states have (on average 1.379746835443038) internal successors, (109), 103 states have internal predecessors, (109), 0 states have call successors, (0), 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 16:35:28,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2024-11-08 16:35:28,784 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 30 [2024-11-08 16:35:28,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:35:28,784 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2024-11-08 16:35:28,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 29 states have internal predecessors, (58), 0 states have call successors, (0), 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 16:35:28,785 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2024-11-08 16:35:28,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 16:35:28,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:35:28,786 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:35:28,810 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-08 16:35:28,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-08 16:35:28,991 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:35:28,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:28,992 INFO L85 PathProgramCache]: Analyzing trace with hash 228896231, now seen corresponding path program 1 times [2024-11-08 16:35:28,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:28,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594352532] [2024-11-08 16:35:28,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:28,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:29,558 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 16:35:29,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:29,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594352532] [2024-11-08 16:35:29,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594352532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:29,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:29,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 16:35:29,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327979667] [2024-11-08 16:35:29,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:29,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 16:35:29,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:29,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 16:35:29,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-08 16:35:29,561 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 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 16:35:30,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:35:30,006 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2024-11-08 16:35:30,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 16:35:30,007 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 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 31 [2024-11-08 16:35:30,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:35:30,008 INFO L225 Difference]: With dead ends: 99 [2024-11-08 16:35:30,008 INFO L226 Difference]: Without dead ends: 99 [2024-11-08 16:35:30,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-08 16:35:30,009 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 71 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 16:35:30,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 380 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 16:35:30,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-08 16:35:30,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-08 16:35:30,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 98 states have internal predecessors, (104), 0 states have call successors, (0), 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 16:35:30,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2024-11-08 16:35:30,013 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 31 [2024-11-08 16:35:30,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:35:30,014 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2024-11-08 16:35:30,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 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 16:35:30,014 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2024-11-08 16:35:30,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 16:35:30,015 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:35:30,015 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:35:30,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 16:35:30,016 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:35:30,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:30,016 INFO L85 PathProgramCache]: Analyzing trace with hash 228858497, now seen corresponding path program 1 times [2024-11-08 16:35:30,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:30,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943077503] [2024-11-08 16:35:30,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:30,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:30,781 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:30,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:30,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943077503] [2024-11-08 16:35:30,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943077503] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:35:30,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802100167] [2024-11-08 16:35:30,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:30,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:35:30,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:35:30,785 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:35:30,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-08 16:35:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:30,941 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-08 16:35:30,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:35:30,952 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 16:35:31,041 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-08 16:35:31,041 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 16:35:31,160 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-08 16:35:31,160 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 16:35:31,218 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 16:35:31,284 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 16:35:31,461 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 35 [2024-11-08 16:35:31,496 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 55 treesize of output 31 [2024-11-08 16:35:31,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:35:31,871 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 53 treesize of output 31 [2024-11-08 16:35:31,890 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:31,890 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:35:32,048 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_585 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_585) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2024-11-08 16:35:36,154 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_584 (Array Int Int)) (v_ArrVal_585 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_584) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_585) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2024-11-08 16:35:36,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:35:36,173 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 16:35:36,180 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 121 treesize of output 109 [2024-11-08 16:35:36,190 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 27 treesize of output 25 [2024-11-08 16:35:36,223 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 24 treesize of output 20 [2024-11-08 16:35:36,655 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-08 16:35:36,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802100167] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:35:36,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:35:36,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 33 [2024-11-08 16:35:36,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272229059] [2024-11-08 16:35:36,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:35:36,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-08 16:35:36,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:36,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-08 16:35:36,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=879, Unknown=10, NotChecked=122, Total=1122 [2024-11-08 16:35:36,658 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:38,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:35:38,347 INFO L93 Difference]: Finished difference Result 98 states and 103 transitions. [2024-11-08 16:35:38,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-08 16:35:38,347 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-08 16:35:38,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:35:38,348 INFO L225 Difference]: With dead ends: 98 [2024-11-08 16:35:38,348 INFO L226 Difference]: Without dead ends: 98 [2024-11-08 16:35:38,349 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 38 SyntacticMatches, 7 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=209, Invalid=1349, Unknown=10, NotChecked=154, Total=1722 [2024-11-08 16:35:38,350 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 104 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 1148 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:35:38,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 805 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1148 Invalid, 0 Unknown, 174 Unchecked, 1.1s Time] [2024-11-08 16:35:38,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-08 16:35:38,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2024-11-08 16:35:38,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.2531645569620253) internal successors, (99), 93 states have internal predecessors, (99), 0 states have call successors, (0), 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 16:35:38,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2024-11-08 16:35:38,354 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 31 [2024-11-08 16:35:38,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:35:38,355 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2024-11-08 16:35:38,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:38,355 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2024-11-08 16:35:38,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 16:35:38,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:35:38,356 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:35:38,380 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-08 16:35:38,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-08 16:35:38,561 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:35:38,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:38,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1494151249, now seen corresponding path program 1 times [2024-11-08 16:35:38,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:38,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412642899] [2024-11-08 16:35:38,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:38,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:39,048 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 16:35:39,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:39,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412642899] [2024-11-08 16:35:39,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412642899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:35:39,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 16:35:39,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 16:35:39,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890974058] [2024-11-08 16:35:39,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:35:39,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 16:35:39,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:39,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 16:35:39,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-08 16:35:39,051 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 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 16:35:39,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:35:39,412 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2024-11-08 16:35:39,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-08 16:35:39,413 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 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 32 [2024-11-08 16:35:39,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:35:39,414 INFO L225 Difference]: With dead ends: 93 [2024-11-08 16:35:39,414 INFO L226 Difference]: Without dead ends: 93 [2024-11-08 16:35:39,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-08 16:35:39,418 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 30 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:35:39,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 470 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 16:35:39,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-08 16:35:39,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-08 16:35:39,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 79 states have (on average 1.240506329113924) internal successors, (98), 92 states have internal predecessors, (98), 0 states have call successors, (0), 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 16:35:39,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2024-11-08 16:35:39,422 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 32 [2024-11-08 16:35:39,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:35:39,422 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2024-11-08 16:35:39,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 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 16:35:39,423 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2024-11-08 16:35:39,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 16:35:39,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:35:39,427 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:35:39,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-08 16:35:39,428 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:35:39,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:39,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1495321041, now seen corresponding path program 1 times [2024-11-08 16:35:39,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:39,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605241775] [2024-11-08 16:35:39,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:39,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:40,107 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:40,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:40,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605241775] [2024-11-08 16:35:40,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605241775] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:35:40,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196374378] [2024-11-08 16:35:40,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:40,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:35:40,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:35:40,110 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:35:40,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-08 16:35:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:40,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-08 16:35:40,273 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:35:40,277 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 16:35:40,326 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-08 16:35:40,327 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 16:35:40,442 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-08 16:35:40,443 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 16:35:40,484 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 16:35:40,562 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 16:35:40,563 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 34 treesize of output 33 [2024-11-08 16:35:40,732 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 26 treesize of output 19 [2024-11-08 16:35:40,752 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 37 treesize of output 17 [2024-11-08 16:35:40,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:35:40,936 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 35 treesize of output 17 [2024-11-08 16:35:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:40,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:35:41,005 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_706 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_706) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1)) is different from false [2024-11-08 16:35:41,020 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_706 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_706) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1)) is different from false [2024-11-08 16:35:41,038 INFO L349 Elim1Store]: treesize reduction 5, result has 72.2 percent of original size [2024-11-08 16:35:41,039 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 22 treesize of output 21 [2024-11-08 16:35:45,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:35:45,139 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 16:35:45,144 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 16:35:45,154 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 24 treesize of output 20 [2024-11-08 16:35:45,169 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 16:35:45,236 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-08 16:35:45,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196374378] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:35:45,236 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:35:45,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 28 [2024-11-08 16:35:45,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344112081] [2024-11-08 16:35:45,236 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:35:45,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-08 16:35:45,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:45,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-08 16:35:45,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=619, Unknown=13, NotChecked=102, Total=812 [2024-11-08 16:35:45,239 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 29 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 29 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 16:35:46,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:35:46,185 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2024-11-08 16:35:46,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 16:35:46,186 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 29 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) Word has length 32 [2024-11-08 16:35:46,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:35:46,187 INFO L225 Difference]: With dead ends: 92 [2024-11-08 16:35:46,187 INFO L226 Difference]: Without dead ends: 92 [2024-11-08 16:35:46,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=180, Invalid=1075, Unknown=13, NotChecked=138, Total=1406 [2024-11-08 16:35:46,188 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 25 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:35:46,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 950 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 815 Invalid, 0 Unknown, 124 Unchecked, 0.6s Time] [2024-11-08 16:35:46,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-08 16:35:46,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-08 16:35:46,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 91 states have internal predecessors, (97), 0 states have call successors, (0), 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 16:35:46,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2024-11-08 16:35:46,196 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 32 [2024-11-08 16:35:46,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:35:46,196 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2024-11-08 16:35:46,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.5357142857142856) internal successors, (71), 29 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 16:35:46,197 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2024-11-08 16:35:46,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 16:35:46,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:35:46,198 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:35:46,224 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-08 16:35:46,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:35:46,399 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:35:46,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:46,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1378292516, now seen corresponding path program 1 times [2024-11-08 16:35:46,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:46,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774631451] [2024-11-08 16:35:46,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:46,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:47,106 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:47,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:47,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774631451] [2024-11-08 16:35:47,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774631451] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:35:47,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470109112] [2024-11-08 16:35:47,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:47,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:35:47,108 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:35:47,109 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:35:47,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 16:35:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:47,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-08 16:35:47,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:35:47,353 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 16:35:47,354 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 16:35:47,474 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 15 treesize of output 1 [2024-11-08 16:35:47,583 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:35:47,584 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 27 treesize of output 21 [2024-11-08 16:35:47,891 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-08 16:35:47,891 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 18 treesize of output 13 [2024-11-08 16:35:47,901 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:47,901 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:35:48,151 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 13 treesize of output 11 [2024-11-08 16:35:48,154 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 18 [2024-11-08 16:35:48,168 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 16:35:48,241 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-08 16:35:48,241 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 13 treesize of output 12 [2024-11-08 16:35:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:48,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470109112] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:35:48,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:35:48,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 28 [2024-11-08 16:35:48,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674438087] [2024-11-08 16:35:48,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:35:48,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-08 16:35:48,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:48,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-08 16:35:48,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2024-11-08 16:35:48,255 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand has 29 states, 28 states have (on average 2.607142857142857) internal successors, (73), 29 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:49,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:35:49,028 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2024-11-08 16:35:49,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-08 16:35:49,029 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.607142857142857) internal successors, (73), 29 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-08 16:35:49,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:35:49,029 INFO L225 Difference]: With dead ends: 91 [2024-11-08 16:35:49,029 INFO L226 Difference]: Without dead ends: 91 [2024-11-08 16:35:49,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=153, Invalid=1037, Unknown=0, NotChecked=0, Total=1190 [2024-11-08 16:35:49,030 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 66 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-08 16:35:49,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 628 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-08 16:35:49,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-08 16:35:49,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-08 16:35:49,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.2151898734177216) internal successors, (96), 90 states have internal predecessors, (96), 0 states have call successors, (0), 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 16:35:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2024-11-08 16:35:49,034 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 35 [2024-11-08 16:35:49,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:35:49,034 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2024-11-08 16:35:49,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.607142857142857) internal successors, (73), 29 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:49,035 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2024-11-08 16:35:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-08 16:35:49,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:35:49,035 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:35:49,058 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-08 16:35:49,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:35:49,240 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:35:49,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:49,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1377861540, now seen corresponding path program 1 times [2024-11-08 16:35:49,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:49,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070833389] [2024-11-08 16:35:49,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:49,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:49,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:50,013 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:50,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:50,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070833389] [2024-11-08 16:35:50,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070833389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:35:50,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998365662] [2024-11-08 16:35:50,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:50,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:35:50,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:35:50,017 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:35:50,018 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-08 16:35:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:50,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-08 16:35:50,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:35:50,202 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 16:35:50,330 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-08 16:35:50,330 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 16:35:50,354 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 16:35:50,382 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 16:35:50,383 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 34 treesize of output 33 [2024-11-08 16:35:50,480 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 26 treesize of output 19 [2024-11-08 16:35:50,504 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 33 treesize of output 17 [2024-11-08 16:35:50,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:35:50,677 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 33 treesize of output 33 [2024-11-08 16:35:50,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-08 16:35:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:50,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:35:51,370 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_873 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_873) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_873 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_873) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)) 1)))) is different from false [2024-11-08 16:35:51,397 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_873 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_873) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)) 1)) (forall ((v_ArrVal_873 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_873) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2024-11-08 16:35:51,417 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:35:51,417 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 47 treesize of output 51 [2024-11-08 16:35:51,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:35:51,575 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 27 treesize of output 28 [2024-11-08 16:35:51,578 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 85 treesize of output 81 [2024-11-08 16:35:51,585 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 100 treesize of output 96 [2024-11-08 16:35:51,597 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:35:51,597 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 94 treesize of output 98 [2024-11-08 16:35:51,607 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 83 [2024-11-08 16:35:51,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:35:51,666 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 26 treesize of output 27 [2024-11-08 16:35:51,671 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:35:51,674 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 40 treesize of output 36 [2024-11-08 16:35:51,690 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-08 16:35:51,690 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 34 treesize of output 33 [2024-11-08 16:35:51,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:35:51,941 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-08 16:35:51,941 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 25 treesize of output 24 [2024-11-08 16:35:51,948 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-08 16:35:51,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998365662] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:35:51,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:35:51,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 17] total 36 [2024-11-08 16:35:51,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367897240] [2024-11-08 16:35:51,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:35:51,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-08 16:35:51,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:51,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-08 16:35:51,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1082, Unknown=15, NotChecked=134, Total=1332 [2024-11-08 16:35:51,952 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 37 states, 36 states have (on average 2.138888888888889) internal successors, (77), 37 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:53,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:35:53,575 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2024-11-08 16:35:53,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 16:35:53,575 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.138888888888889) internal successors, (77), 37 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-08 16:35:53,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:35:53,576 INFO L225 Difference]: With dead ends: 90 [2024-11-08 16:35:53,576 INFO L226 Difference]: Without dead ends: 90 [2024-11-08 16:35:53,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=230, Invalid=2018, Unknown=16, NotChecked=186, Total=2450 [2024-11-08 16:35:53,578 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 67 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-08 16:35:53,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 911 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1042 Invalid, 0 Unknown, 132 Unchecked, 0.9s Time] [2024-11-08 16:35:53,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-08 16:35:53,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-08 16:35:53,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 79 states have (on average 1.2025316455696202) internal successors, (95), 89 states have internal predecessors, (95), 0 states have call successors, (0), 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 16:35:53,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2024-11-08 16:35:53,581 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 35 [2024-11-08 16:35:53,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:35:53,581 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2024-11-08 16:35:53,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.138888888888889) internal successors, (77), 37 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:35:53,582 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2024-11-08 16:35:53,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 16:35:53,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:35:53,582 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:35:53,603 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-08 16:35:53,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-08 16:35:53,787 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:35:53,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:53,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1546575373, now seen corresponding path program 1 times [2024-11-08 16:35:53,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:53,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844618564] [2024-11-08 16:35:53,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:53,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:55,037 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:55,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:35:55,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844618564] [2024-11-08 16:35:55,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844618564] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:35:55,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735723250] [2024-11-08 16:35:55,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:55,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:35:55,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:35:55,041 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:35:55,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 16:35:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:35:55,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-08 16:35:55,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:35:55,203 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 16:35:55,287 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 16:35:55,287 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 16:35:55,465 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-08 16:35:55,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-08 16:35:55,541 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 16:35:55,616 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 16:35:55,616 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 16:35:55,744 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 34 treesize of output 25 [2024-11-08 16:35:55,766 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 51 treesize of output 27 [2024-11-08 16:35:56,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:35:56,099 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 58 treesize of output 24 [2024-11-08 16:35:56,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-08 16:35:56,143 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:35:56,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:35:56,595 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_960 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_960) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_960 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_960) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1))) is different from false [2024-11-08 16:35:56,621 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_960 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_960) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_ArrVal_960 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_960) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1))) is different from false [2024-11-08 16:35:56,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:35:56,644 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 37 treesize of output 41 [2024-11-08 16:35:56,672 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_959 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_959) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_960) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_3) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2024-11-08 16:35:56,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:35:56,683 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 16:35:56,686 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 60 treesize of output 52 [2024-11-08 16:35:56,691 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 24 treesize of output 22 [2024-11-08 16:35:56,694 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 38 treesize of output 34 [2024-11-08 16:35:56,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:35:56,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2024-11-08 16:35:56,722 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:35:56,722 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:35:56,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 9 [2024-11-08 16:35:57,262 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-08 16:35:57,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735723250] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:35:57,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:35:57,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 19] total 48 [2024-11-08 16:35:57,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904008370] [2024-11-08 16:35:57,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:35:57,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-08 16:35:57,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:35:57,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-08 16:35:57,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1917, Unknown=3, NotChecked=270, Total=2352 [2024-11-08 16:35:57,266 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 49 states, 48 states have (on average 1.7708333333333333) internal successors, (85), 49 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 16:35:59,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:35:59,302 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2024-11-08 16:35:59,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 16:35:59,304 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 1.7708333333333333) internal successors, (85), 49 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) Word has length 36 [2024-11-08 16:35:59,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:35:59,305 INFO L225 Difference]: With dead ends: 93 [2024-11-08 16:35:59,305 INFO L226 Difference]: Without dead ends: 93 [2024-11-08 16:35:59,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 795 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=406, Invalid=3763, Unknown=3, NotChecked=384, Total=4556 [2024-11-08 16:35:59,308 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 91 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:35:59,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1109 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1368 Invalid, 0 Unknown, 193 Unchecked, 1.0s Time] [2024-11-08 16:35:59,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-08 16:35:59,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2024-11-08 16:35:59,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 88 states have internal predecessors, (94), 0 states have call successors, (0), 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 16:35:59,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2024-11-08 16:35:59,311 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 36 [2024-11-08 16:35:59,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:35:59,311 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2024-11-08 16:35:59,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 1.7708333333333333) internal successors, (85), 49 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 16:35:59,312 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2024-11-08 16:35:59,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 16:35:59,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:35:59,312 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:35:59,333 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 16:35:59,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:35:59,513 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:35:59,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:35:59,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1547006349, now seen corresponding path program 1 times [2024-11-08 16:35:59,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:35:59,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538659928] [2024-11-08 16:35:59,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:35:59,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:35:59,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:00,206 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:00,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:36:00,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538659928] [2024-11-08 16:36:00,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538659928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:36:00,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500375445] [2024-11-08 16:36:00,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:00,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:00,208 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:36:00,210 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:36:00,212 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-08 16:36:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:00,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-08 16:36:00,376 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:36:00,381 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 16:36:00,438 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-08 16:36:00,439 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 19 treesize of output 16 [2024-11-08 16:36:00,476 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-08 16:36:00,477 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 19 treesize of output 16 [2024-11-08 16:36:00,582 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 15 treesize of output 1 [2024-11-08 16:36:00,704 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:36:00,704 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 27 treesize of output 21 [2024-11-08 16:36:01,114 INFO L349 Elim1Store]: treesize reduction 28, result has 55.6 percent of original size [2024-11-08 16:36:01,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 64 [2024-11-08 16:36:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-08 16:36:01,360 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 16:36:01,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500375445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 16:36:01,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 16:36:01,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 24 [2024-11-08 16:36:01,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540451815] [2024-11-08 16:36:01,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 16:36:01,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-08 16:36:01,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:36:01,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-08 16:36:01,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=533, Unknown=0, NotChecked=0, Total=600 [2024-11-08 16:36:01,363 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 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 16:36:01,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:36:01,976 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2024-11-08 16:36:01,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 16:36:01,977 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-08 16:36:01,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:36:01,977 INFO L225 Difference]: With dead ends: 88 [2024-11-08 16:36:01,977 INFO L226 Difference]: Without dead ends: 88 [2024-11-08 16:36:01,978 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2024-11-08 16:36:01,978 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 25 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 16:36:01,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 350 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 16:36:01,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-08 16:36:01,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-08 16:36:01,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 87 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:36:01,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2024-11-08 16:36:01,981 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 36 [2024-11-08 16:36:01,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:36:01,982 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2024-11-08 16:36:01,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 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 16:36:01,982 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2024-11-08 16:36:01,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 16:36:01,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:36:01,983 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:36:02,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-08 16:36:02,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:02,188 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:36:02,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:02,188 INFO L85 PathProgramCache]: Analyzing trace with hash 456535795, now seen corresponding path program 1 times [2024-11-08 16:36:02,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:36:02,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051528408] [2024-11-08 16:36:02,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:02,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:36:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:03,190 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:03,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:36:03,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051528408] [2024-11-08 16:36:03,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051528408] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:36:03,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885965867] [2024-11-08 16:36:03,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:03,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:03,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:36:03,193 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:36:03,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-08 16:36:03,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:03,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-08 16:36:03,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:36:03,365 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 16:36:03,412 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 16:36:03,413 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 16:36:03,540 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-08 16:36:03,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-08 16:36:03,584 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 16:36:03,635 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 16:36:03,635 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 33 treesize of output 32 [2024-11-08 16:36:03,726 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 25 treesize of output 18 [2024-11-08 16:36:03,794 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 42 treesize of output 22 [2024-11-08 16:36:04,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:36:04,085 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 60 treesize of output 24 [2024-11-08 16:36:04,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-08 16:36:04,117 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:04,118 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:36:04,438 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 16:36:04,443 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1130 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1130) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2024-11-08 16:36:04,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:36:04,599 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 22 treesize of output 23 [2024-11-08 16:36:04,602 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 65 treesize of output 57 [2024-11-08 16:36:04,612 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 16:36:04,622 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 16:36:04,625 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 16:36:04,957 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-08 16:36:04,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885965867] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:36:04,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:36:04,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 46 [2024-11-08 16:36:04,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500422969] [2024-11-08 16:36:04,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:36:04,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-08 16:36:04,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:36:04,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-08 16:36:04,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1883, Unknown=25, NotChecked=88, Total=2162 [2024-11-08 16:36:04,960 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 47 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 47 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 16:36:06,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:36:06,390 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2024-11-08 16:36:06,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 16:36:06,391 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 47 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) Word has length 36 [2024-11-08 16:36:06,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:36:06,391 INFO L225 Difference]: With dead ends: 91 [2024-11-08 16:36:06,391 INFO L226 Difference]: Without dead ends: 91 [2024-11-08 16:36:06,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=349, Invalid=3169, Unknown=26, NotChecked=116, Total=3660 [2024-11-08 16:36:06,392 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 93 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 1224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:36:06,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 1145 Invalid, 1224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1152 Invalid, 0 Unknown, 51 Unchecked, 0.8s Time] [2024-11-08 16:36:06,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-08 16:36:06,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2024-11-08 16:36:06,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 79 states have (on average 1.1645569620253164) internal successors, (92), 86 states have internal predecessors, (92), 0 states have call successors, (0), 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 16:36:06,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-11-08 16:36:06,395 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 36 [2024-11-08 16:36:06,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:36:06,396 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-11-08 16:36:06,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 1.8478260869565217) internal successors, (85), 47 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 16:36:06,396 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-11-08 16:36:06,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-08 16:36:06,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:36:06,397 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:36:06,419 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-08 16:36:06,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:06,601 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:36:06,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:36:06,602 INFO L85 PathProgramCache]: Analyzing trace with hash 456104819, now seen corresponding path program 1 times [2024-11-08 16:36:06,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:36:06,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209576402] [2024-11-08 16:36:06,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:06,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:36:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:07,150 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:07,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:36:07,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209576402] [2024-11-08 16:36:07,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209576402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:36:07,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947569889] [2024-11-08 16:36:07,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:36:07,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:36:07,151 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:36:07,153 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:36:07,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-08 16:36:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:36:07,314 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-08 16:36:07,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:36:07,327 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 16:36:07,368 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-08 16:36:07,369 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 16:36:07,428 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-08 16:36:07,428 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 16:36:07,474 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 16:36:07,519 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 16:36:07,520 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 25 treesize of output 26 [2024-11-08 16:36:07,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-08 16:36:07,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:36:07,613 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 28 treesize of output 12 [2024-11-08 16:36:07,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:36:07,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:36:07,839 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 26 treesize of output 30 [2024-11-08 16:36:08,013 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 16:36:08,014 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 16:36:08,064 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:08,064 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:36:16,278 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 32 treesize of output 28 [2024-11-08 16:36:16,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:36:16,698 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 27 treesize of output 28 [2024-11-08 16:36:16,702 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 85 treesize of output 81 [2024-11-08 16:36:16,713 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:36: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 94 treesize of output 98 [2024-11-08 16:36:16,732 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 83 [2024-11-08 16:36:16,746 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 96 treesize of output 92 [2024-11-08 16:36:17,020 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:36:17,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947569889] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:36:17,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:36:17,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 41 [2024-11-08 16:36:17,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191226746] [2024-11-08 16:36:17,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:36:17,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-08 16:36:17,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:36:17,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-08 16:36:17,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1555, Unknown=27, NotChecked=0, Total=1722 [2024-11-08 16:36:17,023 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 42 states, 41 states have (on average 2.4146341463414633) internal successors, (99), 42 states have internal predecessors, (99), 0 states have call successors, (0), 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 16:36:25,406 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 [0] [2024-11-08 16:36:29,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:36:37,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:36:41,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:36:49,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:36:53,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:36:57,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:37:01,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 16:37:14,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:37:14,719 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2024-11-08 16:37:14,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-08 16:37:14,720 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.4146341463414633) internal successors, (99), 42 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-08 16:37:14,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:37:14,720 INFO L225 Difference]: With dead ends: 86 [2024-11-08 16:37:14,721 INFO L226 Difference]: Without dead ends: 86 [2024-11-08 16:37:14,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 33.9s TimeCoverageRelationStatistics Valid=316, Invalid=2730, Unknown=34, NotChecked=0, Total=3080 [2024-11-08 16:37:14,722 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 87 mSDsluCounter, 1083 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 18 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:37:14,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 1134 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1170 Invalid, 8 Unknown, 0 Unchecked, 33.0s Time] [2024-11-08 16:37:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-08 16:37:14,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-11-08 16:37:14,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 79 states have (on average 1.1518987341772151) internal successors, (91), 85 states have internal predecessors, (91), 0 states have call successors, (0), 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 16:37:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2024-11-08 16:37:14,724 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 36 [2024-11-08 16:37:14,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:37:14,724 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2024-11-08 16:37:14,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.4146341463414633) internal successors, (99), 42 states have internal predecessors, (99), 0 states have call successors, (0), 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 16:37:14,725 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2024-11-08 16:37:14,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 16:37:14,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:37:14,725 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:37:14,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-08 16:37:14,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:37:14,926 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:37:14,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:14,927 INFO L85 PathProgramCache]: Analyzing trace with hash 825121566, now seen corresponding path program 1 times [2024-11-08 16:37:14,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:37:14,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499286068] [2024-11-08 16:37:14,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:14,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:37:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:16,013 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:16,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:37:16,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499286068] [2024-11-08 16:37:16,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499286068] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:37:16,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796049788] [2024-11-08 16:37:16,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:16,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:37:16,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:37:16,016 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:37:16,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-08 16:37:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:16,197 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-08 16:37:16,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:37:16,203 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 16:37:16,250 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 16:37:16,251 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 16:37:16,358 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-08 16:37:16,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-08 16:37:16,415 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 16:37:16,491 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 16:37:16,491 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 16:37:16,629 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 34 treesize of output 25 [2024-11-08 16:37:16,650 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 45 treesize of output 25 [2024-11-08 16:37:16,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:37:16,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:16,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 48 [2024-11-08 16:37:17,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-08 16:37:17,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-08 16:37:17,566 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:17,566 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:37:18,152 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1305 (Array Int Int))) (= (select (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1305) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)) 1)) (forall ((v_ArrVal_1305 (Array Int Int))) (not (let ((.cse1 (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1305) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse1 4) (select .cse1 0))))))) is different from false [2024-11-08 16:37:18,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:18,331 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 81 treesize of output 85 [2024-11-08 16:37:18,377 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_5) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_5) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1305 (Array Int Int)) (v_ArrVal_1304 (Array Int Int))) (not (let ((.cse1 (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1304) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1305) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse1 4) (select .cse1 0))))))) is different from false [2024-11-08 16:37:18,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:18,389 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 27 treesize of output 28 [2024-11-08 16:37:18,393 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 171 treesize of output 165 [2024-11-08 16:37:18,399 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 87 treesize of output 85 [2024-11-08 16:37:18,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:18,411 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 92 treesize of output 96 [2024-11-08 16:37:18,420 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 96 treesize of output 92 [2024-11-08 16:37:18,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:18,474 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 26 treesize of output 27 [2024-11-08 16:37:18,479 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:37:18,481 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 40 treesize of output 36 [2024-11-08 16:37:18,495 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-08 16:37:18,496 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 34 treesize of output 33 [2024-11-08 16:37:18,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:37:18,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:18,522 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 50 treesize of output 43 [2024-11-08 16:37:18,525 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:37:18,526 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:37:18,528 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 31 treesize of output 25 [2024-11-08 16:37:18,537 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:37:18,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:18,544 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 1 case distinctions, treesize of input 60 treesize of output 58 [2024-11-08 16:37:18,993 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-08 16:37:18,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796049788] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:37:18,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:37:18,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 19] total 52 [2024-11-08 16:37:18,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389185802] [2024-11-08 16:37:18,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:37:18,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-08 16:37:18,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:37:18,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-08 16:37:18,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=2365, Unknown=12, NotChecked=198, Total=2756 [2024-11-08 16:37:18,997 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 53 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 53 states have internal predecessors, (95), 0 states have call successors, (0), 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 16:37:21,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:37:21,292 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2024-11-08 16:37:21,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-08 16:37:21,293 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 53 states have internal predecessors, (95), 0 states have call successors, (0), 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 38 [2024-11-08 16:37:21,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:37:21,294 INFO L225 Difference]: With dead ends: 89 [2024-11-08 16:37:21,294 INFO L226 Difference]: Without dead ends: 89 [2024-11-08 16:37:21,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1245 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=391, Invalid=4161, Unknown=12, NotChecked=266, Total=4830 [2024-11-08 16:37:21,296 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 128 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-08 16:37:21,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 785 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1322 Invalid, 0 Unknown, 136 Unchecked, 1.1s Time] [2024-11-08 16:37:21,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-08 16:37:21,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2024-11-08 16:37:21,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 79 states have (on average 1.139240506329114) internal successors, (90), 84 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 16:37:21,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 90 transitions. [2024-11-08 16:37:21,300 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 90 transitions. Word has length 38 [2024-11-08 16:37:21,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:37:21,301 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 90 transitions. [2024-11-08 16:37:21,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.8269230769230769) internal successors, (95), 53 states have internal predecessors, (95), 0 states have call successors, (0), 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 16:37:21,301 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 90 transitions. [2024-11-08 16:37:21,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-08 16:37:21,301 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:37:21,302 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:37:21,326 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-08 16:37:21,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-08 16:37:21,502 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:37:21,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:21,503 INFO L85 PathProgramCache]: Analyzing trace with hash 870803536, now seen corresponding path program 1 times [2024-11-08 16:37:21,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:37:21,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144780453] [2024-11-08 16:37:21,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:21,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:37:21,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:22,681 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:22,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:37:22,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144780453] [2024-11-08 16:37:22,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144780453] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:37:22,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307729357] [2024-11-08 16:37:22,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:22,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:37:22,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:37:22,685 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:37:22,687 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-08 16:37:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:22,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-08 16:37:22,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:37:22,904 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 16:37:23,005 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 16:37:23,006 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 16:37:23,201 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-08 16:37:23,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-08 16:37:23,260 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 16:37:23,341 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 16:37:23,342 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 33 treesize of output 32 [2024-11-08 16:37:23,474 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 25 treesize of output 18 [2024-11-08 16:37:23,551 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 36 treesize of output 20 [2024-11-08 16:37:23,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:37:23,858 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:23,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 48 [2024-11-08 16:37:24,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-08 16:37:24,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-08 16:37:24,273 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:24,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:37:24,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:24,845 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 69 treesize of output 73 [2024-11-08 16:37:25,215 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1393 (Array Int Int)) (v_prenex_7 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1393) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)))) (forall ((v_ArrVal_1393 (Array Int Int)) (v_prenex_7 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1393) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (forall ((v_ArrVal_1394 (Array Int Int)) (v_ArrVal_1393 (Array Int Int))) (not (let ((.cse1 (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1393) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1394) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse1 0) (select .cse1 4))))))) is different from false [2024-11-08 16:37:25,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:25,227 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 50 treesize of output 43 [2024-11-08 16:37:25,231 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 115 treesize of output 109 [2024-11-08 16:37:25,238 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 141 treesize of output 133 [2024-11-08 16:37:25,251 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 198 treesize of output 182 [2024-11-08 16:37:25,271 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:25,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 198 treesize of output 204 [2024-11-08 16:37:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-08 16:37:25,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307729357] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:37:25,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:37:25,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 57 [2024-11-08 16:37:25,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637981564] [2024-11-08 16:37:25,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:37:25,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-08 16:37:25,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:37:25,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-08 16:37:25,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=2967, Unknown=1, NotChecked=110, Total=3306 [2024-11-08 16:37:25,920 INFO L87 Difference]: Start difference. First operand 85 states and 90 transitions. Second operand has 58 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 58 states have internal predecessors, (95), 0 states have call successors, (0), 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 16:37:28,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:37:28,137 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2024-11-08 16:37:28,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 16:37:28,138 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 58 states have internal predecessors, (95), 0 states have call successors, (0), 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 38 [2024-11-08 16:37:28,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:37:28,138 INFO L225 Difference]: With dead ends: 88 [2024-11-08 16:37:28,138 INFO L226 Difference]: Without dead ends: 88 [2024-11-08 16:37:28,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=455, Invalid=4804, Unknown=1, NotChecked=142, Total=5402 [2024-11-08 16:37:28,140 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 139 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 1410 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:37:28,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 933 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1410 Invalid, 0 Unknown, 61 Unchecked, 1.2s Time] [2024-11-08 16:37:28,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-08 16:37:28,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2024-11-08 16:37:28,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.1265822784810127) internal successors, (89), 83 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 16:37:28,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2024-11-08 16:37:28,143 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 38 [2024-11-08 16:37:28,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:37:28,144 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2024-11-08 16:37:28,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 58 states have internal predecessors, (95), 0 states have call successors, (0), 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 16:37:28,144 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2024-11-08 16:37:28,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 16:37:28,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:37:28,145 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:37:28,164 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-08 16:37:28,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-08 16:37:28,349 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:37:28,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:28,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1912547234, now seen corresponding path program 1 times [2024-11-08 16:37:28,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:37:28,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427032133] [2024-11-08 16:37:28,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:28,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:37:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:29,269 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:29,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:37:29,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427032133] [2024-11-08 16:37:29,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427032133] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:37:29,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166498149] [2024-11-08 16:37:29,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:29,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:37:29,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:37:29,271 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:37:29,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-08 16:37:29,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:29,441 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-08 16:37:29,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:37:29,464 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 16:37:29,565 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-08 16:37:29,566 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 16:37:29,615 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 16:37:29,667 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 16:37:29,667 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 25 treesize of output 26 [2024-11-08 16:37:29,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-08 16:37:29,767 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 24 treesize of output 12 [2024-11-08 16:37:29,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:37:29,979 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:29,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 39 [2024-11-08 16:37:30,247 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 16:37:30,247 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 16:37:30,413 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-08 16:37:30,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2024-11-08 16:37:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:30,479 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:37:30,802 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 74 treesize of output 70 [2024-11-08 16:37:31,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:31,249 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 27 treesize of output 28 [2024-11-08 16:37:31,251 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 171 treesize of output 165 [2024-11-08 16:37:31,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:31,263 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 90 treesize of output 94 [2024-11-08 16:37:31,269 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 79 treesize of output 77 [2024-11-08 16:37:31,274 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 84 treesize of output 80 [2024-11-08 16:37:31,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:31,311 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 27 treesize of output 28 [2024-11-08 16:37:31,314 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:37:31,317 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 43 treesize of output 39 [2024-11-08 16:37:31,322 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:37:31,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:31,330 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 34 treesize of output 38 [2024-11-08 16:37:31,333 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:37:31,335 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 18 [2024-11-08 16:37:31,501 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-08 16:37:31,501 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 25 treesize of output 24 [2024-11-08 16:37:31,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:31,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166498149] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:37:31,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:37:31,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19, 20] total 51 [2024-11-08 16:37:31,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653673523] [2024-11-08 16:37:31,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:37:31,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-08 16:37:31,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:37:31,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-08 16:37:31,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=2415, Unknown=25, NotChecked=0, Total=2652 [2024-11-08 16:37:31,509 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 52 states, 51 states have (on average 2.0) internal successors, (102), 52 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:37:33,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:37:33,005 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2024-11-08 16:37:33,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 16:37:33,006 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.0) internal successors, (102), 52 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-08 16:37:33,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:37:33,006 INFO L225 Difference]: With dead ends: 82 [2024-11-08 16:37:33,007 INFO L226 Difference]: Without dead ends: 82 [2024-11-08 16:37:33,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=437, Invalid=4094, Unknown=25, NotChecked=0, Total=4556 [2024-11-08 16:37:33,009 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 140 mSDsluCounter, 762 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-08 16:37:33,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 803 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-08 16:37:33,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-08 16:37:33,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-08 16:37:33,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 79 states have (on average 1.1012658227848102) internal successors, (87), 81 states have internal predecessors, (87), 0 states have call successors, (0), 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 16:37:33,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2024-11-08 16:37:33,012 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 39 [2024-11-08 16:37:33,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:37:33,012 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2024-11-08 16:37:33,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.0) internal successors, (102), 52 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:37:33,013 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2024-11-08 16:37:33,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 16:37:33,013 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:37:33,013 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:37:33,034 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-08 16:37:33,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-08 16:37:33,214 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:37:33,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:33,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1866865264, now seen corresponding path program 1 times [2024-11-08 16:37:33,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:37:33,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667769130] [2024-11-08 16:37:33,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:33,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:37:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:34,282 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:34,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:37:34,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667769130] [2024-11-08 16:37:34,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667769130] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:37:34,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812245168] [2024-11-08 16:37:34,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:34,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:37:34,283 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:37:34,284 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:37:34,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-08 16:37:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:34,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-11-08 16:37:34,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:37:34,458 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 16:37:34,533 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 16:37:34,533 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 16:37:34,691 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-08 16:37:34,691 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 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-08 16:37:34,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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 16:37:34,827 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 16:37:34,827 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 1 case distinctions, treesize of input 42 treesize of output 39 [2024-11-08 16:37:34,978 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 34 treesize of output 25 [2024-11-08 16:37:35,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2024-11-08 16:37:35,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:37:35,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:35,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 48 [2024-11-08 16:37:36,035 INFO L349 Elim1Store]: treesize reduction 30, result has 63.4 percent of original size [2024-11-08 16:37:36,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 118 [2024-11-08 16:37:37,435 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 16:37:37,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 24 treesize of output 20 [2024-11-08 16:37:37,537 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:37,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:37:38,607 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1577 Int)) (let ((.cse1 (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse0 (store |c_#valid| (select .cse1 4) 0))) (or (= (select (store .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1577) (select .cse1 0)) 1) (not (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1)))))) (or (forall ((v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1577 Int)) (= (let ((.cse3 (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1574) 0) .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store (store |c_#valid| (select .cse3 4) 0) 0 v_ArrVal_1577) (select .cse3 0))) 1)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))))) is different from false [2024-11-08 16:37:38,868 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:38,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 570 treesize of output 653 [2024-11-08 16:37:40,435 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse10 (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_9) 0) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) 0)))) (.cse0 (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0)))) (and (or .cse0 (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1573 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_9) 0))) (let ((.cse1 (select .cse2 0)) (.cse4 (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1573) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1574) 0))) (or (= .cse1 0) (= (select (store .cse2 .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) (select (store .cse4 .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select .cse4 0) 0)))))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1573 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1573) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse6 (store .cse8 .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse7 (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_9) 0)) (.cse5 (select .cse8 0))) (or (= .cse5 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select .cse6 0) (select (store .cse7 .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)) (= (select .cse6 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select .cse7 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (or .cse0 (and (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int))) (not (let ((.cse9 (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_9) 0) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse9 0) (select .cse9 4))))) .cse10)) (forall ((v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1573 (Array Int Int))) (let ((.cse11 (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1573) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse12 (select .cse11 0))) (or (= (select .cse11 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= .cse12 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= .cse12 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (or (forall ((v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1573 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1573) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1574) 0) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) .cse0 (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int))) (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_9) 0) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int))) (let ((.cse13 (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_9) 0) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (or (= .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1573 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1573) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse14 (store .cse15 .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or (= (select .cse14 0) .cse13) (= (select .cse14 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= (select .cse15 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))))))) (forall ((v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1573 (Array Int Int))) (let ((.cse16 (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1573) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or (= (select .cse16 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= (select .cse16 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (or (and (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) .cse10) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int))) (let ((.cse18 (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_9) 0) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse17 (select .cse18 0))) (or (= .cse17 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= .cse17 (select .cse18 4)))))))) .cse0) (or .cse0 (forall ((v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1573 (Array Int Int))) (= 0 (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1573) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1574) 0) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) .cse10) (forall ((v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1573 (Array Int Int))) (let ((.cse20 (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1573) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse19 (select .cse20 0))) (or (= .cse19 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= .cse19 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= (select .cse20 4) .cse19)))))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1573 (Array Int Int))) (let ((.cse23 (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1573) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse22 (store .cse23 .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse21 (select .cse23 0))) (or (= .cse21 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select .cse22 0) (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_9) 0) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)) (= (select .cse22 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= .cse21 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (forall ((v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1573 (Array Int Int))) (let ((.cse25 (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1573) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse24 (select .cse25 0))) (or (= .cse24 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= (select .cse25 4) .cse24)))))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1573 (Array Int Int))) (let ((.cse27 (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1573) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse26 (store .cse27 .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or (= (select .cse26 0) (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_9) 0) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)) (= (select .cse26 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= (select .cse27 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1573 (Array Int Int))) (let ((.cse30 (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1573) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse29 (store .cse30 .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse28 (select .cse30 0))) (or (= .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select .cse29 0) (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_9) 0) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)) (= (select .cse29 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= .cse28 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int))) (let ((.cse31 (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_9) 0) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (or (= .cse31 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1573 (Array Int Int))) (let ((.cse34 (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1573) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse32 (store .cse34 .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse33 (select .cse34 0))) (or (not (= (select .cse32 4) .cse33)) (= (select .cse32 0) .cse31) (= .cse33 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))))) (or (forall ((v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1573 (Array Int Int))) (let ((.cse36 (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1573) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1574) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse35 (select .cse36 0))) (or (= .cse35 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select .cse36 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= .cse35 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int))) (let ((.cse37 (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_9) 0) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (or (= .cse37 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= .cse37 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (or .cse0 (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_ArrVal_1574 (Array Int Int)) (v_ArrVal_1573 (Array Int Int))) (let ((.cse39 (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_9) 0))) (let ((.cse38 (select .cse39 0))) (or (= .cse38 0) (= (select (store .cse39 .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1573) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1574) 0) .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)) (= .cse38 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))))))) is different from false [2024-11-08 16:37:40,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:40,527 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 142 treesize of output 102 [2024-11-08 16:37:40,547 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:40,548 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 1184 treesize of output 1148 [2024-11-08 16:37:40,576 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 608 treesize of output 580 [2024-11-08 16:37:40,600 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 517 treesize of output 503 [2024-11-08 16:37:40,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 268 treesize of output 260 [2024-11-08 16:37:40,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 293 treesize of output 277 [2024-11-08 16:37:41,845 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 38 treesize of output 32 [2024-11-08 16:37:41,887 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 27 treesize of output 23 [2024-11-08 16:37:41,915 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 16 treesize of output 12 [2024-11-08 16:37:42,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:42,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 178 treesize of output 174 [2024-11-08 16:37:42,756 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:42,756 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 50 treesize of output 43 [2024-11-08 16:37:42,763 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 231 treesize of output 221 [2024-11-08 16:37:42,771 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 137 treesize of output 129 [2024-11-08 16:37:42,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:42,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 166 treesize of output 172 [2024-11-08 16:37:42,807 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 216 treesize of output 200 [2024-11-08 16:37:42,940 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 16:37:42,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 1 [2024-11-08 16:37:42,952 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 16:37:42,953 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 54 treesize of output 1 [2024-11-08 16:37:42,962 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 16:37:42,962 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 98 treesize of output 1 [2024-11-08 16:37:42,978 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 16:37:42,979 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 113 treesize of output 1 [2024-11-08 16:37:42,991 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 16:37:42,992 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 124 treesize of output 1 [2024-11-08 16:37:43,004 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 16:37:43,005 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 92 treesize of output 1 [2024-11-08 16:37:43,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:43,016 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 77 treesize of output 61 [2024-11-08 16:37:43,027 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 186 treesize of output 178 [2024-11-08 16:37:43,041 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 274 treesize of output 254 [2024-11-08 16:37:43,066 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 223 treesize of output 213 [2024-11-08 16:37:43,093 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:37:43,105 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-08 16:37:43,105 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 1 case distinctions, treesize of input 244 treesize of output 235 [2024-11-08 16:37:43,195 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 16:37:43,196 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 131 treesize of output 1 [2024-11-08 16:37:43,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:43,207 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 54 treesize of output 46 [2024-11-08 16:37:43,217 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 156 treesize of output 150 [2024-11-08 16:37:43,230 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 186 treesize of output 178 [2024-11-08 16:37:43,252 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:37:43,263 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-08 16:37:43,263 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 1 case distinctions, treesize of input 134 treesize of output 131 [2024-11-08 16:37:43,278 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:37:43,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:37:43,283 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 78 treesize of output 76 [2024-11-08 16:37:43,346 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 16:37:43,346 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 82 treesize of output 1 [2024-11-08 16:37:43,360 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 16:37:43,360 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 44 treesize of output 1 [2024-11-08 16:37:43,378 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 16:37:43,379 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 22 treesize of output 1 [2024-11-08 16:37:43,388 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 16:37:43,388 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 44 treesize of output 1 [2024-11-08 16:37:43,401 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 16:37:43,402 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 83 treesize of output 1 [2024-11-08 16:37:43,411 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 16:37:43,411 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 65 treesize of output 1 [2024-11-08 16:37:43,424 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 16:37:43,424 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 103 treesize of output 1 [2024-11-08 16:37:43,436 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-08 16:37:43,436 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 43 treesize of output 1 [2024-11-08 16:37:44,183 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-08 16:37:44,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812245168] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:37:44,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:37:44,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 21] total 60 [2024-11-08 16:37:44,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57839601] [2024-11-08 16:37:44,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:37:44,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-11-08 16:37:44,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:37:44,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-11-08 16:37:44,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=3218, Unknown=2, NotChecked=230, Total=3660 [2024-11-08 16:37:44,187 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 61 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 61 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:37:47,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:37:47,611 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2024-11-08 16:37:47,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-08 16:37:47,612 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 61 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-11-08 16:37:47,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:37:47,612 INFO L225 Difference]: With dead ends: 85 [2024-11-08 16:37:47,612 INFO L226 Difference]: Without dead ends: 85 [2024-11-08 16:37:47,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=497, Invalid=5829, Unknown=2, NotChecked=314, Total=6642 [2024-11-08 16:37:47,614 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 151 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 1420 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 923 SdHoareTripleChecker+Invalid, 1578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 16:37:47,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 923 Invalid, 1578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1420 Invalid, 0 Unknown, 132 Unchecked, 1.3s Time] [2024-11-08 16:37:47,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-08 16:37:47,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2024-11-08 16:37:47,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 79 states have (on average 1.0886075949367089) internal successors, (86), 80 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:37:47,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2024-11-08 16:37:47,615 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 39 [2024-11-08 16:37:47,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:37:47,616 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2024-11-08 16:37:47,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 1.8666666666666667) internal successors, (112), 61 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 16:37:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2024-11-08 16:37:47,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-08 16:37:47,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:37:47,617 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:37:47,637 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-08 16:37:47,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-08 16:37:47,818 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:37:47,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:47,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1457707734, now seen corresponding path program 1 times [2024-11-08 16:37:47,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:37:47,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963883796] [2024-11-08 16:37:47,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:47,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:37:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:49,208 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:49,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:37:49,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963883796] [2024-11-08 16:37:49,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963883796] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:37:49,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394565064] [2024-11-08 16:37:49,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:49,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:37:49,210 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:37:49,211 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:37:49,213 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-08 16:37:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:49,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-08 16:37:49,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:37:49,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-08 16:37:49,498 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-08 16:37:49,498 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 16:37:49,641 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-08 16:37:49,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-08 16:37:49,694 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 16:37:49,771 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 16:37:49,771 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 33 treesize of output 32 [2024-11-08 16:37:49,911 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 25 treesize of output 18 [2024-11-08 16:37:49,985 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 36 treesize of output 20 [2024-11-08 16:37:50,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:37:50,284 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:50,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 48 [2024-11-08 16:37:50,863 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2024-11-08 16:37:50,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 88 [2024-11-08 16:37:51,214 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-08 16:37:51,215 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 18 treesize of output 13 [2024-11-08 16:37:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:51,220 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:37:51,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:51,952 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 166 treesize of output 170 [2024-11-08 16:37:52,533 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:52,533 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 27 treesize of output 28 [2024-11-08 16:37:52,536 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 171 treesize of output 165 [2024-11-08 16:37:52,542 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 81 [2024-11-08 16:37:52,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:52,555 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 86 treesize of output 90 [2024-11-08 16:37:52,562 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 84 treesize of output 80 [2024-11-08 16:37:52,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:52,613 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 26 treesize of output 27 [2024-11-08 16:37:52,617 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:37:52,620 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 40 treesize of output 36 [2024-11-08 16:37:52,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:37:52,638 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 16:37:52,638 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 20 treesize of output 20 [2024-11-08 16:37:52,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:52,652 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 50 treesize of output 43 [2024-11-08 16:37:52,656 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:37:52,658 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 59 treesize of output 53 [2024-11-08 16:37:52,663 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:37:52,679 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-11-08 16:37:52,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 55 [2024-11-08 16:37:52,684 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 16:37:52,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:37:52,688 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 16:37:53,330 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:53,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394565064] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:37:53,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:37:53,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 57 [2024-11-08 16:37:53,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235247043] [2024-11-08 16:37:53,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:37:53,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-08 16:37:53,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:37:53,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-08 16:37:53,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=3022, Unknown=4, NotChecked=0, Total=3306 [2024-11-08 16:37:53,333 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 58 states, 57 states have (on average 1.8245614035087718) internal successors, (104), 58 states have internal predecessors, (104), 0 states have call successors, (0), 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 16:37:55,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:37:55,554 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2024-11-08 16:37:55,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-08 16:37:55,555 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.8245614035087718) internal successors, (104), 58 states have internal predecessors, (104), 0 states have call successors, (0), 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 39 [2024-11-08 16:37:55,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:37:55,556 INFO L225 Difference]: With dead ends: 84 [2024-11-08 16:37:55,556 INFO L226 Difference]: Without dead ends: 84 [2024-11-08 16:37:55,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1688 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=529, Invalid=4723, Unknown=4, NotChecked=0, Total=5256 [2024-11-08 16:37:55,558 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 124 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-08 16:37:55,558 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 824 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-08 16:37:55,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-08 16:37:55,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2024-11-08 16:37:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.0759493670886076) internal successors, (85), 79 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 16:37:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2024-11-08 16:37:55,561 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 39 [2024-11-08 16:37:55,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:37:55,562 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2024-11-08 16:37:55,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 1.8245614035087718) internal successors, (104), 58 states have internal predecessors, (104), 0 states have call successors, (0), 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 16:37:55,562 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2024-11-08 16:37:55,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 16:37:55,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:37:55,563 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:37:55,588 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-08 16:37:55,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:37:55,763 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:37:55,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:37:55,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1627118015, now seen corresponding path program 1 times [2024-11-08 16:37:55,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:37:55,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66938642] [2024-11-08 16:37:55,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:55,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:37:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:57,181 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:37:57,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:37:57,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66938642] [2024-11-08 16:37:57,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66938642] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:37:57,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990593782] [2024-11-08 16:37:57,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:37:57,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:37:57,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:37:57,183 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:37:57,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-08 16:37:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:37:57,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-08 16:37:57,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:37:57,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 16:37:57,872 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 16:37:57,872 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 62 treesize of output 59 [2024-11-08 16:37:58,066 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-08 16:37:58,067 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 54 treesize of output 45 [2024-11-08 16:37:58,094 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 73 treesize of output 53 [2024-11-08 16:37:58,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:37:58,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:37:58,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 69 [2024-11-08 16:38:00,168 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base_55| Int) (|v_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base_55| Int) (|v_ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base_49| Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base_55| 1))) (and (= (select .cse0 |v_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base_55|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base_49| 0) |v_ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base_55| 0) |v_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base_55| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base_55|) 0) (= (select (store .cse0 |v_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base_55| 1) |v_ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base_49|) 0)))) is different from true [2024-11-08 16:38:00,180 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:38:00,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:38:01,051 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1755 (Array Int Int))) (= (let ((.cse0 (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1755) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse0 4) 0) (select .cse0 0) 0)) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-08 16:38:01,063 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1755 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (let ((.cse0 (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1755) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select .cse0 4) 0) (select .cse0 0) 0)))) is different from false [2024-11-08 16:38:01,070 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1755 (Array Int Int)) (v_ArrVal_1754 (Array Int Int))) (= (let ((.cse0 (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1754) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1755) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select .cse0 4) 0) (select .cse0 0) 0)) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-08 16:38:01,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:38:01,085 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 62 treesize of output 55 [2024-11-08 16:38:01,089 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 162 treesize of output 156 [2024-11-08 16:38:01,097 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 296 treesize of output 280 [2024-11-08 16:38:01,146 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:38:01,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 197 treesize of output 203 [2024-11-08 16:38:01,166 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 189 treesize of output 181 [2024-11-08 16:38:08,795 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse2 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse11 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse172 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)))) (.cse1 (store .cse2 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0)) (.cse12 (= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) 0)) (.cse21 (not .cse10))) (let ((.cse3 (store .cse2 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (.cse9 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse35 (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse2 v_arrayElimCell_306 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse21)) (.cse126 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse255 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse256 (store .cse2 v_arrayElimCell_306 0))) (or (= .cse255 (select (store .cse256 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse255 (select (store (store .cse2 v_arrayElimCell_311 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse255 (select (store .cse256 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse16 (not .cse12)) (.cse20 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse253 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse254 (store .cse2 v_arrayElimCell_306 0))) (or (= .cse253 (select (store .cse254 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse253 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse253 (select (store .cse254 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse69 (or .cse21 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse251 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse252 (store .cse2 v_arrayElimCell_306 0))) (or (= .cse251 (select (store .cse252 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse251 (select (store .cse252 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (.cse41 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse249 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse250 (store .cse2 v_arrayElimCell_306 0))) (or (= .cse249 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse249 (select (store .cse250 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse249 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse249 (select (store .cse250 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse56 (or .cse172 .cse21)) (.cse147 (not .cse11)) (.cse168 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_305 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse1 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1))))) (and (or (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse0 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (or (= .cse0 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse0 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))) (= .cse0 (select .cse3 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse4 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse4 (select .cse3 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse5 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse4 (select (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse4 (select (store .cse5 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse6 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse6 (select .cse3 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_310 Int)) (or (= .cse6 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int)) (let ((.cse7 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse6 (select (store .cse7 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse6 (select (store .cse7 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))))))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse8 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse8 (select .cse3 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (= .cse8 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse3 v_antiDerIndex_entry0_1))) .cse9)) .cse10 .cse11 .cse12) (or (and (or (and (or (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse15 (store .cse2 v_arrayElimCell_311 0)) (.cse13 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse14 (store .cse2 v_arrayElimCell_306 0))) (or (= .cse13 (select (store .cse14 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse13 (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse13 (select (store .cse15 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse13 (select (store .cse15 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse13 (select (store .cse14 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse16) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse17 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse18 (store .cse2 v_arrayElimCell_306 0))) (or (= .cse17 (select (store .cse18 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_309 Int)) (let ((.cse19 (store .cse2 v_arrayElimCell_309 0))) (or (= .cse17 (select (store .cse19 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_308 Int)) (= .cse17 (select (store .cse19 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)))))) (= .cse17 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse17 (select (store .cse18 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse20 .cse21) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse22 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse23 (store .cse2 v_arrayElimCell_306 0))) (or (= .cse22 (select (store .cse23 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_308 Int) (v_arrayElimCell_309 Int)) (= .cse22 (select (store (store .cse2 v_arrayElimCell_309 0) v_arrayElimCell_308 0) v_antiDerIndex_entry0_1))) (= .cse22 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse22 (select (store .cse23 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse12) (or .cse16 (and (forall ((v_arrayElimCell_308 Int) (v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int)) (let ((.cse25 (store .cse2 v_arrayElimCell_309 0)) (.cse24 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse24 (select (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse26 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse24 (select (store .cse26 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse24 (select (store .cse26 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) (= .cse24 (select (store .cse25 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)) (= .cse24 (select (store (store .cse2 v_arrayElimCell_306 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int)) (let ((.cse27 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_311 Int)) (= .cse27 (select (store (store .cse2 v_arrayElimCell_311 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse27 (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse27 (select (store (store .cse2 v_arrayElimCell_306 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_308 Int) (v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int)) (let ((.cse29 (store .cse2 v_arrayElimCell_309 0)) (.cse28 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_311 Int)) (= .cse28 (select (store (store .cse2 v_arrayElimCell_311 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse28 (select (store .cse29 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse28 (select (store .cse29 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)) (= .cse28 (select (store (store .cse2 v_arrayElimCell_306 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int)) (let ((.cse30 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse30 (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse31 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse30 (select (store .cse31 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse30 (select (store .cse31 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) (= .cse30 (select (store (store .cse2 v_arrayElimCell_306 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_308 Int) (v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int)) (let ((.cse33 (store .cse2 v_arrayElimCell_309 0)) (.cse32 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse32 (select (store .cse33 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse32 (select (store .cse33 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)) (= .cse32 (select (store (store .cse2 v_arrayElimCell_306 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse21) (or (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int)) (let ((.cse34 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse34 (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse34 (select (store (store .cse2 v_arrayElimCell_306 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse21) .cse35 (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int)) (let ((.cse36 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_310 Int)) (or (= .cse36 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int)) (let ((.cse37 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse36 (select (store .cse37 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse36 (select (store .cse37 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))))) (= .cse36 (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse36 (select (store (store .cse2 v_arrayElimCell_306 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_308 Int) (v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int)) (let ((.cse40 (store .cse2 v_arrayElimCell_309 0)) (.cse38 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_310 Int)) (or (= .cse38 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int)) (let ((.cse39 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse38 (select (store .cse39 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse38 (select (store .cse39 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))))) (= .cse38 (select (store .cse40 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse38 (select (store .cse40 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)) (= .cse38 (select (store (store .cse2 v_arrayElimCell_306 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or (and (or .cse41 .cse21) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse42 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse43 (store .cse2 v_arrayElimCell_306 0))) (or (= .cse42 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse42 (select (store .cse43 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_308 Int) (v_arrayElimCell_309 Int)) (= .cse42 (select (store (store .cse2 v_arrayElimCell_309 0) v_arrayElimCell_308 0) v_antiDerIndex_entry0_1))) (= .cse42 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse42 (select (store .cse43 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse44 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse45 (store .cse2 v_arrayElimCell_306 0))) (or (= .cse44 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse44 (select (store .cse45 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_309 Int)) (let ((.cse46 (store .cse2 v_arrayElimCell_309 0))) (or (= .cse44 (select (store .cse46 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_308 Int)) (= .cse44 (select (store .cse46 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)))))) (= .cse44 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse44 (select (store .cse45 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse12) (or (forall ((v_arrayElimCell_308 Int) (v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse49 (store .cse2 v_arrayElimCell_311 0)) (.cse47 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse48 (store .cse2 v_arrayElimCell_306 0))) (or (= .cse47 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse47 (select (store .cse48 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse47 (select (store .cse49 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse47 (select (store .cse49 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse47 (select (store (store .cse2 v_arrayElimCell_309 0) v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)) (= .cse47 (select (store .cse48 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse12) (or .cse9 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse50 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse51 (store .cse2 v_arrayElimCell_306 0))) (or (= .cse50 (select (store .cse51 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_309 Int)) (let ((.cse52 (store .cse2 v_arrayElimCell_309 0))) (or (= .cse50 (select (store .cse52 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_308 Int)) (= .cse50 (select (store .cse52 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)))))) (= .cse50 (select (store .cse51 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse53 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse53 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_309 Int)) (let ((.cse54 (store .cse2 v_arrayElimCell_309 0))) (or (= .cse53 (select (store .cse54 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_308 Int)) (= .cse53 (select (store .cse54 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1))))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse55 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse55 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_308 Int) (v_arrayElimCell_309 Int)) (= .cse55 (select (store (store .cse2 v_arrayElimCell_309 0) v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)))))) .cse56) .cse12) (or (forall ((v_arrayElimCell_308 Int) (v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse57 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse58 (store .cse2 v_arrayElimCell_306 0))) (or (= .cse57 (select (store .cse58 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse57 (select (store (store .cse2 v_arrayElimCell_309 0) v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)) (= .cse57 (select (store .cse58 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse12) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int)) (let ((.cse59 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_309 Int)) (let ((.cse60 (store .cse2 v_arrayElimCell_309 0))) (or (= .cse59 (select (store .cse60 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_308 Int)) (= .cse59 (select (store .cse60 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)))))) (= .cse59 (select (store (store .cse2 v_arrayElimCell_306 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int)) (let ((.cse61 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_309 Int)) (= .cse61 (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse61 (select (store (store .cse2 v_arrayElimCell_306 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse35) .cse16) (or .cse10 (and (or .cse16 (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))) (or (forall ((v_arrayElimCell_308 Int) (v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse2 v_arrayElimCell_309 0) v_arrayElimCell_308 0) v_antiDerIndex_entry0_1))) .cse12) (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse62 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse63 (store .cse2 v_arrayElimCell_309 0))) (or (= .cse62 (select (store .cse63 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_308 Int)) (= .cse62 (select (store .cse63 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)))))))) (or .cse16 (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse64 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse65 (store .cse2 v_arrayElimCell_306 0))) (or (= .cse64 (select (store .cse65 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse64 (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse64 (select (store .cse65 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (or (forall ((v_arrayElimCell_308 Int) (v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse68 (store .cse2 v_arrayElimCell_311 0)) (.cse66 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse67 (store .cse2 v_arrayElimCell_306 0))) (or (= .cse66 (select (store .cse67 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse66 (select (store .cse68 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse66 (select (store .cse68 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse66 (select (store (store .cse2 v_arrayElimCell_309 0) v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)) (= .cse66 (select (store .cse67 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse12) .cse69 (or .cse10 (and (or (forall ((v_arrayElimCell_308 Int) (v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse70 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse71 (store .cse2 v_arrayElimCell_309 0))) (or (= .cse70 (select (store .cse71 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse70 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse70 (select (store .cse71 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1))))) .cse12) (or .cse16 (and (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse72 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse72 (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse73 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse72 (select (store .cse73 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse72 (select (store .cse73 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse74 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_310 Int)) (or (= .cse74 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int)) (let ((.cse75 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse74 (select (store .cse75 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse74 (select (store .cse75 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))))) (= .cse74 (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse76 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_311 Int)) (= .cse76 (select (store (store .cse2 v_arrayElimCell_311 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse76 (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or .cse16 (forall ((v_arrayElimCell_308 Int) (v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int)) (let ((.cse77 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse78 (store .cse2 v_arrayElimCell_309 0))) (or (= .cse77 (select (store .cse78 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse77 (select (store (store .cse2 v_arrayElimCell_311 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse77 (select (store .cse78 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)))))) (or (and (forall ((v_arrayElimCell_308 Int) (v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse79 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_310 Int)) (or (= .cse79 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int)) (let ((.cse80 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse79 (select (store .cse80 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse79 (select (store .cse80 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))))) (= .cse79 (select (store (store .cse2 v_arrayElimCell_309 0) v_arrayElimCell_308 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_308 Int) (v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse81 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse82 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse81 (select (store .cse82 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse81 (select (store .cse82 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) (= .cse81 (select (store (store .cse2 v_arrayElimCell_309 0) v_arrayElimCell_308 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_308 Int) (v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse83 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (or (= .cse83 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse83 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))) (= .cse83 (select (store (store .cse2 v_arrayElimCell_309 0) v_arrayElimCell_308 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_308 Int) (v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse84 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (= .cse84 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))) (= .cse84 (select (store (store .cse2 v_arrayElimCell_309 0) v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)))))) .cse12) (forall ((v_arrayElimCell_308 Int) (v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse85 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse86 (store .cse2 v_arrayElimCell_309 0))) (or (= .cse85 (select (store .cse86 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse87 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse85 (select (store .cse87 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse85 (select (store .cse87 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) (= .cse85 (select (store .cse86 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_308 Int) (v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse88 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse90 (store .cse2 v_arrayElimCell_309 0))) (or (forall ((v_arrayElimCell_310 Int)) (or (= .cse88 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int)) (let ((.cse89 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse88 (select (store .cse89 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse88 (select (store .cse89 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))))) (= .cse88 (select (store .cse90 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse88 (select (store .cse90 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_308 Int) (v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse91 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse92 (store .cse2 v_arrayElimCell_309 0))) (or (= .cse91 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse91 (select (store .cse92 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse91 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse91 (select (store .cse92 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1))))) .cse12))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse95 (store .cse2 v_arrayElimCell_311 0)) (.cse93 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse94 (store .cse2 v_arrayElimCell_306 0))) (or (= .cse93 (select (store .cse94 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse93 (select (store .cse95 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse93 (select (store .cse95 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse93 (select (store .cse94 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse21) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse96 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse98 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse96 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse96 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_309 Int)) (let ((.cse97 (store .cse2 v_arrayElimCell_309 0))) (or (= .cse96 (select (store .cse97 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_308 Int)) (= .cse96 (select (store .cse97 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)))))) (= .cse96 (select (store .cse98 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse96 (select (store .cse98 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse99 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse99 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse99 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse99 (select (store (store .cse2 v_arrayElimCell_311 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse21) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse100 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse100 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse100 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_309 Int)) (let ((.cse101 (store .cse2 v_arrayElimCell_309 0))) (or (= .cse100 (select (store .cse101 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_308 Int)) (= .cse100 (select (store .cse101 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)))))) (= .cse100 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse102 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse103 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse102 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse102 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_308 Int) (v_arrayElimCell_309 Int)) (= .cse102 (select (store (store .cse2 v_arrayElimCell_309 0) v_arrayElimCell_308 0) v_antiDerIndex_entry0_1))) (= .cse102 (select (store .cse103 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse102 (select (store .cse103 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse104 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse105 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse104 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_308 Int) (v_arrayElimCell_309 Int)) (= .cse104 (select (store (store .cse2 v_arrayElimCell_309 0) v_arrayElimCell_308 0) v_antiDerIndex_entry0_1))) (= .cse104 (select (store .cse105 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse104 (select (store .cse105 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse106 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse106 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse106 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_308 Int) (v_arrayElimCell_309 Int)) (= .cse106 (select (store (store .cse2 v_arrayElimCell_309 0) v_arrayElimCell_308 0) v_antiDerIndex_entry0_1))) (= .cse106 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) .cse56 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse107 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse109 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse107 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_309 Int)) (let ((.cse108 (store .cse2 v_arrayElimCell_309 0))) (or (= .cse107 (select (store .cse108 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_308 Int)) (= .cse107 (select (store .cse108 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)))))) (= .cse107 (select (store .cse109 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse107 (select (store .cse109 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse110 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse110 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_308 Int) (v_arrayElimCell_309 Int)) (= .cse110 (select (store (store .cse2 v_arrayElimCell_309 0) v_arrayElimCell_308 0) v_antiDerIndex_entry0_1))) (= .cse110 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse111 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse112 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse111 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse111 (select (store .cse112 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse111 (select (store .cse112 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) .cse21) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse113 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse113 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_309 Int)) (let ((.cse114 (store .cse2 v_arrayElimCell_309 0))) (or (= .cse113 (select (store .cse114 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_308 Int)) (= .cse113 (select (store .cse114 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)))))) (= .cse113 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse115 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse115 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse115 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse115 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) .cse21) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse116 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse116 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse116 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) .cse21)) .cse12) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse120 (store .cse2 v_arrayElimCell_311 0)) (.cse117 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse118 (store .cse2 v_arrayElimCell_306 0))) (or (= .cse117 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse117 (select (store .cse118 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_309 Int)) (let ((.cse119 (store .cse2 v_arrayElimCell_309 0))) (or (= .cse117 (select (store .cse119 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_308 Int)) (= .cse117 (select (store .cse119 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)))))) (= .cse117 (select (store .cse120 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse117 (select (store .cse120 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse117 (select (store .cse118 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse16 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse121 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse122 (store .cse2 v_arrayElimCell_306 0))) (or (= .cse121 (select (store .cse122 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_309 Int)) (let ((.cse123 (store .cse2 v_arrayElimCell_309 0))) (or (= .cse121 (select (store .cse123 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_308 Int)) (= .cse121 (select (store .cse123 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)))))) (= .cse121 (select (store (store .cse2 v_arrayElimCell_311 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse121 (select (store .cse122 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse124 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse125 (store .cse2 v_arrayElimCell_306 0))) (or (= .cse124 (select (store .cse125 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_309 Int)) (= .cse124 (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse124 (select (store (store .cse2 v_arrayElimCell_311 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse124 (select (store .cse125 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse126 .cse21))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse130 (store .cse2 v_arrayElimCell_311 0)) (.cse127 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse128 (store .cse2 v_arrayElimCell_306 0))) (or (= .cse127 (select (store .cse128 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_309 Int)) (let ((.cse129 (store .cse2 v_arrayElimCell_309 0))) (or (= .cse127 (select (store .cse129 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_308 Int)) (= .cse127 (select (store .cse129 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)))))) (= .cse127 (select (store .cse130 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse127 (select (store .cse130 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse127 (select (store .cse128 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse21 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse131 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse132 (store .cse2 v_arrayElimCell_306 0))) (or (= .cse131 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse131 (select (store .cse132 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse131 (select (store (store .cse2 v_arrayElimCell_311 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse131 (select (store .cse132 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse16 (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse135 (store .cse2 v_arrayElimCell_311 0)) (.cse133 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse134 (store .cse2 v_arrayElimCell_306 0))) (or (= .cse133 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse133 (select (store .cse134 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse133 (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse133 (select (store .cse135 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse133 (select (store .cse135 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse133 (select (store .cse134 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) .cse11) (or (let ((.cse137 (store .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))) (and (or (let ((.cse139 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_305 Int)) (let ((.cse146 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse146 (select .cse137 v_antiDerIndex_entry0_1)) (= .cse146 (select (store .cse1 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1))))))) (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_305 Int)) (let ((.cse136 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse136 (select .cse137 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_310 Int)) (or (= .cse136 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int)) (let ((.cse138 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse136 (select (store .cse138 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse136 (select (store .cse138 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))))) (= .cse136 (select (store .cse1 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1))))) (or .cse139 .cse21) (or .cse10 (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse140 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse140 (select .cse137 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_310 Int)) (= .cse140 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse141 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse141 (select .cse137 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_310 Int)) (or (= .cse141 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int)) (let ((.cse142 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse141 (select (store .cse142 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse141 (select (store .cse142 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))))))))) (or (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse137 v_antiDerIndex_entry0_1))) .cse9) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse143 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (or (= .cse143 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse143 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))) (= .cse143 (select .cse137 v_antiDerIndex_entry0_1))))))) (or .cse9 .cse139) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_305 Int)) (let ((.cse144 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (or (= .cse144 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse144 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))) (= .cse144 (select .cse137 v_antiDerIndex_entry0_1)) (= .cse144 (select (store .cse1 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_305 Int)) (let ((.cse145 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse145 (select .cse137 v_antiDerIndex_entry0_1)) (= .cse145 (select (store .cse1 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_310 Int)) (= .cse145 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))))))) .cse147) (or .cse10 .cse11 (and (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse148 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (= .cse148 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))) (= .cse148 (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse149 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse149 (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse150 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse149 (select (store .cse150 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse149 (select (store .cse150 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse151 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse151 (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_310 Int)) (or (= .cse151 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int)) (let ((.cse152 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse151 (select (store .cse152 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse151 (select (store .cse152 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))))))))) (or (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse9) (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse153 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (or (= .cse153 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse153 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))) (= .cse153 (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or .cse147 (let ((.cse154 (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_305 Int)) (let ((.cse159 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse159 (select .cse137 v_antiDerIndex_entry0_1)) (= .cse159 (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse159 (select (store .cse1 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1))))))) (and (or .cse9 .cse154) (or .cse154 .cse21) (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_305 Int)) (let ((.cse155 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse155 (select .cse137 v_antiDerIndex_entry0_1)) (= .cse155 (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_310 Int)) (or (= .cse155 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int)) (let ((.cse156 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse155 (select (store .cse156 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse155 (select (store .cse156 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))))) (= .cse155 (select (store .cse1 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_305 Int)) (let ((.cse157 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse157 (select .cse137 v_antiDerIndex_entry0_1)) (= .cse157 (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse157 (select (store .cse1 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_310 Int)) (= .cse157 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_305 Int)) (let ((.cse158 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (or (= .cse158 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse158 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))) (= .cse158 (select .cse137 v_antiDerIndex_entry0_1)) (= .cse158 (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse158 (select (store .cse1 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)))))))) (or .cse10 (and (or .cse147 (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_310 Int)) (let ((.cse160 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse160 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse160 (select .cse137 v_antiDerIndex_entry0_1)) (= .cse160 (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse9 (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse161 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse161 (select .cse137 v_antiDerIndex_entry0_1)) (= .cse161 (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse162 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (or (= .cse162 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse162 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))) (= .cse162 (select .cse137 v_antiDerIndex_entry0_1)) (= .cse162 (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse163 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse163 (select .cse137 v_antiDerIndex_entry0_1)) (= .cse163 (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_310 Int)) (or (= .cse163 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int)) (let ((.cse164 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse163 (select (store .cse164 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse163 (select (store .cse164 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))))))))) (or (and (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse165 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse165 (select .cse137 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (= .cse165 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))) (= .cse165 (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_309 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse166 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse166 (select .cse137 v_antiDerIndex_entry0_1)) (= .cse166 (select (store (store .cse2 v_arrayElimCell_309 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse167 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse166 (select (store .cse167 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse166 (select (store .cse167 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))))))) .cse11))))) .cse12) (or .cse147 .cse168 .cse21)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (or .cse11 (let ((.cse170 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (let ((.cse171 (forall ((v_arrayElimCell_308 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse205 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse205 (select .cse170 v_antiDerIndex_entry0_1)) (= .cse205 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse205 (select (store .cse3 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1))))))) (and (or .cse9 (and (or (forall ((v_arrayElimCell_308 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse169 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse169 (select .cse170 v_antiDerIndex_entry0_1)) (= .cse169 (select (store .cse3 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1))))) .cse10) (or .cse171 .cse12))) (or (and (or .cse172 .cse12) (or .cse9 .cse172 .cse12)) .cse21) (or (and (or (forall ((v_arrayElimCell_308 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse173 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse174 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse173 (select (store .cse3 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)) (= .cse173 (select (store .cse174 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse173 (select (store .cse174 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) .cse10) (forall ((v_arrayElimCell_308 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse175 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse176 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse175 (select (store .cse3 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (= .cse175 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1))) (= .cse175 (select (store .cse176 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse175 (select (store .cse176 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) (or .cse9 (and (or .cse10 (forall ((v_arrayElimCell_308 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse3 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)))) (forall ((v_arrayElimCell_308 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse177 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse177 (select (store .cse3 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (= .cse177 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_308 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse178 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse178 (select (store .cse3 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (= .cse178 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1))) (= .cse178 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_308 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse179 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse179 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse179 (select (store .cse3 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (= .cse179 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1))) (= .cse179 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) (or .cse10 (forall ((v_arrayElimCell_308 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse180 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse180 (select (store .cse3 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)) (= .cse180 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_308 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse181 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse182 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse181 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse181 (select (store .cse3 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (= .cse181 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1))) (= .cse181 (select (store .cse182 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse181 (select (store .cse182 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) (or .cse10 (forall ((v_arrayElimCell_308 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse183 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse184 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse183 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse183 (select (store .cse3 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)) (= .cse183 (select (store .cse184 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse183 (select (store .cse184 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))))) (or .cse10 (forall ((v_arrayElimCell_308 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse185 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse185 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse185 (select (store .cse3 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)) (= .cse185 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_308 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse186 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse186 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse186 (select (store .cse3 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1))))) .cse21)) .cse12) (or (and (forall ((v_arrayElimCell_308 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse187 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse187 (select .cse170 v_antiDerIndex_entry0_1)) (= .cse187 (select (store .cse3 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_310 Int)) (or (= .cse187 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int)) (let ((.cse188 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse187 (select (store .cse188 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse187 (select (store .cse188 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))))))))) (or (forall ((v_arrayElimCell_308 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse189 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse189 (select .cse170 v_antiDerIndex_entry0_1)) (= .cse189 (select (store .cse3 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)) (= .cse189 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) .cse12) (or (forall ((v_arrayElimCell_308 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int)) (let ((.cse190 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse190 (select .cse170 v_antiDerIndex_entry0_1)) (= .cse190 (select (store .cse3 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)) (= .cse190 (select (store (store .cse2 v_arrayElimCell_311 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse16) (or (forall ((v_arrayElimCell_308 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse191 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse191 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse191 (select .cse170 v_antiDerIndex_entry0_1)) (= .cse191 (select (store .cse3 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)) (= .cse191 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) .cse12) (forall ((v_arrayElimCell_308 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse192 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse192 (select .cse170 v_antiDerIndex_entry0_1)) (= .cse192 (select (store .cse3 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse193 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse192 (select (store .cse193 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse192 (select (store .cse193 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))))))) .cse10) (or .cse16 (and (or .cse10 (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse194 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse194 (select .cse170 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse195 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse194 (select (store .cse195 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse194 (select (store .cse195 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse196 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse196 (select .cse170 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int)) (= .cse196 (select (store (store .cse2 v_arrayElimCell_311 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse197 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse197 (select .cse170 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_310 Int)) (or (= .cse197 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int)) (let ((.cse198 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse197 (select (store .cse198 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse197 (select (store .cse198 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))))))))))) (or .cse10 .cse9 (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse170 v_antiDerIndex_entry0_1)))))) (or (and (forall ((v_arrayElimCell_308 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse199 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse199 (select .cse170 v_antiDerIndex_entry0_1)) (= .cse199 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse199 (select (store .cse3 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse200 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse199 (select (store .cse200 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse199 (select (store .cse200 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))))))) (or .cse171 .cse21) (forall ((v_arrayElimCell_308 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse201 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse201 (select .cse170 v_antiDerIndex_entry0_1)) (= .cse201 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse201 (select (store .cse3 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_310 Int)) (or (= .cse201 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int)) (let ((.cse202 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse201 (select (store .cse202 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse201 (select (store .cse202 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))))))))) (forall ((v_arrayElimCell_308 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse203 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse203 (select .cse170 v_antiDerIndex_entry0_1)) (= .cse203 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (= .cse203 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))) (= .cse203 (select (store .cse3 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_308 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse204 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (or (= .cse204 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse204 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))) (= .cse204 (select .cse170 v_antiDerIndex_entry0_1)) (= .cse204 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse204 (select (store .cse3 v_arrayElimCell_308 0) v_antiDerIndex_entry0_1)))))) .cse12))))) (or (not .cse9) (and (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse206 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse206 (select (store .cse1 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse206 (select (store (store .cse2 v_arrayElimCell_311 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse206 (select (store (store .cse2 v_arrayElimCell_306 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse16) (or (and (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse207 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse207 (select (store .cse1 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse207 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse207 (select (store (store .cse2 v_arrayElimCell_306 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse12) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse208 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse208 (select (store .cse1 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse209 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse208 (select (store .cse209 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse208 (select (store .cse209 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) (= .cse208 (select (store (store .cse2 v_arrayElimCell_306 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse11) (or .cse16 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int)) (let ((.cse210 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_311 Int)) (= .cse210 (select (store (store .cse2 v_arrayElimCell_311 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse210 (select (store (store .cse2 v_arrayElimCell_306 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int)) (let ((.cse211 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_310 Int)) (or (= .cse211 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int)) (let ((.cse212 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse211 (select (store .cse212 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse211 (select (store .cse212 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))))) (= .cse211 (select (store (store .cse2 v_arrayElimCell_306 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse35 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int)) (let ((.cse213 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse214 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse213 (select (store .cse214 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse213 (select (store .cse214 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) (= .cse213 (select (store (store .cse2 v_arrayElimCell_306 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse215 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse215 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse215 (select (store .cse1 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse215 (select (store (store .cse2 v_arrayElimCell_306 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse147) (or (and (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse216 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse216 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse216 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) .cse12) (or .cse11 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse217 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse218 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse217 (select (store .cse218 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse217 (select (store .cse218 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))) .cse12))) (or .cse147 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_310 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse2 v_arrayElimCell_311 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse16) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_310 Int)) (let ((.cse219 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse219 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int)) (let ((.cse220 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse219 (select (store .cse220 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse219 (select (store .cse220 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))))))) .cse10) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse221 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_310 Int)) (or (= .cse221 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int)) (let ((.cse222 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse221 (select (store .cse222 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse221 (select (store .cse222 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))))) (= .cse221 (select (store .cse1 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse221 (select (store (store .cse2 v_arrayElimCell_306 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse223 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse223 (select (store .cse1 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse223 (select (store (store .cse2 v_arrayElimCell_306 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse21) (or .cse11 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse224 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse225 (store .cse2 v_arrayElimCell_306 0))) (or (= .cse224 (select (store .cse225 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse226 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse224 (select (store .cse226 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse224 (select (store .cse226 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))) (= .cse224 (select (store .cse225 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse126 .cse16) (or .cse20 .cse12) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse227 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse228 (store .cse2 v_arrayElimCell_306 0))) (or (= .cse227 (select (store .cse228 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_310 Int)) (or (= .cse227 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int)) (let ((.cse229 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse227 (select (store .cse229 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse227 (select (store .cse229 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))))) (= .cse227 (select (store .cse228 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse69 (or .cse41 .cse12) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse230 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse230 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (= .cse230 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse231 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse231 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_310 Int)) (or (= .cse231 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int)) (let ((.cse232 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse231 (select (store .cse232 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse231 (select (store .cse232 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))))))))) .cse56 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse233 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (or (= .cse233 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse233 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))) (= .cse233 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse234 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse234 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse235 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse234 (select (store .cse235 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse234 (select (store .cse235 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))))))) .cse12))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse236 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse236 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse236 (select (store .cse1 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse236 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse236 (select (store (store .cse2 v_arrayElimCell_306 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse12) (or (and (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse237 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse237 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse237 (select (store .cse1 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1))))) .cse21) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse238 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse238 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse238 (select (store .cse1 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (let ((.cse239 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse238 (select (store .cse239 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse238 (select (store .cse239 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse240 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse240 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (= .cse240 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))) (= .cse240 (select (store .cse1 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)))))) .cse11) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse241 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (or (= .cse241 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse241 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))) (= .cse241 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse241 (select (store .cse1 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_310 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse242 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse242 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse242 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (= .cse242 (select (store .cse1 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1))))) .cse147) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_306 Int) (v_arrayElimCell_305 Int)) (let ((.cse243 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse243 (select (store (store .cse2 v_arrayElimCell_306 0) v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_310 Int)) (or (= .cse243 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int)) (let ((.cse244 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse243 (select (store .cse244 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse243 (select (store .cse244 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))))) (= .cse243 (select (store .cse1 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)))))) .cse12) (or .cse147 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_305 Int)) (let ((.cse245 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_311 Int) (v_arrayElimCell_310 Int)) (or (= .cse245 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (= .cse245 (select (store (store .cse2 v_arrayElimCell_311 0) v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))) (= .cse245 (select (store .cse1 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_305 Int)) (let ((.cse246 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_310 Int)) (or (= .cse246 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_311 Int)) (let ((.cse247 (store .cse2 v_arrayElimCell_311 0))) (or (= .cse246 (select (store .cse247 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse246 (select (store .cse247 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1))))))) (= .cse246 (select (store .cse1 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_305 Int)) (let ((.cse248 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse248 (select (store .cse1 v_arrayElimCell_305 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_310 Int)) (= .cse248 (select (store .cse1 v_arrayElimCell_310 0) v_antiDerIndex_entry0_1)))))) (or .cse168 .cse21))))))))) is different from false [2024-11-08 16:39:43,051 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-08 16:39:43,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990593782] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 16:39:43,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 16:39:43,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 20] total 58 [2024-11-08 16:39:43,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409672788] [2024-11-08 16:39:43,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 16:39:43,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2024-11-08 16:39:43,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 16:39:43,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2024-11-08 16:39:43,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=2711, Unknown=8, NotChecked=540, Total=3422 [2024-11-08 16:39:43,054 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 59 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 59 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 16:39:47,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:39:48,825 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 16:40:19,334 WARN L286 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 531 DAG size of output: 204 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-08 16:40:20,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:40:23,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:40:25,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:40:30,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:40:32,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:40:45,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:40:46,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:40:57,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:41:00,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:41:06,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:41:11,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:41:20,012 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:41:21,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:41:22,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:41:24,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:41:25,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:41:32,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:41:33,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:41:38,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:41:40,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:41:45,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:41:46,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:41:47,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:41:53,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:42:00,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:42:01,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:42:06,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:42:08,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:42:13,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:42:14,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:42:15,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:42:21,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:42:22,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:42:24,308 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:42:26,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:42:27,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:42:29,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:42:31,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:42:32,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:42:34,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:42:35,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:42:39,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:42:42,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:42:43,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:42:49,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-08 16:42:52,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-08 16:42:54,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-08 16:42:56,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-08 16:42:57,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-08 16:42:58,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:43:00,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:43:01,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:43:03,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-08 16:43:04,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-08 16:43:06,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-08 16:43:09,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-08 16:43:11,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:43:13,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:43:14,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:43:16,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:43:17,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:43:21,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:43:23,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:43:26,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:43:27,622 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:43:30,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:43:31,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-08 16:43:33,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-08 16:43:34,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-08 16:43:37,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-08 16:43:39,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-08 16:43:42,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-08 16:43:53,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:43:55,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:43:58,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:44:01,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:44:04,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:44:06,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:44:08,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:44:10,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-08 16:44:11,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 16:44:11,833 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2024-11-08 16:44:11,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-08 16:44:11,833 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 59 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 40 [2024-11-08 16:44:11,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 16:44:11,834 INFO L225 Difference]: With dead ends: 135 [2024-11-08 16:44:11,834 INFO L226 Difference]: Without dead ends: 127 [2024-11-08 16:44:11,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 873 ImplicationChecksByTransitivity, 190.5s TimeCoverageRelationStatistics Valid=320, Invalid=5240, Unknown=10, NotChecked=750, Total=6320 [2024-11-08 16:44:11,835 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 133 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 1916 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 165.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 2461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 530 IncrementalHoareTripleChecker+Unchecked, 166.0s IncrementalHoareTripleChecker+Time [2024-11-08 16:44:11,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1204 Invalid, 2461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1916 Invalid, 0 Unknown, 530 Unchecked, 166.0s Time] [2024-11-08 16:44:11,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-08 16:44:11,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 99. [2024-11-08 16:44:11,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.0816326530612246) internal successors, (106), 98 states have internal predecessors, (106), 0 states have call successors, (0), 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 16:44:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2024-11-08 16:44:11,839 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 40 [2024-11-08 16:44:11,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 16:44:11,839 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2024-11-08 16:44:11,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 1.9482758620689655) internal successors, (113), 59 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 16:44:11,840 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2024-11-08 16:44:11,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-08 16:44:11,841 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 16:44:11,841 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 16:44:11,868 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-08 16:44:12,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:44:12,046 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-11-08 16:44:12,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 16:44:12,049 INFO L85 PathProgramCache]: Analyzing trace with hash -676417805, now seen corresponding path program 1 times [2024-11-08 16:44:12,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 16:44:12,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269459697] [2024-11-08 16:44:12,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:44:12,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 16:44:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:14,394 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:44:14,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 16:44:14,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269459697] [2024-11-08 16:44:14,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269459697] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 16:44:14,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268425848] [2024-11-08 16:44:14,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 16:44:14,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 16:44:14,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 16:44:14,396 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 16:44:14,398 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2e7214f4-d75c-4778-9938-2420dc74e532/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-08 16:44:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 16:44:14,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-08 16:44:14,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 16:44:15,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-08 16:44:15,393 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-08 16:44:15,394 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 62 treesize of output 59 [2024-11-08 16:44:15,736 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-08 16:44:15,736 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 54 treesize of output 45 [2024-11-08 16:44:15,763 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 73 treesize of output 53 [2024-11-08 16:44:16,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 16:44:16,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:44:16,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 69 [2024-11-08 16:44:19,026 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base_59| Int) (|v_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base_59| Int) (|v_ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base_52| Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base_59| 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base_59|) 0) (= (select .cse0 |v_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base_59|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base_52| 0) |v_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base_59| 0) |v_ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base_59| 0)) (= (select (store .cse0 |v_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base_59| 1) |v_ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base_52|) 0)))) is different from true [2024-11-08 16:44:19,045 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 16:44:19,045 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 16:44:20,343 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1848 (Array Int Int))) (= (let ((.cse0 (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1848) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse0 0) 0) (select .cse0 4) 0)) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-08 16:44:20,361 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1848 (Array Int Int))) (= (let ((.cse0 (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1848) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select .cse0 0) 0) (select .cse0 4) 0)) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-08 16:44:20,372 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1848 (Array Int Int)) (v_ArrVal_1847 (Array Int Int))) (= (let ((.cse0 (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1847) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1848) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select .cse0 0) 0) (select .cse0 4) 0)) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-08 16:44:20,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:44:20,382 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 62 treesize of output 55 [2024-11-08 16:44:20,386 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 162 treesize of output 156 [2024-11-08 16:44:20,394 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 304 treesize of output 288 [2024-11-08 16:44:20,419 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 193 treesize of output 185 [2024-11-08 16:44:20,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 16:44:20,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 201 treesize of output 207 [2024-11-08 16:48:49,598 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse4 (= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) 0)) (.cse3 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse39 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (.cse31 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse5 (not .cse4)) (.cse33 (not .cse0)) (.cse1 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (let ((.cse32 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_323 Int)) (let ((.cse209 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse209) (= (select (store (store .cse3 v_arrayElimCell_320 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse209) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse209))))) (.cse83 (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int)) (= (select (store (store .cse3 v_arrayElimCell_320 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) .cse33)) (.cse40 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_323 Int)) (let ((.cse208 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store (store .cse3 v_arrayElimCell_320 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse208) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse208) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse208))))) (.cse67 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (let ((.cse207 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store (store .cse3 v_arrayElimCell_320 0) v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse207) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse207))))) (.cse61 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_321 Int)) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2)))) (.cse74 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (= (select (store (store .cse3 v_arrayElimCell_320 0) v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2)))) (.cse154 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_323 Int)) (let ((.cse206 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse206) (= (select (store (store .cse3 v_arrayElimCell_320 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse206) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse206) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse206))))) (.cse117 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_323 Int)) (let ((.cse204 (store .cse3 v_arrayElimCell_320 0)) (.cse205 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse204 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse205) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse205) (= (select (store .cse204 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse205))))) (.cse121 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_323 Int)) (let ((.cse203 (store .cse3 v_arrayElimCell_320 0)) (.cse202 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse202) (= (select (store .cse203 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse202) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse202) (= (select (store .cse203 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse202))))) (.cse116 (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (let ((.cse200 (store .cse3 v_arrayElimCell_320 0)) (.cse201 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse200 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse201) (= (select (store .cse200 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse201)))) .cse33)) (.cse112 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_321 Int)) (let ((.cse198 (store .cse3 v_arrayElimCell_320 0)) (.cse199 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse198 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse199) (= (select (store .cse198 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse199) (= (select (store (store .cse3 v_arrayElimCell_322 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse199))))) (.cse36 (store .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (.cse30 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse29 (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_326 Int)) (= (select (store .cse1 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) .cse5)) (.cse18 (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int) (v_arrayElimCell_326 Int)) (let ((.cse197 (store .cse3 v_arrayElimCell_322 0)) (.cse196 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse196) (= (select (store .cse1 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) .cse196) (= (select (store .cse197 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse196) (= (select (store .cse197 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse196)))) .cse5)) (.cse6 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_323 Int)) (let ((.cse195 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse195) (forall ((v_arrayElimCell_326 Int)) (= (select (store .cse1 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) .cse195)))))) (.cse9 (or .cse5 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int) (v_arrayElimCell_326 Int)) (let ((.cse194 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse194) (= (select (store .cse1 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) .cse194) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse194)))))) (.cse11 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse41 (not .cse31)) (.cse45 (store .cse39 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0)) (.cse153 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_321 Int)) (let ((.cse193 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store (store .cse3 v_arrayElimCell_320 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse193) (= (select (store (store .cse3 v_arrayElimCell_322 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse193) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse193)))))) (and (or (and (or .cse0 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int) (v_arrayElimCell_325 Int)) (let ((.cse2 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse2) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse2) (= (select (store (store .cse3 v_arrayElimCell_325 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_2) .cse2)))) .cse4) (or .cse0 .cse5 (and .cse6 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_323 Int)) (let ((.cse7 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse7) (forall ((v_arrayElimCell_326 Int) (v_arrayElimCell_325 Int)) (or (= (select (store .cse1 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) .cse7) (= .cse7 (select (store (store .cse3 v_arrayElimCell_325 0) v_arrayElimCell_326 0) v_antiDerIndex_entry0_2))))))))) (or .cse0 (and (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse8 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse8) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse8) (forall ((v_arrayElimCell_326 Int) (v_arrayElimCell_325 Int)) (or (= (select (store .cse1 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) .cse8) (= .cse8 (select (store (store .cse3 v_arrayElimCell_325 0) v_arrayElimCell_326 0) v_antiDerIndex_entry0_2))))))) .cse9 (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int) (v_arrayElimCell_326 Int) (v_arrayElimCell_325 Int)) (let ((.cse10 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse10) (= .cse10 (select (store (store .cse3 v_arrayElimCell_325 0) v_arrayElimCell_326 0) v_antiDerIndex_entry0_2)) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse10)))) .cse4)) .cse11) (or .cse0 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int) (v_arrayElimCell_325 Int)) (let ((.cse13 (store .cse3 v_arrayElimCell_322 0)) (.cse12 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse12) (= (select (store .cse13 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse12) (= (select (store (store .cse3 v_arrayElimCell_325 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_2) .cse12) (= (select (store .cse13 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse12)))) .cse4) (or .cse0 (and (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse15 (store .cse3 v_arrayElimCell_322 0)) (.cse14 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse14) (= (select (store .cse15 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse14) (= (select (store .cse15 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse14) (forall ((v_arrayElimCell_326 Int) (v_arrayElimCell_325 Int)) (or (= (select (store .cse1 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) .cse14) (= .cse14 (select (store (store .cse3 v_arrayElimCell_325 0) v_arrayElimCell_326 0) v_antiDerIndex_entry0_2))))))) (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int) (v_arrayElimCell_326 Int) (v_arrayElimCell_325 Int)) (let ((.cse17 (store .cse3 v_arrayElimCell_322 0)) (.cse16 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse16) (= .cse16 (select (store (store .cse3 v_arrayElimCell_325 0) v_arrayElimCell_326 0) v_antiDerIndex_entry0_2)) (= (select (store .cse17 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse16) (= (select (store .cse17 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse16)))) .cse4) .cse18) .cse11) (or (and (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int) (v_arrayElimCell_325 Int)) (let ((.cse19 (store .cse3 v_arrayElimCell_322 0)) (.cse20 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse19 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse20) (= (select (store (store .cse3 v_arrayElimCell_325 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_2) .cse20) (= (select (store .cse19 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse20)))) .cse0) (or .cse0 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int) (v_arrayElimCell_325 Int)) (let ((.cse21 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse21) (= (select (store (store .cse3 v_arrayElimCell_325 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_2) .cse21))))) (or (and (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse22 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (forall ((v_arrayElimCell_326 Int) (v_arrayElimCell_325 Int)) (= .cse22 (select (store (store .cse3 v_arrayElimCell_325 0) v_arrayElimCell_326 0) v_antiDerIndex_entry0_2))) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse22)))) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse23 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse23) (forall ((v_arrayElimCell_326 Int) (v_arrayElimCell_325 Int)) (or (= (select (store .cse1 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) .cse23) (= .cse23 (select (store (store .cse3 v_arrayElimCell_325 0) v_arrayElimCell_326 0) v_antiDerIndex_entry0_2)))))))) .cse0 .cse11) (or .cse0 (and (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse24 (store .cse3 v_arrayElimCell_322 0)) (.cse25 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse24 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse25) (= (select (store .cse24 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse25) (forall ((v_arrayElimCell_326 Int) (v_arrayElimCell_325 Int)) (or (= (select (store .cse1 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) .cse25) (= .cse25 (select (store (store .cse3 v_arrayElimCell_325 0) v_arrayElimCell_326 0) v_antiDerIndex_entry0_2))))))) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse27 (store .cse3 v_arrayElimCell_322 0)) (.cse26 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (forall ((v_arrayElimCell_326 Int) (v_arrayElimCell_325 Int)) (= .cse26 (select (store (store .cse3 v_arrayElimCell_325 0) v_arrayElimCell_326 0) v_antiDerIndex_entry0_2))) (= (select (store .cse27 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse26) (= (select (store .cse27 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse26))))) .cse11)) .cse4) (or (and (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_325 Int)) (= (select (store (store .cse3 v_arrayElimCell_325 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_2) (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) .cse0 .cse4) (or .cse0 (and (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_326 Int) (v_arrayElimCell_325 Int)) (let ((.cse28 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) .cse28) (= .cse28 (select (store (store .cse3 v_arrayElimCell_325 0) v_arrayElimCell_326 0) v_antiDerIndex_entry0_2))))) .cse29 (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_326 Int) (v_arrayElimCell_325 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2) (select (store (store .cse3 v_arrayElimCell_325 0) v_arrayElimCell_326 0) v_antiDerIndex_entry0_2))) .cse4)) .cse11)) .cse30)) .cse31) (or .cse5 (and (or .cse32 .cse33) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_323 Int)) (let ((.cse35 (store .cse3 v_arrayElimCell_320 0)) (.cse34 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse34) (= (select (store .cse35 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse34) (= (select (store .cse35 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse34) (= (select .cse36 v_antiDerIndex_entry0_2) .cse34) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse34)))))) (or (and (or (and (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_323 Int)) (let ((.cse37 (store .cse3 v_arrayElimCell_320 0)) (.cse38 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse37 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse38) (= (select .cse39 v_antiDerIndex_entry0_2) .cse38) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse38) (= (select (store .cse37 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse38) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse38)))) (or .cse40 .cse33)) .cse31) (or .cse41 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_323 Int)) (let ((.cse42 (store .cse3 v_arrayElimCell_320 0)) (.cse44 (store .cse3 v_arrayElimCell_322 0)) (.cse43 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse42 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse43) (= (select (store .cse44 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse43) (= (select (store .cse42 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse43) (= (select (store .cse44 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse43) (= (select .cse45 v_antiDerIndex_entry0_2) .cse43) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse43))))) (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_323 Int)) (let ((.cse47 (store .cse3 v_arrayElimCell_322 0)) (.cse46 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store (store .cse3 v_arrayElimCell_320 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse46) (= (select (store .cse47 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse46) (= (select (store .cse47 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse46) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse46)))) .cse33) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_323 Int)) (let ((.cse48 (store .cse3 v_arrayElimCell_320 0)) (.cse50 (store .cse3 v_arrayElimCell_322 0)) (.cse49 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse48 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse49) (= (select .cse39 v_antiDerIndex_entry0_2) .cse49) (= (select (store .cse50 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse49) (= (select (store .cse48 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse49) (= (select (store .cse50 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse49) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse49))))) .cse4) (or (and (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (let ((.cse51 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store (store .cse3 v_arrayElimCell_320 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse51) (= (select .cse36 v_antiDerIndex_entry0_2) .cse51) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse51) (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse51))))) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (let ((.cse52 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store (store .cse3 v_arrayElimCell_320 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse52) (forall ((v_arrayElimCell_323 Int)) (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse52)) (= (select .cse36 v_antiDerIndex_entry0_2) .cse52) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse52)))) (or .cse33 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (let ((.cse53 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store (store .cse3 v_arrayElimCell_320 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse53) (= (select .cse36 v_antiDerIndex_entry0_2) .cse53) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse53))))) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (let ((.cse54 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store (store .cse3 v_arrayElimCell_320 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse54) (forall ((v_arrayElimCell_323 Int)) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse54) (forall ((v_arrayElimCell_322 Int)) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse54)))) (= (select .cse36 v_antiDerIndex_entry0_2) .cse54) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse54))))) .cse5) (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_323 Int)) (let ((.cse56 (store .cse3 v_arrayElimCell_320 0)) (.cse55 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse55) (= (select (store .cse56 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse55) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse55) (= (select (store .cse56 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse55) (= (select .cse45 v_antiDerIndex_entry0_2) .cse55) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse55)))) .cse41) (or (let ((.cse68 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (let ((.cse80 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store (store .cse3 v_arrayElimCell_320 0) v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse80) (= (select .cse36 v_antiDerIndex_entry0_2) .cse80) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse80)))))) (and (or .cse5 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_323 Int)) (let ((.cse57 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse57) (= (select .cse39 v_antiDerIndex_entry0_2) .cse57) (= (select (store (store .cse3 v_arrayElimCell_320 0) v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse57) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse57))))) (or .cse5 (and (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_321 Int)) (let ((.cse58 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (forall ((v_arrayElimCell_323 Int)) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse58) (forall ((v_arrayElimCell_322 Int)) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse58)))) (= (select .cse36 v_antiDerIndex_entry0_2) .cse58) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse58)))) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_321 Int)) (let ((.cse59 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (forall ((v_arrayElimCell_323 Int)) (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse59)) (= (select .cse36 v_antiDerIndex_entry0_2) .cse59) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse59)))) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_321 Int)) (let ((.cse60 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select .cse36 v_antiDerIndex_entry0_2) .cse60) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse60) (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse60))))) (or .cse61 .cse33) (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_321 Int)) (let ((.cse62 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select .cse36 v_antiDerIndex_entry0_2) .cse62) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse62)))) .cse33))) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_323 Int)) (let ((.cse63 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse63) (= (select .cse39 v_antiDerIndex_entry0_2) .cse63) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse63) (= (select (store (store .cse3 v_arrayElimCell_320 0) v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse63) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse63)))) (or (and (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (let ((.cse64 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select .cse39 v_antiDerIndex_entry0_2) .cse64) (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse65 (store .cse3 v_arrayElimCell_322 0))) (or (= (select (store .cse65 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse64) (= (select (store .cse65 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse64)))) (= (select (store (store .cse3 v_arrayElimCell_320 0) v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse64) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse64)))) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (let ((.cse66 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select .cse39 v_antiDerIndex_entry0_2) .cse66) (= (select (store (store .cse3 v_arrayElimCell_320 0) v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse66) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse66) (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse66)))))) .cse4) (or .cse67 .cse33) (or (and .cse68 (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (let ((.cse69 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select .cse39 v_antiDerIndex_entry0_2) .cse69) (= (select (store (store .cse3 v_arrayElimCell_320 0) v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse69) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse69)))) .cse4)) .cse33) (or (and (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (let ((.cse70 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select .cse39 v_antiDerIndex_entry0_2) .cse70) (= (select (store (store .cse3 v_arrayElimCell_320 0) v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse70) (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse70))))) (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (let ((.cse71 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select .cse39 v_antiDerIndex_entry0_2) .cse71) (= (select (store (store .cse3 v_arrayElimCell_320 0) v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse71)))) .cse33) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (let ((.cse72 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select .cse39 v_antiDerIndex_entry0_2) .cse72) (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse73 (store .cse3 v_arrayElimCell_322 0))) (or (= (select (store .cse73 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse72) (= (select (store .cse73 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse72)))) (= (select (store (store .cse3 v_arrayElimCell_320 0) v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse72)))) (or .cse74 .cse33) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (let ((.cse75 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select .cse39 v_antiDerIndex_entry0_2) .cse75) (forall ((v_arrayElimCell_323 Int)) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse75) (forall ((v_arrayElimCell_322 Int)) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse75)))) (= (select (store (store .cse3 v_arrayElimCell_320 0) v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse75)))) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (let ((.cse76 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse76) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse76))) (= (select .cse39 v_antiDerIndex_entry0_2) .cse76) (= (select (store (store .cse3 v_arrayElimCell_320 0) v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse76))))) .cse4) (or (and (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (let ((.cse77 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse77) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse77))) (= (select (store (store .cse3 v_arrayElimCell_320 0) v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse77) (= (select .cse36 v_antiDerIndex_entry0_2) .cse77) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse77)))) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (let ((.cse78 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (forall ((v_arrayElimCell_323 Int)) (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse78)) (= (select (store (store .cse3 v_arrayElimCell_320 0) v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse78) (= (select .cse36 v_antiDerIndex_entry0_2) .cse78) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse78)))) (or .cse68 .cse33) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (let ((.cse79 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (forall ((v_arrayElimCell_323 Int)) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse79) (forall ((v_arrayElimCell_322 Int)) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse79)))) (= (select (store (store .cse3 v_arrayElimCell_320 0) v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse79) (= (select .cse36 v_antiDerIndex_entry0_2) .cse79) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse79))))) .cse5))) .cse31) (or .cse41 (and (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int)) (let ((.cse81 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store (store .cse3 v_arrayElimCell_320 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse81) (forall ((v_arrayElimCell_322 Int)) (= (select (store (store .cse3 v_arrayElimCell_322 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse81)) (= (select .cse45 v_antiDerIndex_entry0_2) .cse81)))) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int)) (let ((.cse82 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store (store .cse3 v_arrayElimCell_320 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse82) (= (select .cse45 v_antiDerIndex_entry0_2) .cse82) (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse82))))) .cse83 (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int)) (let ((.cse84 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store (store .cse3 v_arrayElimCell_320 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse84) (= (select .cse45 v_antiDerIndex_entry0_2) .cse84)))) .cse33) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int)) (let ((.cse85 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store (store .cse3 v_arrayElimCell_320 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse85) (forall ((v_arrayElimCell_323 Int)) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse85) (forall ((v_arrayElimCell_322 Int)) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse85)))) (= (select .cse45 v_antiDerIndex_entry0_2) .cse85)))))) (or .cse0 (let ((.cse92 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse109 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse109) (= (select .cse39 v_antiDerIndex_entry0_2) .cse109) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse109))))) (.cse90 (forall ((v_antiDerIndex_entry0_2 Int)) (let ((.cse108 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select .cse39 v_antiDerIndex_entry0_2) .cse108) (= (select .cse36 v_antiDerIndex_entry0_2) .cse108))))) (.cse87 (forall ((v_antiDerIndex_entry0_2 Int)) (let ((.cse106 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select .cse39 v_antiDerIndex_entry0_2) .cse106) (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse107 (store .cse3 v_arrayElimCell_322 0))) (or (= (select (store .cse107 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse106) (= (select (store .cse107 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse106)))))))) (.cse93 (forall ((v_antiDerIndex_entry0_2 Int)) (= (select .cse36 v_antiDerIndex_entry0_2) (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))))) (and (forall ((v_antiDerIndex_entry0_2 Int)) (let ((.cse86 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select .cse39 v_antiDerIndex_entry0_2) .cse86) (forall ((v_arrayElimCell_323 Int)) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse86) (forall ((v_arrayElimCell_322 Int)) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse86))))))) (or (and .cse87 (or .cse31 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse88 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select .cse39 v_antiDerIndex_entry0_2) .cse88) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse88) (= (select .cse45 v_antiDerIndex_entry0_2) .cse88))))) (or .cse30 (forall ((v_antiDerIndex_entry0_2 Int)) (let ((.cse89 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select .cse39 v_antiDerIndex_entry0_2) .cse89) (= (select .cse45 v_antiDerIndex_entry0_2) .cse89)))))) .cse4) (or .cse30 .cse90) (or (and .cse87 (or .cse31 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse91 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select .cse39 v_antiDerIndex_entry0_2) .cse91) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse91) (= (select .cse36 v_antiDerIndex_entry0_2) .cse91)))))) .cse4) (or .cse92 .cse31) (or (and .cse92 (or .cse30 (and (or (forall ((v_antiDerIndex_entry0_2 Int)) (= (select .cse39 v_antiDerIndex_entry0_2) (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) .cse4) .cse90 (or .cse93 .cse5))) (or (and .cse87 (forall ((v_antiDerIndex_entry0_2 Int)) (let ((.cse94 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select .cse39 v_antiDerIndex_entry0_2) .cse94) (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse94)))))) .cse4) (or .cse5 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_323 Int)) (let ((.cse95 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse95) (= (select .cse36 v_antiDerIndex_entry0_2) .cse95))))) (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse96 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse96) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse96) (= (select .cse36 v_antiDerIndex_entry0_2) .cse96)))) .cse5)) .cse31) (or (and (or .cse93 .cse30) (forall ((v_antiDerIndex_entry0_2 Int)) (let ((.cse97 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (forall ((v_arrayElimCell_323 Int)) (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse97)) (= (select .cse36 v_antiDerIndex_entry0_2) .cse97)))) (forall ((v_antiDerIndex_entry0_2 Int)) (let ((.cse98 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (forall ((v_arrayElimCell_323 Int)) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse98) (forall ((v_arrayElimCell_322 Int)) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse98)))) (= (select .cse36 v_antiDerIndex_entry0_2) .cse98)))) (forall ((v_antiDerIndex_entry0_2 Int)) (let ((.cse99 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse99) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse99))) (= (select .cse36 v_antiDerIndex_entry0_2) .cse99))))) .cse5) (or .cse41 (and (or (forall ((v_antiDerIndex_entry0_2 Int)) (= (select .cse45 v_antiDerIndex_entry0_2) (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) .cse30) (forall ((v_antiDerIndex_entry0_2 Int)) (let ((.cse101 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse100 (store .cse3 v_arrayElimCell_322 0))) (or (= (select (store .cse100 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse101) (= (select (store .cse100 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse101)))) (= (select .cse45 v_antiDerIndex_entry0_2) .cse101)))) (forall ((v_antiDerIndex_entry0_2 Int)) (let ((.cse102 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (forall ((v_arrayElimCell_322 Int)) (= (select (store (store .cse3 v_arrayElimCell_322 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse102)) (= (select .cse45 v_antiDerIndex_entry0_2) .cse102)))) (forall ((v_antiDerIndex_entry0_2 Int)) (let ((.cse103 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (forall ((v_arrayElimCell_323 Int)) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse103) (forall ((v_arrayElimCell_322 Int)) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse103)))) (= (select .cse45 v_antiDerIndex_entry0_2) .cse103)))))) (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_323 Int)) (let ((.cse104 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse104) (= (select .cse39 v_antiDerIndex_entry0_2) .cse104)))) .cse5) (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int)) (let ((.cse105 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select .cse39 v_antiDerIndex_entry0_2) .cse105) (= (select (store (store .cse3 v_arrayElimCell_322 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse105)))) .cse41)))) (or (not .cse30) (and (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (let ((.cse110 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store (store .cse3 v_arrayElimCell_320 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse110) (forall ((v_arrayElimCell_323 Int)) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse110) (forall ((v_arrayElimCell_322 Int)) (let ((.cse111 (store .cse3 v_arrayElimCell_322 0))) (or (= (select (store .cse111 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse110) (= (select (store .cse111 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse110)))))) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse110)))) (or (and (or .cse41 .cse112) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (let ((.cse113 (store .cse3 v_arrayElimCell_320 0)) (.cse114 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse113 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse114) (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse115 (store .cse3 v_arrayElimCell_322 0))) (or (= (select (store .cse115 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse114) (= (select (store .cse115 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse114)))) (= (select (store .cse113 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse114)))) .cse116 (or .cse31 .cse117) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (let ((.cse118 (store .cse3 v_arrayElimCell_320 0)) (.cse119 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse118 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse119) (= (select (store .cse118 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse119) (forall ((v_arrayElimCell_323 Int)) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse119) (forall ((v_arrayElimCell_322 Int)) (let ((.cse120 (store .cse3 v_arrayElimCell_322 0))) (or (= (select (store .cse120 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse119) (= (select (store .cse120 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse119))))))))) (or .cse121 .cse31)) .cse4) (or .cse32 .cse5) (or .cse41 (and (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int)) (let ((.cse122 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store (store .cse3 v_arrayElimCell_320 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse122) (forall ((v_arrayElimCell_323 Int)) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse122) (forall ((v_arrayElimCell_322 Int)) (let ((.cse123 (store .cse3 v_arrayElimCell_322 0))) (or (= (select (store .cse123 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse122) (= (select (store .cse123 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse122))))))))) .cse83 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int)) (let ((.cse124 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store (store .cse3 v_arrayElimCell_320 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse124) (forall ((v_arrayElimCell_322 Int)) (= (select (store (store .cse3 v_arrayElimCell_322 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse124))))) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int)) (let ((.cse125 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store (store .cse3 v_arrayElimCell_320 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse125) (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse126 (store .cse3 v_arrayElimCell_322 0))) (or (= (select (store .cse126 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse125) (= (select (store .cse126 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse125))))))))) (or (and (or .cse40 .cse31) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (let ((.cse127 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store (store .cse3 v_arrayElimCell_320 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse127) (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse128 (store .cse3 v_arrayElimCell_322 0))) (or (= (select (store .cse128 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse127) (= (select (store .cse128 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse127)))) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse127))))) .cse4) (or .cse0 (and (or .cse5 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_323 Int)) (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2)))) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_323 Int)) (let ((.cse129 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse129) (forall ((v_arrayElimCell_322 Int)) (let ((.cse130 (store .cse3 v_arrayElimCell_322 0))) (or (= (select (store .cse130 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse129) (= (select (store .cse130 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse129))))))) (or (and (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse131 (store .cse3 v_arrayElimCell_322 0)) (.cse132 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse131 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse132) (= (select (store .cse131 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse132)))) (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) .cse31)) .cse4) (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse133 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse133) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse133)))) .cse31) (or .cse41 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int)) (= (select (store (store .cse3 v_arrayElimCell_322 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2)))))) (or (and (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (let ((.cse134 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store (store .cse3 v_arrayElimCell_320 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse134) (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse134) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse134))) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse134)))) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (let ((.cse135 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store (store .cse3 v_arrayElimCell_320 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse135) (forall ((v_arrayElimCell_323 Int)) (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse135)) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse135))))) .cse5) (or (and (or (and (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse136 (store .cse3 v_arrayElimCell_322 0)) (.cse137 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse136 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse137) (forall ((v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (= (select (store (store .cse3 v_arrayElimCell_320 0) v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse137)) (= (select (store .cse136 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse137)))) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse138 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse138) (forall ((v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (= (select (store (store .cse3 v_arrayElimCell_320 0) v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse138))))) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse140 (store .cse3 v_arrayElimCell_322 0)) (.cse139 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (forall ((v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (or (= (select (store (store .cse3 v_arrayElimCell_320 0) v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse139) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse139))) (= (select (store .cse140 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse139) (= (select (store .cse140 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse139)))) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse141 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (forall ((v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (or (= (select (store (store .cse3 v_arrayElimCell_320 0) v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse141) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse141))) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse141))))) .cse4) (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_323 Int)) (let ((.cse143 (store .cse3 v_arrayElimCell_322 0)) (.cse142 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse142) (= (select (store .cse143 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse142) (= (select (store (store .cse3 v_arrayElimCell_320 0) v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse142) (= (select (store .cse143 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse142)))) .cse4) (or .cse5 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_323 Int)) (let ((.cse145 (store .cse3 v_arrayElimCell_322 0)) (.cse144 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse144) (= (select (store .cse145 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse144) (= (select (store .cse145 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse144) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse144))))) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse146 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse146) (forall ((v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (or (= (select (store (store .cse3 v_arrayElimCell_320 0) v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse146) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse146))) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse146)))) (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_323 Int)) (let ((.cse147 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse147) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse147) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse147)))) .cse5) (or (and .cse67 (or .cse61 .cse5) (or .cse74 .cse4)) .cse33) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse149 (store .cse3 v_arrayElimCell_322 0)) (.cse148 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse148) (forall ((v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (or (= (select (store (store .cse3 v_arrayElimCell_320 0) v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse148) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse148))) (= (select (store .cse149 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse148) (= (select (store .cse149 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse148)))) (or .cse5 (and (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_323 Int)) (let ((.cse150 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse150) (forall ((v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (or (= (select (store (store .cse3 v_arrayElimCell_320 0) v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse150) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse150)))))) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_323 Int)) (let ((.cse151 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse151) (forall ((v_arrayElimCell_321 Int)) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse151))))))) (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_323 Int)) (let ((.cse152 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse152) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse152) (= (select (store (store .cse3 v_arrayElimCell_320 0) v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse152)))) .cse4)) .cse31) (or .cse41 .cse153) (or .cse154 .cse31))) (or .cse154 .cse33) (or (and (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_323 Int)) (let ((.cse155 (store .cse3 v_arrayElimCell_320 0)) (.cse157 (store .cse3 v_arrayElimCell_322 0)) (.cse156 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse155 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse156) (= (select (store .cse157 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse156) (= (select (store .cse155 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse156) (= (select (store .cse157 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse156) (= (select .cse45 v_antiDerIndex_entry0_2) .cse156)))) .cse41) (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_323 Int)) (let ((.cse159 (store .cse3 v_arrayElimCell_320 0)) (.cse158 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse158) (= (select (store .cse159 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse158) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse158) (= (select (store .cse159 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse158) (= (select .cse45 v_antiDerIndex_entry0_2) .cse158)))) .cse41) (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_323 Int)) (let ((.cse160 (store .cse3 v_arrayElimCell_320 0)) (.cse162 (store .cse3 v_arrayElimCell_322 0)) (.cse161 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse160 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse161) (= (select (store .cse162 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse161) (= (select (store .cse160 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse161) (= (select (store .cse162 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse161)))) .cse33) (or .cse31 (and (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_323 Int)) (let ((.cse163 (store .cse3 v_arrayElimCell_320 0)) (.cse164 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse163 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse164) (= (select .cse39 v_antiDerIndex_entry0_2) .cse164) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse164) (= (select (store .cse163 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse164)))) (or .cse117 .cse33))) (or .cse121 .cse33) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_323 Int)) (let ((.cse165 (store .cse3 v_arrayElimCell_320 0)) (.cse167 (store .cse3 v_arrayElimCell_322 0)) (.cse166 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse165 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse166) (= (select .cse39 v_antiDerIndex_entry0_2) .cse166) (= (select (store .cse167 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse166) (= (select (store .cse165 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse166) (= (select (store .cse167 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse166)))) .cse116 (or (and (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_321 Int)) (let ((.cse168 (store .cse3 v_arrayElimCell_320 0)) (.cse169 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse168 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse169) (= (select (store .cse168 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse169) (= (select (store (store .cse3 v_arrayElimCell_322 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse169) (= (select .cse45 v_antiDerIndex_entry0_2) .cse169)))) (or .cse112 .cse33)) .cse41) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_323 Int)) (let ((.cse171 (store .cse3 v_arrayElimCell_320 0)) (.cse170 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse170) (= (select (store .cse171 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse170) (= (select .cse39 v_antiDerIndex_entry0_2) .cse170) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse170) (= (select (store .cse171 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse170))))) .cse4) (or .cse5 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_323 Int)) (let ((.cse173 (store .cse3 v_arrayElimCell_320 0)) (.cse172 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse172) (= (select (store .cse173 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse172) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse172) (= (select (store .cse173 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse172) (= (select .cse36 v_antiDerIndex_entry0_2) .cse172) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse172))))) (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_321 Int)) (let ((.cse174 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store (store .cse3 v_arrayElimCell_320 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse174) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse174)))) .cse33) (or (and (or .cse30 (and (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_326 Int)) (= (select (store .cse39 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) .cse4) .cse29 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_326 Int)) (let ((.cse175 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse39 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) .cse175) (= (select (store .cse1 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) .cse175)))))) .cse18 (or (and .cse6 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_323 Int)) (let ((.cse176 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse176) (forall ((v_arrayElimCell_326 Int)) (or (= (select (store .cse39 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) .cse176) (= (select (store .cse1 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) .cse176))))))) .cse5) .cse9 (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse177 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse177) (forall ((v_arrayElimCell_326 Int)) (or (= (select (store .cse39 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) .cse177) (= (select (store .cse1 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) .cse177))) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse177)))) (or (and (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_326 Int)) (let ((.cse178 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse39 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) .cse178) (= (select (store .cse1 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) .cse178) (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse179 (store .cse3 v_arrayElimCell_322 0))) (or (= (select (store .cse179 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse178) (= (select (store .cse179 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse178))))))) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_326 Int)) (let ((.cse180 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse39 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) .cse180) (= (select (store .cse1 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) .cse180) (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse180))))) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_326 Int)) (let ((.cse181 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse39 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) .cse181) (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse182 (store .cse3 v_arrayElimCell_322 0))) (or (= (select (store .cse182 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse181) (= (select (store .cse182 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse181))))))) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_326 Int)) (let ((.cse183 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse39 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) .cse183) (forall ((v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse183)))))) .cse4) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int)) (let ((.cse185 (store .cse3 v_arrayElimCell_322 0)) (.cse184 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse184) (forall ((v_arrayElimCell_326 Int)) (or (= (select (store .cse39 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) .cse184) (= (select (store .cse1 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) .cse184))) (= (select (store .cse185 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse184) (= (select (store .cse185 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse184)))) (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int) (v_arrayElimCell_326 Int)) (let ((.cse187 (store .cse3 v_arrayElimCell_322 0)) (.cse186 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse39 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) .cse186) (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse186) (= (select (store .cse187 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse186) (= (select (store .cse187 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse186)))) .cse4) (or (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_323 Int) (v_arrayElimCell_326 Int)) (let ((.cse188 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse39 v_arrayElimCell_326 0) v_antiDerIndex_entry0_2) .cse188) (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse188) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse188)))) .cse4)) .cse0 .cse31 .cse11) (or .cse41 (and (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_321 Int)) (let ((.cse189 (store .cse3 v_arrayElimCell_320 0)) (.cse190 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse189 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse190) (= (select (store .cse189 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse190) (= (select (store (store .cse3 v_arrayElimCell_322 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse190) (= (select .cse45 v_antiDerIndex_entry0_2) .cse190) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse190)))) (or .cse153 .cse33))) (forall ((v_antiDerIndex_entry0_2 Int) (v_arrayElimCell_320 Int) (v_arrayElimCell_322 Int) (v_arrayElimCell_321 Int) (v_arrayElimCell_323 Int)) (let ((.cse192 (store .cse3 v_arrayElimCell_320 0)) (.cse191 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_2))) (or (= (select (store .cse1 v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse191) (= (select (store .cse192 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_2) .cse191) (= (select .cse39 v_antiDerIndex_entry0_2) .cse191) (= (select (store (store .cse3 v_arrayElimCell_322 0) v_arrayElimCell_323 0) v_antiDerIndex_entry0_2) .cse191) (= (select (store .cse192 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse191) (= (select (store .cse1 v_arrayElimCell_321 0) v_antiDerIndex_entry0_2) .cse191)))))))) is different from false