./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --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 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 22:22:41,133 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 22:22:41,171 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-01-09 22:22:41,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 22:22:41,175 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 22:22:41,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 22:22:41,199 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 22:22:41,201 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 22:22:41,201 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 22:22:41,201 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 22:22:41,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 22:22:41,202 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 22:22:41,202 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 22:22:41,202 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 22:22:41,203 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 22:22:41,203 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 22:22:41,203 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 22:22:41,203 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 22:22:41,203 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 22:22:41,203 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 22:22:41,203 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-01-09 22:22:41,203 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-01-09 22:22:41,203 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-01-09 22:22:41,204 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 22:22:41,204 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 22:22:41,204 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 22:22:41,204 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 22:22:41,204 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 22:22:41,204 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 22:22:41,204 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 22:22:41,204 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:22:41,204 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:22:41,204 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:22:41,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:22:41,205 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 22:22:41,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 22:22:41,205 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 22:22:41,205 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 22:22:41,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:22:41,205 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 22:22:41,205 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 22:22:41,205 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 22:22:41,205 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 22:22:41,205 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 22:22:41,205 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 22:22:41,205 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 22:22:41,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 22:22:41,206 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux 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 -> 7408f3b7e084094987873e007e2bbb0a022372240d1ad946af6301d3e9707406 [2025-01-09 22:22:41,415 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 22:22:41,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 22:22:41,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 22:22:41,426 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 22:22:41,426 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 22:22:41,426 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2025-01-09 22:22:42,570 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c11765e22/b2bda009331f41f59e295c2c09ebb401/FLAGabf868a93 [2025-01-09 22:22:42,880 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 22:22:42,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2025-01-09 22:22:42,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c11765e22/b2bda009331f41f59e295c2c09ebb401/FLAGabf868a93 [2025-01-09 22:22:42,905 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c11765e22/b2bda009331f41f59e295c2c09ebb401 [2025-01-09 22:22:42,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 22:22:42,909 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 22:22:42,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 22:22:42,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 22:22:42,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 22:22:42,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:22:42" (1/1) ... [2025-01-09 22:22:42,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@272ed11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:42, skipping insertion in model container [2025-01-09 22:22:42,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:22:42" (1/1) ... [2025-01-09 22:22:42,934 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 22:22:43,097 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-01-09 22:22:43,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:22:43,119 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 22:22:43,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 22:22:43,187 INFO L204 MainTranslator]: Completed translation [2025-01-09 22:22:43,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:43 WrapperNode [2025-01-09 22:22:43,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 22:22:43,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 22:22:43,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 22:22:43,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 22:22:43,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:43" (1/1) ... [2025-01-09 22:22:43,199 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:43" (1/1) ... [2025-01-09 22:22:43,210 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 115 [2025-01-09 22:22:43,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 22:22:43,211 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 22:22:43,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 22:22:43,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 22:22:43,217 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:43" (1/1) ... [2025-01-09 22:22:43,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:43" (1/1) ... [2025-01-09 22:22:43,219 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:43" (1/1) ... [2025-01-09 22:22:43,231 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 11, 8]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 8 writes are split as follows [0, 6, 2]. [2025-01-09 22:22:43,232 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:43" (1/1) ... [2025-01-09 22:22:43,232 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:43" (1/1) ... [2025-01-09 22:22:43,236 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:43" (1/1) ... [2025-01-09 22:22:43,237 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:43" (1/1) ... [2025-01-09 22:22:43,238 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:43" (1/1) ... [2025-01-09 22:22:43,239 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:43" (1/1) ... [2025-01-09 22:22:43,240 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:43" (1/1) ... [2025-01-09 22:22:43,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 22:22:43,242 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 22:22:43,242 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 22:22:43,242 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 22:22:43,242 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:43" (1/1) ... [2025-01-09 22:22:43,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 22:22:43,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:22:43,264 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 22:22:43,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 22:22:43,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 22:22:43,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 22:22:43,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 22:22:43,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 22:22:43,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 22:22:43,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 22:22:43,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 22:22:43,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 22:22:43,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 22:22:43,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 22:22:43,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 22:22:43,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 22:22:43,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 22:22:43,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 22:22:43,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 22:22:43,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 22:22:43,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 22:22:43,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 22:22:43,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 22:22:43,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 22:22:43,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 22:22:43,348 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 22:22:43,349 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 22:22:43,539 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-01-09 22:22:43,539 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 22:22:43,546 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 22:22:43,546 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 22:22:43,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:22:43 BoogieIcfgContainer [2025-01-09 22:22:43,546 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 22:22:43,548 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 22:22:43,548 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 22:22:43,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 22:22:43,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:22:42" (1/3) ... [2025-01-09 22:22:43,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35aa70b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:22:43, skipping insertion in model container [2025-01-09 22:22:43,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:22:43" (2/3) ... [2025-01-09 22:22:43,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35aa70b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:22:43, skipping insertion in model container [2025-01-09 22:22:43,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:22:43" (3/3) ... [2025-01-09 22:22:43,553 INFO L128 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2025-01-09 22:22:43,562 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 22:22:43,563 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG optional_data_creation_test04-1.i that has 1 procedures, 100 locations, 1 initial locations, 3 loop locations, and 46 error locations. [2025-01-09 22:22:43,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 22:22:43,600 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;@26657dde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 22:22:43,601 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-01-09 22:22:43,603 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 53 states have (on average 2.0377358490566038) internal successors, (108), 99 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:43,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:22:43,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:43,607 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:22:43,607 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:43,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:43,611 INFO L85 PathProgramCache]: Analyzing trace with hash 927656, now seen corresponding path program 1 times [2025-01-09 22:22:43,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:43,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980348128] [2025-01-09 22:22:43,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:43,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:43,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:22:43,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:22:43,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:43,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:43,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:43,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:43,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980348128] [2025-01-09 22:22:43,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980348128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:43,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:43,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:22:43,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718993072] [2025-01-09 22:22:43,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:43,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 22:22:43,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:43,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 22:22:43,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:22:43,730 INFO L87 Difference]: Start difference. First operand has 100 states, 53 states have (on average 2.0377358490566038) internal successors, (108), 99 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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) [2025-01-09 22:22:43,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:43,742 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2025-01-09 22:22:43,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 22:22:43,743 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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 [2025-01-09 22:22:43,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:43,747 INFO L225 Difference]: With dead ends: 100 [2025-01-09 22:22:43,747 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 22:22:43,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 22:22:43,752 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:43,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:22:43,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 22:22:43,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-01-09 22:22:43,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 52 states have (on average 2.0) internal successors, (104), 97 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) [2025-01-09 22:22:43,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2025-01-09 22:22:43,784 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 4 [2025-01-09 22:22:43,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:43,785 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2025-01-09 22:22:43,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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) [2025-01-09 22:22:43,785 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2025-01-09 22:22:43,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:22:43,785 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:43,785 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:22:43,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 22:22:43,786 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:43,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:43,787 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2025-01-09 22:22:43,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:43,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014332351] [2025-01-09 22:22:43,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:43,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:43,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:22:43,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:22:43,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:43,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:43,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:43,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014332351] [2025-01-09 22:22:43,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014332351] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:43,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:43,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:22:43,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129051737] [2025-01-09 22:22:43,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:43,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:22:43,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:43,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:22:43,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:22:43,910 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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) [2025-01-09 22:22:44,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:44,040 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2025-01-09 22:22:44,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:22:44,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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 [2025-01-09 22:22:44,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:44,041 INFO L225 Difference]: With dead ends: 101 [2025-01-09 22:22:44,042 INFO L226 Difference]: Without dead ends: 101 [2025-01-09 22:22:44,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:22:44,043 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 115 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:44,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 89 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:22:44,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-01-09 22:22:44,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2025-01-09 22:22:44,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 94 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) [2025-01-09 22:22:44,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2025-01-09 22:22:44,050 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 4 [2025-01-09 22:22:44,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:44,050 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2025-01-09 22:22:44,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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) [2025-01-09 22:22:44,050 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2025-01-09 22:22:44,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-01-09 22:22:44,050 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:44,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-01-09 22:22:44,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 22:22:44,051 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:44,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:44,051 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2025-01-09 22:22:44,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:44,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095705134] [2025-01-09 22:22:44,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:44,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:44,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-09 22:22:44,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-09 22:22:44,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:44,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:44,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:44,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:44,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095705134] [2025-01-09 22:22:44,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095705134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:44,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:44,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:22:44,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440307548] [2025-01-09 22:22:44,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:44,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:22:44,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:44,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:22:44,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:22:44,228 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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) [2025-01-09 22:22:44,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:44,345 INFO L93 Difference]: Finished difference Result 134 states and 144 transitions. [2025-01-09 22:22:44,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:22:44,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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 [2025-01-09 22:22:44,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:44,346 INFO L225 Difference]: With dead ends: 134 [2025-01-09 22:22:44,347 INFO L226 Difference]: Without dead ends: 134 [2025-01-09 22:22:44,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:22:44,348 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 112 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:44,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 97 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:22:44,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-01-09 22:22:44,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 104. [2025-01-09 22:22:44,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 65 states have (on average 1.8) internal successors, (117), 103 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:44,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2025-01-09 22:22:44,353 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 4 [2025-01-09 22:22:44,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:44,353 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2025-01-09 22:22:44,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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) [2025-01-09 22:22:44,353 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2025-01-09 22:22:44,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:22:44,353 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:44,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:22:44,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 22:22:44,354 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:44,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:44,354 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2025-01-09 22:22:44,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:44,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711599007] [2025-01-09 22:22:44,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:44,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:44,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:22:44,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:22:44,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:44,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:44,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:44,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711599007] [2025-01-09 22:22:44,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711599007] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:44,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:44,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:22:44,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5397922] [2025-01-09 22:22:44,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:44,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:22:44,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:44,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:22:44,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:44,377 INFO L87 Difference]: Start difference. First operand 104 states and 117 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:44,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:44,422 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2025-01-09 22:22:44,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:22:44,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2025-01-09 22:22:44,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:44,423 INFO L225 Difference]: With dead ends: 102 [2025-01-09 22:22:44,423 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 22:22:44,423 INFO L434 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 [2025-01-09 22:22:44,424 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 29 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:44,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 110 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:22:44,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 22:22:44,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-01-09 22:22:44,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 65 states have (on average 1.7692307692307692) internal successors, (115), 101 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:44,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2025-01-09 22:22:44,428 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 5 [2025-01-09 22:22:44,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:44,428 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2025-01-09 22:22:44,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:44,428 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2025-01-09 22:22:44,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 22:22:44,428 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:44,428 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 22:22:44,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 22:22:44,429 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:44,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:44,429 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2025-01-09 22:22:44,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:44,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378610958] [2025-01-09 22:22:44,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:44,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:44,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 22:22:44,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 22:22:44,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:44,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:44,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:44,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:44,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378610958] [2025-01-09 22:22:44,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378610958] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:44,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:44,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:22:44,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302027063] [2025-01-09 22:22:44,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:44,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:22:44,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:44,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:22:44,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:44,463 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:44,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:44,508 INFO L93 Difference]: Finished difference Result 110 states and 123 transitions. [2025-01-09 22:22:44,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:22:44,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2025-01-09 22:22:44,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:44,509 INFO L225 Difference]: With dead ends: 110 [2025-01-09 22:22:44,509 INFO L226 Difference]: Without dead ends: 110 [2025-01-09 22:22:44,509 INFO L434 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 [2025-01-09 22:22:44,510 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 15 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:44,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 135 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:22:44,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-01-09 22:22:44,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 106. [2025-01-09 22:22:44,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 70 states have (on average 1.7285714285714286) internal successors, (121), 105 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:44,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2025-01-09 22:22:44,514 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 5 [2025-01-09 22:22:44,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:44,514 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2025-01-09 22:22:44,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:44,514 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2025-01-09 22:22:44,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:22:44,514 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:44,514 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:44,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 22:22:44,515 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:44,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:44,515 INFO L85 PathProgramCache]: Analyzing trace with hash 234239181, now seen corresponding path program 1 times [2025-01-09 22:22:44,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:44,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314626491] [2025-01-09 22:22:44,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:44,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:44,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:22:44,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:22:44,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:44,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:44,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:44,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:44,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314626491] [2025-01-09 22:22:44,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314626491] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:44,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:44,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 22:22:44,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111225301] [2025-01-09 22:22:44,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:44,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 22:22:44,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:44,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 22:22:44,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 22:22:44,589 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:44,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:44,638 INFO L93 Difference]: Finished difference Result 102 states and 116 transitions. [2025-01-09 22:22:44,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:22:44,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 22:22:44,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:44,639 INFO L225 Difference]: With dead ends: 102 [2025-01-09 22:22:44,639 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 22:22:44,640 INFO L434 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 [2025-01-09 22:22:44,640 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 14 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:44,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 115 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:22:44,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 22:22:44,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-01-09 22:22:44,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 70 states have (on average 1.6571428571428573) internal successors, (116), 101 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:44,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2025-01-09 22:22:44,647 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 9 [2025-01-09 22:22:44,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:44,649 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2025-01-09 22:22:44,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:44,650 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2025-01-09 22:22:44,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 22:22:44,650 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:44,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:44,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 22:22:44,650 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:44,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:44,650 INFO L85 PathProgramCache]: Analyzing trace with hash 234239182, now seen corresponding path program 1 times [2025-01-09 22:22:44,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:44,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759488877] [2025-01-09 22:22:44,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:44,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:44,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 22:22:44,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 22:22:44,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:44,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:44,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:44,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:44,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759488877] [2025-01-09 22:22:44,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759488877] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:44,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:44,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:22:44,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865980473] [2025-01-09 22:22:44,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:44,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:22:44,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:44,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:22:44,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:22:44,785 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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) [2025-01-09 22:22:44,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:44,862 INFO L93 Difference]: Finished difference Result 98 states and 111 transitions. [2025-01-09 22:22:44,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 22:22:44,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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 [2025-01-09 22:22:44,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:44,863 INFO L225 Difference]: With dead ends: 98 [2025-01-09 22:22:44,863 INFO L226 Difference]: Without dead ends: 98 [2025-01-09 22:22:44,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:22:44,863 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 14 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:44,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 145 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:22:44,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-01-09 22:22:44,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-01-09 22:22:44,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5857142857142856) internal successors, (111), 97 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:44,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2025-01-09 22:22:44,872 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 9 [2025-01-09 22:22:44,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:44,872 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2025-01-09 22:22:44,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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) [2025-01-09 22:22:44,872 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2025-01-09 22:22:44,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 22:22:44,872 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:44,872 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:44,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 22:22:44,872 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:44,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:44,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1431624144, now seen corresponding path program 1 times [2025-01-09 22:22:44,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:44,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736644654] [2025-01-09 22:22:44,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:44,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:44,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:22:44,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:22:44,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:44,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:44,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:44,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:44,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736644654] [2025-01-09 22:22:44,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736644654] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:44,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:44,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:22:44,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376760476] [2025-01-09 22:22:44,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:44,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:22:44,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:44,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:22:44,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:22:44,974 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:45,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:45,065 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2025-01-09 22:22:45,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:22:45,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-09 22:22:45,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:45,066 INFO L225 Difference]: With dead ends: 106 [2025-01-09 22:22:45,066 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 22:22:45,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:22:45,067 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 5 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:45,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 217 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:22:45,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 22:22:45,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2025-01-09 22:22:45,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.5810810810810811) internal successors, (117), 101 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2025-01-09 22:22:45,073 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 14 [2025-01-09 22:22:45,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:45,073 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2025-01-09 22:22:45,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:45,073 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2025-01-09 22:22:45,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-09 22:22:45,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:45,073 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:45,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 22:22:45,073 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:45,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:45,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1431624145, now seen corresponding path program 1 times [2025-01-09 22:22:45,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:45,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329370292] [2025-01-09 22:22:45,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:45,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:45,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-09 22:22:45,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-09 22:22:45,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:45,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:45,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:45,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:45,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329370292] [2025-01-09 22:22:45,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329370292] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:45,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:45,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:22:45,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054079950] [2025-01-09 22:22:45,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:45,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:22:45,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:45,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:22:45,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:22:45,225 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:45,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:45,340 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2025-01-09 22:22:45,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:22:45,340 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-01-09 22:22:45,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:45,341 INFO L225 Difference]: With dead ends: 102 [2025-01-09 22:22:45,341 INFO L226 Difference]: Without dead ends: 102 [2025-01-09 22:22:45,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:22:45,341 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 2 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:45,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 268 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:22:45,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-01-09 22:22:45,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-01-09 22:22:45,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.554054054054054) internal successors, (115), 101 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:45,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2025-01-09 22:22:45,344 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 14 [2025-01-09 22:22:45,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:45,344 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2025-01-09 22:22:45,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:45,344 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2025-01-09 22:22:45,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 22:22:45,345 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:45,345 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:45,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 22:22:45,345 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:45,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:45,345 INFO L85 PathProgramCache]: Analyzing trace with hash 282100697, now seen corresponding path program 1 times [2025-01-09 22:22:45,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:45,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729190623] [2025-01-09 22:22:45,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:45,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:45,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 22:22:45,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 22:22:45,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:45,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:45,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:45,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:45,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729190623] [2025-01-09 22:22:45,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729190623] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:45,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:45,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:22:45,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744160116] [2025-01-09 22:22:45,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:45,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:22:45,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:45,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:22:45,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:22:45,434 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:45,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:45,500 INFO L93 Difference]: Finished difference Result 167 states and 183 transitions. [2025-01-09 22:22:45,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:22:45,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-01-09 22:22:45,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:45,501 INFO L225 Difference]: With dead ends: 167 [2025-01-09 22:22:45,501 INFO L226 Difference]: Without dead ends: 167 [2025-01-09 22:22:45,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:22:45,502 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 86 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:45,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 288 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:22:45,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-01-09 22:22:45,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 102. [2025-01-09 22:22:45,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.5405405405405406) internal successors, (114), 101 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) [2025-01-09 22:22:45,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2025-01-09 22:22:45,505 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 17 [2025-01-09 22:22:45,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:45,505 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2025-01-09 22:22:45,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:45,506 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2025-01-09 22:22:45,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 22:22:45,506 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:45,506 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:45,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 22:22:45,506 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:45,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:45,506 INFO L85 PathProgramCache]: Analyzing trace with hash 282096825, now seen corresponding path program 1 times [2025-01-09 22:22:45,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:45,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185486780] [2025-01-09 22:22:45,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:45,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:45,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 22:22:45,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 22:22:45,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:45,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:45,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:45,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:45,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185486780] [2025-01-09 22:22:45,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185486780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:45,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:45,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:22:45,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627283259] [2025-01-09 22:22:45,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:45,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:22:45,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:45,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:22:45,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:22:45,595 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:45,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:45,724 INFO L93 Difference]: Finished difference Result 163 states and 175 transitions. [2025-01-09 22:22:45,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:22:45,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-01-09 22:22:45,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:45,725 INFO L225 Difference]: With dead ends: 163 [2025-01-09 22:22:45,725 INFO L226 Difference]: Without dead ends: 163 [2025-01-09 22:22:45,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:22:45,726 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 94 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:45,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 195 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:22:45,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-01-09 22:22:45,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 102. [2025-01-09 22:22:45,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 74 states have (on average 1.527027027027027) internal successors, (113), 101 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) [2025-01-09 22:22:45,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2025-01-09 22:22:45,731 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 17 [2025-01-09 22:22:45,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:45,732 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2025-01-09 22:22:45,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:45,732 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2025-01-09 22:22:45,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 22:22:45,732 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:45,732 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:45,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 22:22:45,733 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:45,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:45,733 INFO L85 PathProgramCache]: Analyzing trace with hash 282096826, now seen corresponding path program 1 times [2025-01-09 22:22:45,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:45,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150139400] [2025-01-09 22:22:45,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:45,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:45,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 22:22:45,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 22:22:45,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:45,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:45,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:45,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:45,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150139400] [2025-01-09 22:22:45,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150139400] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:45,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:45,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:22:45,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298648077] [2025-01-09 22:22:45,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:45,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:22:45,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:45,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:22:45,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:22:45,872 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:45,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:45,989 INFO L93 Difference]: Finished difference Result 161 states and 181 transitions. [2025-01-09 22:22:45,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:22:45,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-01-09 22:22:45,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:45,990 INFO L225 Difference]: With dead ends: 161 [2025-01-09 22:22:45,990 INFO L226 Difference]: Without dead ends: 161 [2025-01-09 22:22:45,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:22:45,990 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 56 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:45,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 218 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:22:45,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-09 22:22:45,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 110. [2025-01-09 22:22:45,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 82 states have (on average 1.4878048780487805) internal successors, (122), 109 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:45,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 122 transitions. [2025-01-09 22:22:45,993 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 122 transitions. Word has length 17 [2025-01-09 22:22:45,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:45,993 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 122 transitions. [2025-01-09 22:22:45,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:45,993 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 122 transitions. [2025-01-09 22:22:45,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:22:45,993 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:45,994 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:45,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 22:22:45,994 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:45,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:45,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1910703943, now seen corresponding path program 1 times [2025-01-09 22:22:45,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:45,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248992046] [2025-01-09 22:22:45,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:45,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:46,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:22:46,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:22:46,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:46,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:46,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:46,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:46,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248992046] [2025-01-09 22:22:46,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248992046] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:22:46,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461082347] [2025-01-09 22:22:46,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:46,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:46,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:22:46,145 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:22:46,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 22:22:46,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:22:46,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:22:46,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:46,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:46,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-01-09 22:22:46,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:22:46,239 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 [2025-01-09 22:22:46,253 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:22:46,253 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 [2025-01-09 22:22:46,269 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 19 treesize of output 1 [2025-01-09 22:22:46,309 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:22:46,309 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 42 treesize of output 41 [2025-01-09 22:22:46,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-01-09 22:22:46,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:46,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:22:46,348 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-01-09 22:22:46,348 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 21 treesize of output 20 [2025-01-09 22:22:46,353 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_209 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_209) |c_ULTIMATE.start_create_data_~data~0#1.base|) (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4)) |c_ULTIMATE.start_create_data_#t~mem7#1.base|)) is different from false [2025-01-09 22:22:46,390 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-01-09 22:22:46,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461082347] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:22:46,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:22:46,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-01-09 22:22:46,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339740021] [2025-01-09 22:22:46,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:22:46,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:22:46,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:46,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:22:46,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=106, Unknown=1, NotChecked=20, Total=156 [2025-01-09 22:22:46,392 INFO L87 Difference]: Start difference. First operand 110 states and 122 transitions. Second operand has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:46,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:46,541 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2025-01-09 22:22:46,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:22:46,542 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-09 22:22:46,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:46,542 INFO L225 Difference]: With dead ends: 109 [2025-01-09 22:22:46,542 INFO L226 Difference]: Without dead ends: 109 [2025-01-09 22:22:46,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=160, Unknown=1, NotChecked=26, Total=240 [2025-01-09 22:22:46,543 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 21 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:46,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 479 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 234 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2025-01-09 22:22:46,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-01-09 22:22:46,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-01-09 22:22:46,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 82 states have (on average 1.475609756097561) internal successors, (121), 108 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:46,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 121 transitions. [2025-01-09 22:22:46,544 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 121 transitions. Word has length 19 [2025-01-09 22:22:46,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:46,544 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 121 transitions. [2025-01-09 22:22:46,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.75) internal successors, (33), 13 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:46,545 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2025-01-09 22:22:46,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 22:22:46,545 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:46,545 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:46,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 22:22:46,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 22:22:46,749 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:46,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:46,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1910703942, now seen corresponding path program 1 times [2025-01-09 22:22:46,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:46,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315038339] [2025-01-09 22:22:46,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:46,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:46,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:22:46,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:22:46,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:46,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:46,985 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:46,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:46,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315038339] [2025-01-09 22:22:46,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315038339] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:22:46,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1760418901] [2025-01-09 22:22:46,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:46,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:46,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:22:46,988 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:22:46,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 22:22:47,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 22:22:47,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 22:22:47,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:47,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:47,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-01-09 22:22:47,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:22:47,064 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 [2025-01-09 22:22:47,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:22:47,078 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:22:47,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 22:22:47,101 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 19 treesize of output 1 [2025-01-09 22:22:47,105 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 13 treesize of output 9 [2025-01-09 22:22:47,212 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:22:47,213 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 57 [2025-01-09 22:22:47,219 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 30 treesize of output 13 [2025-01-09 22:22:47,264 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 31 treesize of output 13 [2025-01-09 22:22:47,269 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 9 treesize of output 3 [2025-01-09 22:22:47,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:47,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:22:47,366 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4)) (.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_268) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_267) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))) (forall ((v_ArrVal_268 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_268) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 4))))) is different from false [2025-01-09 22:22:47,388 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_268 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_268) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 4))) (forall ((v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_268) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_267) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))) is different from false [2025-01-09 22:22:47,401 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_268 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_268) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_267 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_268) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_267) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))))))) is different from false [2025-01-09 22:22:47,410 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:47,410 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 45 treesize of output 46 [2025-01-09 22:22:47,415 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:47,415 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 35 treesize of output 36 [2025-01-09 22:22:47,418 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 62 treesize of output 50 [2025-01-09 22:22:47,439 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 96 treesize of output 78 [2025-01-09 22:22:47,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2025-01-09 22:22:47,445 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 11 treesize of output 7 [2025-01-09 22:22:47,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:47,456 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 24 treesize of output 25 [2025-01-09 22:22:47,458 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:47,459 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 22 treesize of output 10 [2025-01-09 22:22:47,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-01-09 22:22:47,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1760418901] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:22:47,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:22:47,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 23 [2025-01-09 22:22:47,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788736457] [2025-01-09 22:22:47,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:22:47,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-09 22:22:47,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:47,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-09 22:22:47,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=353, Unknown=3, NotChecked=120, Total=552 [2025-01-09 22:22:47,499 INFO L87 Difference]: Start difference. First operand 109 states and 121 transitions. Second operand has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:47,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:47,917 INFO L93 Difference]: Finished difference Result 114 states and 126 transitions. [2025-01-09 22:22:47,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 22:22:47,917 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-01-09 22:22:47,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:47,917 INFO L225 Difference]: With dead ends: 114 [2025-01-09 22:22:47,917 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 22:22:47,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=568, Unknown=3, NotChecked=156, Total=870 [2025-01-09 22:22:47,919 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 32 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:47,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 774 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 543 Invalid, 0 Unknown, 154 Unchecked, 0.3s Time] [2025-01-09 22:22:47,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 22:22:47,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-01-09 22:22:47,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 113 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:47,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 126 transitions. [2025-01-09 22:22:47,922 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 126 transitions. Word has length 19 [2025-01-09 22:22:47,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:47,922 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 126 transitions. [2025-01-09 22:22:47,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 24 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:47,922 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 126 transitions. [2025-01-09 22:22:47,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:22:47,923 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:47,923 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:47,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 22:22:48,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:48,124 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:48,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:48,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1304427068, now seen corresponding path program 1 times [2025-01-09 22:22:48,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:48,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368711394] [2025-01-09 22:22:48,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:48,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:48,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:22:48,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:22:48,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:48,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:48,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:48,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:48,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368711394] [2025-01-09 22:22:48,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368711394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:48,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:48,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:22:48,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833702896] [2025-01-09 22:22:48,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:48,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:22:48,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:48,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:22:48,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:22:48,191 INFO L87 Difference]: Start difference. First operand 114 states and 126 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:48,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:48,306 INFO L93 Difference]: Finished difference Result 180 states and 193 transitions. [2025-01-09 22:22:48,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 22:22:48,306 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-09 22:22:48,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:48,307 INFO L225 Difference]: With dead ends: 180 [2025-01-09 22:22:48,307 INFO L226 Difference]: Without dead ends: 180 [2025-01-09 22:22:48,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:22:48,307 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 87 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:48,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 200 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:22:48,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-01-09 22:22:48,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 114. [2025-01-09 22:22:48,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 113 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:48,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 125 transitions. [2025-01-09 22:22:48,309 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 125 transitions. Word has length 20 [2025-01-09 22:22:48,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:48,310 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 125 transitions. [2025-01-09 22:22:48,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:48,310 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 125 transitions. [2025-01-09 22:22:48,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 22:22:48,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:48,310 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:48,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 22:22:48,310 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:48,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:48,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1304427067, now seen corresponding path program 1 times [2025-01-09 22:22:48,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:48,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510420983] [2025-01-09 22:22:48,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:48,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:48,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 22:22:48,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 22:22:48,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:48,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:48,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:48,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:48,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510420983] [2025-01-09 22:22:48,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510420983] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:48,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:48,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:22:48,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622121519] [2025-01-09 22:22:48,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:48,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:22:48,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:48,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:22:48,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:22:48,433 INFO L87 Difference]: Start difference. First operand 114 states and 125 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:48,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:48,547 INFO L93 Difference]: Finished difference Result 180 states and 197 transitions. [2025-01-09 22:22:48,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:22:48,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-01-09 22:22:48,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:48,548 INFO L225 Difference]: With dead ends: 180 [2025-01-09 22:22:48,548 INFO L226 Difference]: Without dead ends: 180 [2025-01-09 22:22:48,548 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:22:48,549 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 70 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:48,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 208 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:22:48,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-01-09 22:22:48,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 113. [2025-01-09 22:22:48,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 87 states have (on average 1.4137931034482758) internal successors, (123), 112 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:48,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2025-01-09 22:22:48,551 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 20 [2025-01-09 22:22:48,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:48,551 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2025-01-09 22:22:48,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:48,551 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2025-01-09 22:22:48,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-01-09 22:22:48,552 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:48,552 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:48,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 22:22:48,552 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:48,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:48,552 INFO L85 PathProgramCache]: Analyzing trace with hash 677376126, now seen corresponding path program 1 times [2025-01-09 22:22:48,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:48,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197005040] [2025-01-09 22:22:48,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:48,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:48,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-09 22:22:48,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-09 22:22:48,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:48,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:48,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:48,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:48,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197005040] [2025-01-09 22:22:48,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197005040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:48,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:48,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 22:22:48,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61062676] [2025-01-09 22:22:48,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:48,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 22:22:48,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:48,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 22:22:48,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 22:22:48,770 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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) [2025-01-09 22:22:48,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:48,927 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2025-01-09 22:22:48,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 22:22:48,927 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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 23 [2025-01-09 22:22:48,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:48,928 INFO L225 Difference]: With dead ends: 140 [2025-01-09 22:22:48,928 INFO L226 Difference]: Without dead ends: 140 [2025-01-09 22:22:48,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:22:48,928 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 34 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:48,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 511 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:22:48,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-01-09 22:22:48,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 128. [2025-01-09 22:22:48,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 102 states have (on average 1.3627450980392157) internal successors, (139), 127 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:48,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2025-01-09 22:22:48,931 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 23 [2025-01-09 22:22:48,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:48,931 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2025-01-09 22:22:48,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 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) [2025-01-09 22:22:48,931 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2025-01-09 22:22:48,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 22:22:48,931 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:48,932 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:48,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 22:22:48,932 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:48,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:48,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1364247409, now seen corresponding path program 2 times [2025-01-09 22:22:48,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:48,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427459400] [2025-01-09 22:22:48,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:22:48,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:48,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-09 22:22:48,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:22:48,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:22:48,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:49,258 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:49,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:49,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427459400] [2025-01-09 22:22:49,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427459400] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:22:49,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063439033] [2025-01-09 22:22:49,258 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 22:22:49,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:49,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:22:49,260 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:22:49,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 22:22:49,319 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-01-09 22:22:49,340 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 22:22:49,340 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 22:22:49,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:49,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 22:22:49,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:22:49,346 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 [2025-01-09 22:22:49,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:22:49,358 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:22:49,358 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 [2025-01-09 22:22:49,367 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 13 treesize of output 9 [2025-01-09 22:22:49,371 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 19 treesize of output 1 [2025-01-09 22:22:49,435 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:22:49,435 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 57 [2025-01-09 22:22:49,442 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 30 treesize of output 13 [2025-01-09 22:22:49,530 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:22:49,531 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 57 [2025-01-09 22:22:49,536 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 30 treesize of output 13 [2025-01-09 22:22:49,589 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 31 treesize of output 13 [2025-01-09 22:22:49,598 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 9 treesize of output 3 [2025-01-09 22:22:49,619 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:49,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:22:49,701 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_407 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_407) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (<= (+ .cse0 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_407) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_406) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) is different from false [2025-01-09 22:22:49,715 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_407 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_407) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_406) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_407 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_407) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 4)))))) is different from false [2025-01-09 22:22:49,770 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4)) (.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_407 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_404))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_405) .cse0 v_ArrVal_407) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 12) (select |c_#length| (select (select (store .cse3 .cse0 v_ArrVal_406) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_407 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_405) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_404) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_407) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8))))) is different from false [2025-01-09 22:22:49,792 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_407 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_405) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_404) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_407) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8))) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_407 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_404))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_405) .cse3 v_ArrVal_407) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 12) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_406) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))))))))) is different from false [2025-01-09 22:22:49,809 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_407 (Array Int Int)) (v_ArrVal_406 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_404))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_405) .cse1 v_ArrVal_407) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_406) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_404 (Array Int Int)) (v_ArrVal_407 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_405) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_404) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) v_ArrVal_407) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8)))))) is different from false [2025-01-09 22:22:49,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:49,818 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 89 treesize of output 90 [2025-01-09 22:22:49,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:49,823 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 79 treesize of output 60 [2025-01-09 22:22:49,826 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 400 treesize of output 334 [2025-01-09 22:22:49,831 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 288 treesize of output 264 [2025-01-09 22:22:49,842 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 19 [2025-01-09 22:22:49,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 19 treesize of output 15 [2025-01-09 22:22:49,847 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 40 treesize of output 28 [2025-01-09 22:22:49,850 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 [2025-01-09 22:22:49,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:49,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2025-01-09 22:22:49,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:49,870 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 36 treesize of output 37 [2025-01-09 22:22:49,872 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:49,873 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 34 treesize of output 22 [2025-01-09 22:22:49,875 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:49,876 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 22 treesize of output 10 [2025-01-09 22:22:49,916 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2025-01-09 22:22:49,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063439033] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:22:49,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:22:49,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 27 [2025-01-09 22:22:49,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738774521] [2025-01-09 22:22:49,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:22:49,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 22:22:49,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:49,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 22:22:49,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=412, Unknown=11, NotChecked=230, Total=756 [2025-01-09 22:22:49,918 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:50,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:50,486 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2025-01-09 22:22:50,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 22:22:50,487 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-01-09 22:22:50,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:50,489 INFO L225 Difference]: With dead ends: 138 [2025-01-09 22:22:50,489 INFO L226 Difference]: Without dead ends: 138 [2025-01-09 22:22:50,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=224, Invalid=905, Unknown=13, NotChecked=340, Total=1482 [2025-01-09 22:22:50,490 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 39 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 2 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 302 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:50,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 851 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 573 Invalid, 19 Unknown, 302 Unchecked, 0.3s Time] [2025-01-09 22:22:50,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-01-09 22:22:50,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-01-09 22:22:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 137 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:50,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2025-01-09 22:22:50,495 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 24 [2025-01-09 22:22:50,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:50,495 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2025-01-09 22:22:50,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.037037037037037) internal successors, (55), 28 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:50,495 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2025-01-09 22:22:50,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-09 22:22:50,495 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:50,495 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 22:22:50,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 22:22:50,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:50,696 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:50,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:50,697 INFO L85 PathProgramCache]: Analyzing trace with hash -1876604357, now seen corresponding path program 1 times [2025-01-09 22:22:50,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:50,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822208895] [2025-01-09 22:22:50,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:50,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:50,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-09 22:22:50,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-09 22:22:50,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:50,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:50,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:50,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:50,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822208895] [2025-01-09 22:22:50,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822208895] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:50,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:50,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:22:50,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919401600] [2025-01-09 22:22:50,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:50,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:22:50,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:50,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:22:50,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:22:50,817 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:50,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:50,863 INFO L93 Difference]: Finished difference Result 166 states and 182 transitions. [2025-01-09 22:22:50,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:22:50,863 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2025-01-09 22:22:50,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:50,864 INFO L225 Difference]: With dead ends: 166 [2025-01-09 22:22:50,864 INFO L226 Difference]: Without dead ends: 166 [2025-01-09 22:22:50,864 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:22:50,864 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 69 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:50,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 223 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:22:50,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-01-09 22:22:50,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 150. [2025-01-09 22:22:50,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 124 states have (on average 1.4112903225806452) internal successors, (175), 149 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:50,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 175 transitions. [2025-01-09 22:22:50,870 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 175 transitions. Word has length 25 [2025-01-09 22:22:50,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:50,871 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 175 transitions. [2025-01-09 22:22:50,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:50,871 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 175 transitions. [2025-01-09 22:22:50,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-01-09 22:22:50,872 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:50,872 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 22:22:50,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 22:22:50,873 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:50,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:50,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1954807240, now seen corresponding path program 1 times [2025-01-09 22:22:50,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:50,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824116417] [2025-01-09 22:22:50,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:50,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:50,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-01-09 22:22:50,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-01-09 22:22:50,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:50,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:50,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:50,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:50,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824116417] [2025-01-09 22:22:50,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824116417] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:50,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:50,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:22:50,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581219975] [2025-01-09 22:22:50,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:50,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:22:50,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:50,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:22:50,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:22:50,948 INFO L87 Difference]: Start difference. First operand 150 states and 175 transitions. Second operand has 5 states, 4 states have (on average 6.5) 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) [2025-01-09 22:22:51,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:51,024 INFO L93 Difference]: Finished difference Result 217 states and 237 transitions. [2025-01-09 22:22:51,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:22:51,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) 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 26 [2025-01-09 22:22:51,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:51,025 INFO L225 Difference]: With dead ends: 217 [2025-01-09 22:22:51,025 INFO L226 Difference]: Without dead ends: 217 [2025-01-09 22:22:51,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:22:51,026 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 69 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:51,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 245 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:22:51,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-01-09 22:22:51,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 151. [2025-01-09 22:22:51,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 125 states have (on average 1.408) internal successors, (176), 150 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:51,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 176 transitions. [2025-01-09 22:22:51,034 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 176 transitions. Word has length 26 [2025-01-09 22:22:51,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:51,034 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 176 transitions. [2025-01-09 22:22:51,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) 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) [2025-01-09 22:22:51,034 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 176 transitions. [2025-01-09 22:22:51,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-01-09 22:22:51,034 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:51,034 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 22:22:51,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 22:22:51,034 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:51,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:51,034 INFO L85 PathProgramCache]: Analyzing trace with hash 469482461, now seen corresponding path program 1 times [2025-01-09 22:22:51,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:51,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667855364] [2025-01-09 22:22:51,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:51,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:51,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-09 22:22:51,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-09 22:22:51,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:51,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:51,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:51,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:51,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667855364] [2025-01-09 22:22:51,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667855364] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:51,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:51,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:22:51,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568010711] [2025-01-09 22:22:51,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:51,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:22:51,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:51,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:22:51,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:22:51,116 INFO L87 Difference]: Start difference. First operand 151 states and 176 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 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) [2025-01-09 22:22:51,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:51,217 INFO L93 Difference]: Finished difference Result 220 states and 241 transitions. [2025-01-09 22:22:51,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:22:51,218 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 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 27 [2025-01-09 22:22:51,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:51,218 INFO L225 Difference]: With dead ends: 220 [2025-01-09 22:22:51,218 INFO L226 Difference]: Without dead ends: 220 [2025-01-09 22:22:51,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 22:22:51,219 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 76 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:51,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 202 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:22:51,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-01-09 22:22:51,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 154. [2025-01-09 22:22:51,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 128 states have (on average 1.3984375) internal successors, (179), 153 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:51,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 179 transitions. [2025-01-09 22:22:51,222 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 179 transitions. Word has length 27 [2025-01-09 22:22:51,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:51,222 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 179 transitions. [2025-01-09 22:22:51,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 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) [2025-01-09 22:22:51,222 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 179 transitions. [2025-01-09 22:22:51,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:22:51,223 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:51,223 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 22:22:51,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 22:22:51,223 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:51,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:51,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1669054571, now seen corresponding path program 1 times [2025-01-09 22:22:51,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:51,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993810104] [2025-01-09 22:22:51,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:51,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:51,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:22:51,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:22:51,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:51,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:51,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:51,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:51,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993810104] [2025-01-09 22:22:51,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993810104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:51,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:51,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 22:22:51,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699402084] [2025-01-09 22:22:51,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:51,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 22:22:51,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:51,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 22:22:51,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:22:51,383 INFO L87 Difference]: Start difference. First operand 154 states and 179 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:51,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:51,494 INFO L93 Difference]: Finished difference Result 175 states and 193 transitions. [2025-01-09 22:22:51,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:22:51,495 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-01-09 22:22:51,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:51,498 INFO L225 Difference]: With dead ends: 175 [2025-01-09 22:22:51,498 INFO L226 Difference]: Without dead ends: 175 [2025-01-09 22:22:51,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:22:51,499 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 100 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:51,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 183 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:22:51,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-01-09 22:22:51,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 155. [2025-01-09 22:22:51,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 129 states have (on average 1.4031007751937985) internal successors, (181), 154 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 181 transitions. [2025-01-09 22:22:51,503 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 181 transitions. Word has length 28 [2025-01-09 22:22:51,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:51,503 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 181 transitions. [2025-01-09 22:22:51,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:51,503 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 181 transitions. [2025-01-09 22:22:51,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:22:51,504 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:51,504 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 22:22:51,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 22:22:51,504 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:51,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:51,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1669054572, now seen corresponding path program 1 times [2025-01-09 22:22:51,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:51,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567772132] [2025-01-09 22:22:51,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:51,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:51,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:22:51,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:22:51,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:51,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:51,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:51,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:51,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567772132] [2025-01-09 22:22:51,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567772132] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:51,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:51,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 22:22:51,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421170636] [2025-01-09 22:22:51,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:51,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 22:22:51,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:51,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 22:22:51,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:22:51,537 INFO L87 Difference]: Start difference. First operand 155 states and 181 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:51,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:51,570 INFO L93 Difference]: Finished difference Result 150 states and 173 transitions. [2025-01-09 22:22:51,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 22:22:51,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-01-09 22:22:51,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:51,571 INFO L225 Difference]: With dead ends: 150 [2025-01-09 22:22:51,571 INFO L226 Difference]: Without dead ends: 150 [2025-01-09 22:22:51,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 22:22:51,571 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 58 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:51,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 53 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:22:51,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-01-09 22:22:51,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-01-09 22:22:51,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 129 states have (on average 1.3410852713178294) internal successors, (173), 149 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:51,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 173 transitions. [2025-01-09 22:22:51,575 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 173 transitions. Word has length 28 [2025-01-09 22:22:51,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:51,575 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 173 transitions. [2025-01-09 22:22:51,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:51,575 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 173 transitions. [2025-01-09 22:22:51,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:22:51,576 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:51,576 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 22:22:51,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 22:22:51,576 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:51,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:51,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1751539878, now seen corresponding path program 1 times [2025-01-09 22:22:51,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:51,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6189474] [2025-01-09 22:22:51,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:51,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:51,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:22:51,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:22:51,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:51,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:51,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:51,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:51,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6189474] [2025-01-09 22:22:51,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6189474] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:51,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:51,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 22:22:51,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639997333] [2025-01-09 22:22:51,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:51,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:22:51,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:51,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:22:51,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:22:51,770 INFO L87 Difference]: Start difference. First operand 150 states and 173 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:51,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:51,996 INFO L93 Difference]: Finished difference Result 172 states and 188 transitions. [2025-01-09 22:22:51,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:22:51,997 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-01-09 22:22:51,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:51,997 INFO L225 Difference]: With dead ends: 172 [2025-01-09 22:22:51,997 INFO L226 Difference]: Without dead ends: 172 [2025-01-09 22:22:51,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:22:51,998 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 74 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:51,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 403 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:22:51,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-01-09 22:22:52,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 155. [2025-01-09 22:22:52,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 154 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:52,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 180 transitions. [2025-01-09 22:22:52,002 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 180 transitions. Word has length 28 [2025-01-09 22:22:52,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:52,002 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 180 transitions. [2025-01-09 22:22:52,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:52,003 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 180 transitions. [2025-01-09 22:22:52,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-09 22:22:52,003 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:52,003 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 22:22:52,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 22:22:52,003 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:52,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:52,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1751539877, now seen corresponding path program 1 times [2025-01-09 22:22:52,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:52,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415792487] [2025-01-09 22:22:52,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:52,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:52,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-09 22:22:52,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-09 22:22:52,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:52,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:52,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:52,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:52,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415792487] [2025-01-09 22:22:52,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415792487] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:52,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:52,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 22:22:52,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345852934] [2025-01-09 22:22:52,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:52,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:22:52,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:52,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:22:52,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:22:52,256 INFO L87 Difference]: Start difference. First operand 155 states and 180 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:52,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:52,470 INFO L93 Difference]: Finished difference Result 193 states and 223 transitions. [2025-01-09 22:22:52,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:22:52,471 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-01-09 22:22:52,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:52,471 INFO L225 Difference]: With dead ends: 193 [2025-01-09 22:22:52,472 INFO L226 Difference]: Without dead ends: 193 [2025-01-09 22:22:52,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:22:52,472 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 55 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:52,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 397 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:22:52,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-01-09 22:22:52,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 168. [2025-01-09 22:22:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 148 states have (on average 1.337837837837838) internal successors, (198), 167 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:52,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 198 transitions. [2025-01-09 22:22:52,478 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 198 transitions. Word has length 28 [2025-01-09 22:22:52,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:52,478 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 198 transitions. [2025-01-09 22:22:52,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:52,478 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 198 transitions. [2025-01-09 22:22:52,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:22:52,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:52,479 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-01-09 22:22:52,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 22:22:52,479 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:52,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:52,479 INFO L85 PathProgramCache]: Analyzing trace with hash -566739907, now seen corresponding path program 1 times [2025-01-09 22:22:52,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:52,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144672245] [2025-01-09 22:22:52,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:52,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:52,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:22:52,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:22:52,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:52,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:52,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:52,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:52,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144672245] [2025-01-09 22:22:52,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144672245] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:52,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:52,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 22:22:52,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224742045] [2025-01-09 22:22:52,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:52,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 22:22:52,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:52,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 22:22:52,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-01-09 22:22:52,668 INFO L87 Difference]: Start difference. First operand 168 states and 198 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 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) [2025-01-09 22:22:52,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:52,888 INFO L93 Difference]: Finished difference Result 188 states and 209 transitions. [2025-01-09 22:22:52,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:22:52,889 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 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 31 [2025-01-09 22:22:52,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:52,889 INFO L225 Difference]: With dead ends: 188 [2025-01-09 22:22:52,889 INFO L226 Difference]: Without dead ends: 188 [2025-01-09 22:22:52,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:22:52,890 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 56 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:52,891 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 489 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:22:52,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-01-09 22:22:52,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 168. [2025-01-09 22:22:52,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 148 states have (on average 1.3243243243243243) internal successors, (196), 167 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:52,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 196 transitions. [2025-01-09 22:22:52,917 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 196 transitions. Word has length 31 [2025-01-09 22:22:52,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:52,917 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 196 transitions. [2025-01-09 22:22:52,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 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) [2025-01-09 22:22:52,917 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 196 transitions. [2025-01-09 22:22:52,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-01-09 22:22:52,918 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:52,918 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-01-09 22:22:52,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 22:22:52,918 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:52,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:52,919 INFO L85 PathProgramCache]: Analyzing trace with hash -566750892, now seen corresponding path program 1 times [2025-01-09 22:22:52,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:52,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257925725] [2025-01-09 22:22:52,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:52,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:52,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 22:22:52,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 22:22:52,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:52,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:52,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:52,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:52,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257925725] [2025-01-09 22:22:52,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257925725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:52,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:52,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:22:52,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633686653] [2025-01-09 22:22:52,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:52,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:22:52,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:52,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:22:52,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:22:52,960 INFO L87 Difference]: Start difference. First operand 168 states and 196 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 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) [2025-01-09 22:22:53,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:53,002 INFO L93 Difference]: Finished difference Result 167 states and 193 transitions. [2025-01-09 22:22:53,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:22:53,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 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 31 [2025-01-09 22:22:53,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:53,003 INFO L225 Difference]: With dead ends: 167 [2025-01-09 22:22:53,003 INFO L226 Difference]: Without dead ends: 167 [2025-01-09 22:22:53,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:22:53,003 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 6 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:53,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 237 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 22:22:53,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-01-09 22:22:53,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-01-09 22:22:53,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 148 states have (on average 1.304054054054054) internal successors, (193), 166 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:53,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 193 transitions. [2025-01-09 22:22:53,006 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 193 transitions. Word has length 31 [2025-01-09 22:22:53,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:53,006 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 193 transitions. [2025-01-09 22:22:53,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 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) [2025-01-09 22:22:53,007 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 193 transitions. [2025-01-09 22:22:53,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-09 22:22:53,007 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:53,007 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2025-01-09 22:22:53,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 22:22:53,007 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:53,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:53,007 INFO L85 PathProgramCache]: Analyzing trace with hash -389408325, now seen corresponding path program 1 times [2025-01-09 22:22:53,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:53,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328037399] [2025-01-09 22:22:53,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:53,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:53,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 22:22:53,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 22:22:53,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:53,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:53,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:53,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:53,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328037399] [2025-01-09 22:22:53,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328037399] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:22:53,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:22:53,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:22:53,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282883114] [2025-01-09 22:22:53,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:22:53,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:22:53,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:53,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:22:53,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:22:53,069 INFO L87 Difference]: Start difference. First operand 167 states and 193 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:53,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:53,128 INFO L93 Difference]: Finished difference Result 165 states and 187 transitions. [2025-01-09 22:22:53,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 22:22:53,129 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-01-09 22:22:53,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:53,129 INFO L225 Difference]: With dead ends: 165 [2025-01-09 22:22:53,130 INFO L226 Difference]: Without dead ends: 165 [2025-01-09 22:22:53,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 22:22:53,131 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 48 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:53,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 197 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:22:53,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-01-09 22:22:53,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-01-09 22:22:53,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 148 states have (on average 1.2635135135135136) internal successors, (187), 164 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:53,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 187 transitions. [2025-01-09 22:22:53,134 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 187 transitions. Word has length 32 [2025-01-09 22:22:53,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:53,134 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 187 transitions. [2025-01-09 22:22:53,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:53,134 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 187 transitions. [2025-01-09 22:22:53,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:22:53,135 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:53,135 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2025-01-09 22:22:53,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 22:22:53,135 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:53,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:53,136 INFO L85 PathProgramCache]: Analyzing trace with hash -259579350, now seen corresponding path program 1 times [2025-01-09 22:22:53,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:53,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998764952] [2025-01-09 22:22:53,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:53,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:53,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:22:53,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:22:53,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:53,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:53,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:53,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:53,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998764952] [2025-01-09 22:22:53,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998764952] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:22:53,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475263945] [2025-01-09 22:22:53,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:53,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:53,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:22:53,347 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:22:53,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 22:22:53,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:22:53,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:22:53,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:53,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:53,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 22:22:53,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:22:53,621 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-01-09 22:22:53,621 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 23 treesize of output 15 [2025-01-09 22:22:53,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:53,957 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 95 treesize of output 67 [2025-01-09 22:22:53,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-01-09 22:22:54,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:54,251 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:22:54,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-01-09 22:22:54,521 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_append_~node~0#1.base_13| Int) (v_ArrVal_761 Int) (|ULTIMATE.start_append_~pointerToList#1.offset| Int)) (let ((.cse0 (select (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset| |v_ULTIMATE.start_append_~node~0#1.base_13|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (= .cse0 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_13|) 0)) (= (store (store (store |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_13| v_ArrVal_761) .cse0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)))) is different from false [2025-01-09 22:22:54,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:54,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475263945] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:22:54,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:22:54,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 10] total 24 [2025-01-09 22:22:54,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212238834] [2025-01-09 22:22:54,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:22:54,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-01-09 22:22:54,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:54,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-01-09 22:22:54,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=477, Unknown=2, NotChecked=44, Total=600 [2025-01-09 22:22:54,527 INFO L87 Difference]: Start difference. First operand 165 states and 187 transitions. Second operand has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 25 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) [2025-01-09 22:22:55,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:55,239 INFO L93 Difference]: Finished difference Result 239 states and 266 transitions. [2025-01-09 22:22:55,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:22:55,240 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 25 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) Word has length 33 [2025-01-09 22:22:55,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:55,240 INFO L225 Difference]: With dead ends: 239 [2025-01-09 22:22:55,240 INFO L226 Difference]: Without dead ends: 237 [2025-01-09 22:22:55,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=151, Invalid=781, Unknown=2, NotChecked=58, Total=992 [2025-01-09 22:22:55,241 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 125 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:55,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 745 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 682 Invalid, 0 Unknown, 113 Unchecked, 0.4s Time] [2025-01-09 22:22:55,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-01-09 22:22:55,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 194. [2025-01-09 22:22:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 177 states have (on average 1.231638418079096) internal successors, (218), 193 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:55,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 218 transitions. [2025-01-09 22:22:55,244 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 218 transitions. Word has length 33 [2025-01-09 22:22:55,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:55,244 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 218 transitions. [2025-01-09 22:22:55,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.8333333333333335) internal successors, (92), 25 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) [2025-01-09 22:22:55,244 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 218 transitions. [2025-01-09 22:22:55,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-09 22:22:55,245 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:55,245 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-09 22:22:55,251 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 22:22:55,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-01-09 22:22:55,449 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:55,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:55,450 INFO L85 PathProgramCache]: Analyzing trace with hash -259583222, now seen corresponding path program 1 times [2025-01-09 22:22:55,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:55,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733852442] [2025-01-09 22:22:55,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:55,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:55,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:22:55,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:22:55,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:55,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:55,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:55,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733852442] [2025-01-09 22:22:55,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733852442] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:22:55,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [267356233] [2025-01-09 22:22:55,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:22:55,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:55,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:22:55,916 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:22:55,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 22:22:55,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 22:22:56,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 22:22:56,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:22:56,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:56,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-01-09 22:22:56,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:22:56,069 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:56,069 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 22:22:56,112 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 [2025-01-09 22:22:56,119 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 15 treesize of output 11 [2025-01-09 22:22:56,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 22:22:56,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-01-09 22:22:56,244 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:56,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2025-01-09 22:22:56,350 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:56,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:56,355 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 29 treesize of output 19 [2025-01-09 22:22:56,366 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2025-01-09 22:22:56,366 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 29 treesize of output 19 [2025-01-09 22:22:56,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:22:56,529 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 19 treesize of output 11 [2025-01-09 22:22:56,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:56,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:22:56,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-01-09 22:22:56,811 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 350 treesize of output 318 [2025-01-09 22:22:56,830 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 56 treesize of output 40 [2025-01-09 22:22:56,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:56,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [267356233] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:22:56,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:22:56,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 32 [2025-01-09 22:22:56,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025011010] [2025-01-09 22:22:56,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:22:56,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-09 22:22:56,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:56,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-09 22:22:56,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2025-01-09 22:22:56,935 INFO L87 Difference]: Start difference. First operand 194 states and 218 transitions. Second operand has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 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) [2025-01-09 22:22:57,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:22:57,436 INFO L93 Difference]: Finished difference Result 240 states and 266 transitions. [2025-01-09 22:22:57,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 22:22:57,436 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 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) Word has length 33 [2025-01-09 22:22:57,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:22:57,437 INFO L225 Difference]: With dead ends: 240 [2025-01-09 22:22:57,437 INFO L226 Difference]: Without dead ends: 222 [2025-01-09 22:22:57,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=189, Invalid=1451, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 22:22:57,438 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 158 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 1244 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:22:57,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 1244 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:22:57,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-01-09 22:22:57,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 176. [2025-01-09 22:22:57,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 159 states have (on average 1.251572327044025) internal successors, (199), 175 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:22:57,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 199 transitions. [2025-01-09 22:22:57,441 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 199 transitions. Word has length 33 [2025-01-09 22:22:57,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:22:57,441 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 199 transitions. [2025-01-09 22:22:57,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.6875) internal successors, (86), 32 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) [2025-01-09 22:22:57,441 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 199 transitions. [2025-01-09 22:22:57,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:22:57,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:22:57,441 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:22:57,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 22:22:57,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:57,646 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:22:57,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:22:57,647 INFO L85 PathProgramCache]: Analyzing trace with hash 86844689, now seen corresponding path program 3 times [2025-01-09 22:22:57,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:22:57,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550902750] [2025-01-09 22:22:57,647 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:22:57,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:22:57,655 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 5 equivalence classes. [2025-01-09 22:22:57,671 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:22:57,671 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-09 22:22:57,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:58,104 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:58,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:22:58,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550902750] [2025-01-09 22:22:58,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550902750] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:22:58,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604898414] [2025-01-09 22:22:58,105 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 22:22:58,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:22:58,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:22:58,107 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:22:58,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 22:22:58,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 5 equivalence classes. [2025-01-09 22:22:58,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:22:58,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-01-09 22:22:58,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:22:58,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-01-09 22:22:58,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:22:58,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:22:58,241 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 [2025-01-09 22:22:58,259 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:22:58,260 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 [2025-01-09 22:22:58,264 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 [2025-01-09 22:22:58,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-01-09 22:22:58,287 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 13 treesize of output 9 [2025-01-09 22:22:58,385 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:22:58,385 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 52 treesize of output 49 [2025-01-09 22:22:58,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:22:58,389 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 30 treesize of output 13 [2025-01-09 22:22:58,462 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:22:58,462 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 52 treesize of output 49 [2025-01-09 22:22:58,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:22:58,465 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 30 treesize of output 13 [2025-01-09 22:22:58,546 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:22:58,546 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 52 treesize of output 49 [2025-01-09 22:22:58,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:22:58,551 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 30 treesize of output 13 [2025-01-09 22:22:58,637 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-01-09 22:22:58,637 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 52 treesize of output 49 [2025-01-09 22:22:58,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:22:58,641 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 30 treesize of output 13 [2025-01-09 22:22:58,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-01-09 22:22:58,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-01-09 22:22:58,711 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:22:58,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:22:58,927 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_930)) (.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_929) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< (select |c_#length| .cse0) (+ (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 8)) (forall ((v_ArrVal_932 (Array Int Int))) (<= 0 (+ .cse3 (select (select (store .cse1 .cse0 v_ArrVal_932) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 8)))))) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_929))) (let ((.cse5 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_930)) (.cse4 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< (select |c_#length| .cse4) (+ (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 8)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (<= (+ .cse3 (select (select (store .cse5 .cse4 v_ArrVal_932) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_931) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))))) is different from false [2025-01-09 22:22:58,953 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse3 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_929))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_930)) (.cse0 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< (select |c_#length| .cse0) (+ (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 8)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (<= (+ .cse3 12 (select (select (store .cse1 .cse0 v_ArrVal_932) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse0 v_ArrVal_931) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_930)) (.cse6 (select (select (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_929) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< (select |c_#length| .cse6) (+ (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 8)) (forall ((v_ArrVal_932 (Array Int Int))) (<= 0 (+ .cse3 8 (select (select (store .cse7 .cse6 v_ArrVal_932) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))))) is different from false [2025-01-09 22:22:58,979 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse3 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_930)) (.cse0 (select (select (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_929) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< (select |c_#length| .cse0) (+ (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 12)) (forall ((v_ArrVal_932 (Array Int Int))) (<= 0 (+ .cse3 12 (select (select (store .cse1 .cse0 v_ArrVal_932) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_929))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse5 (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_930))) (or (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (<= (+ .cse3 16 (select (select (store .cse5 .cse6 v_ArrVal_932) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_931) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (< (select |c_#length| .cse6) (+ (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 12))))))))) is different from false [2025-01-09 22:22:58,997 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_927))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse4 (store .cse6 .cse5 v_ArrVal_929))) (let ((.cse1 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_928) .cse5 v_ArrVal_930)) (.cse0 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< (select |c_#length| .cse0) (+ (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 12)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (<= (+ .cse3 (select (select (store .cse1 .cse0 v_ArrVal_932) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 16) (select |c_#length| (select (select (store .cse4 .cse0 v_ArrVal_931) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))))))))) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse9 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_927))) (let ((.cse10 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse8 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_928) .cse10 v_ArrVal_930)) (.cse7 (select (select (store .cse9 .cse10 v_ArrVal_929) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< (select |c_#length| .cse7) (+ (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 12)) (forall ((v_ArrVal_932 (Array Int Int))) (<= 0 (+ .cse3 (select (select (store .cse8 .cse7 v_ArrVal_932) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 12)))))))))) is different from false [2025-01-09 22:22:59,028 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_927))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse2 (store (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_928) .cse5 v_ArrVal_930)) (.cse0 (select (select (store .cse4 .cse5 v_ArrVal_929) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (or (< (select |c_#length| .cse0) (+ .cse1 12 (select (select .cse2 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (forall ((v_ArrVal_932 (Array Int Int))) (<= 0 (+ .cse1 12 (select (select (store .cse2 .cse0 v_ArrVal_932) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))))) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse6 v_ArrVal_927))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse9 (store .cse11 .cse10 v_ArrVal_929))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (.cse7 (store (store |c_#memory_$Pointer$#1.offset| .cse6 v_ArrVal_928) .cse10 v_ArrVal_930))) (or (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (<= (+ .cse1 16 (select (select (store .cse7 .cse8 v_ArrVal_932) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_931) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (< (select |c_#length| .cse8) (+ .cse1 12 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))))))))) is different from false [2025-01-09 22:22:59,062 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_927))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse2 (select (select (store .cse6 .cse5 v_ArrVal_929) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (.cse1 (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_928) .cse5 v_ArrVal_930))) (or (forall ((v_ArrVal_932 (Array Int Int))) (<= 0 (+ .cse0 16 (select (select (store .cse1 .cse2 v_ArrVal_932) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (< (select |c_#length| .cse2) (+ .cse0 16 (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse11 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_927))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse9 (store .cse11 .cse10 v_ArrVal_929))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (.cse7 (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_928) .cse10 v_ArrVal_930))) (or (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (<= (+ .cse0 20 (select (select (store .cse7 .cse8 v_ArrVal_932) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse9 .cse8 v_ArrVal_931) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (< (select |c_#length| .cse8) (+ .cse0 16 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))))))))) is different from false [2025-01-09 22:22:59,088 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_926 (Array Int Int)) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_925))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_927))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse2 (select (select (store .cse6 .cse5 v_ArrVal_929) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (.cse1 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_926) .cse4 v_ArrVal_928) .cse5 v_ArrVal_930))) (or (forall ((v_ArrVal_932 (Array Int Int))) (<= 0 (+ .cse0 16 (select (select (store .cse1 .cse2 v_ArrVal_932) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (< (select |c_#length| .cse2) (+ .cse0 16 (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_926 (Array Int Int)) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_925))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_927))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse10 (store .cse13 .cse12 v_ArrVal_929))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (.cse8 (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_926) .cse11 v_ArrVal_928) .cse12 v_ArrVal_930))) (or (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (<= (+ .cse0 (select (select (store .cse8 .cse9 v_ArrVal_932) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 20) (select |c_#length| (select (select (store .cse10 .cse9 v_ArrVal_931) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (< (select |c_#length| .cse9) (+ .cse0 16 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))))))))))))) is different from false [2025-01-09 22:22:59,206 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse3 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_926 (Array Int Int)) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_925))) (let ((.cse5 (select (select .cse8 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse7 (store .cse8 .cse5 v_ArrVal_927))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse1 (select (select (store .cse7 .cse6 v_ArrVal_929) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse0 (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_926) .cse5 v_ArrVal_928) .cse6 v_ArrVal_930))) (or (forall ((v_ArrVal_932 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 .cse1 v_ArrVal_932) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 16))) (< (select |c_#length| .cse1) (+ .cse3 (select (select .cse0 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 16))))))))) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_926 (Array Int Int)) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse15 (store |c_#memory_$Pointer$#1.base| .cse4 v_ArrVal_925))) (let ((.cse12 (select (select .cse15 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse14 (store .cse15 .cse12 v_ArrVal_927))) (let ((.cse13 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse11 (store .cse14 .cse13 v_ArrVal_929))) (let ((.cse10 (select (select .cse11 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)) (.cse9 (store (store (store |c_#memory_$Pointer$#1.offset| .cse4 v_ArrVal_926) .cse12 v_ArrVal_928) .cse13 v_ArrVal_930))) (or (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (<= (+ (select (select (store .cse9 .cse10 v_ArrVal_932) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) .cse3 20) (select |c_#length| (select (select (store .cse11 .cse10 v_ArrVal_931) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2)))) (< (select |c_#length| .cse10) (+ .cse3 (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 16))))))))))))) is different from false [2025-01-09 22:22:59,248 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (and (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_926 (Array Int Int)) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_925))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse3 (store .cse7 .cse6 v_ArrVal_927))) (let ((.cse4 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse1 (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_926) .cse6 v_ArrVal_928) .cse4 v_ArrVal_930)) (.cse0 (select (select (store .cse3 .cse4 v_ArrVal_929) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< (select |c_#length| .cse0) (+ (select (select .cse1 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 16)) (forall ((v_ArrVal_932 (Array Int Int))) (<= 0 (+ (select (select (store .cse1 .cse0 v_ArrVal_932) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 16)))))))))) (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_926 (Array Int Int)) (v_ArrVal_925 (Array Int Int)) (v_ArrVal_928 (Array Int Int)) (v_ArrVal_927 (Array Int Int)) (v_ArrVal_929 (Array Int Int))) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| .cse5 v_ArrVal_925))) (let ((.cse11 (select (select .cse14 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse13 (store .cse14 .cse11 v_ArrVal_927))) (let ((.cse12 (select (select .cse13 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (let ((.cse10 (store .cse13 .cse12 v_ArrVal_929))) (let ((.cse9 (store (store (store |c_#memory_$Pointer$#1.offset| .cse5 v_ArrVal_926) .cse11 v_ArrVal_928) .cse12 v_ArrVal_930)) (.cse8 (select (select .cse10 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))) (or (< (select |c_#length| .cse8) (+ (select (select .cse9 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 16)) (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (<= (+ (select (select (store .cse9 .cse8 v_ArrVal_932) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2) 20) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_931) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse2))))))))))))))) is different from false [2025-01-09 22:22:59,259 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:59,259 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 356 treesize of output 346 [2025-01-09 22:22:59,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:59,264 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 336 treesize of output 206 [2025-01-09 22:22:59,279 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 79729 treesize of output 72463 [2025-01-09 22:22:59,345 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 9871 treesize of output 9661 [2025-01-09 22:22:59,358 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 378 treesize of output 342 [2025-01-09 22:22:59,365 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 342 treesize of output 318 [2025-01-09 22:22:59,375 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 114 treesize of output 94 [2025-01-09 22:22:59,380 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 170 treesize of output 158 [2025-01-09 22:22:59,384 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 90 treesize of output 82 [2025-01-09 22:22:59,387 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 278 treesize of output 234 [2025-01-09 22:22:59,391 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 161 treesize of output 153 [2025-01-09 22:22:59,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:59,464 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 531 treesize of output 521 [2025-01-09 22:22:59,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:22:59,472 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 511 treesize of output 301 [2025-01-09 22:22:59,478 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:59,491 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 7079 treesize of output 5297 [2025-01-09 22:22:59,516 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:22:59,523 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 1848 treesize of output 1740 [2025-01-09 22:22:59,547 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 324 treesize of output 272 [2025-01-09 22:22:59,555 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 236 treesize of output 220 [2025-01-09 22:22:59,563 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 256 treesize of output 212 [2025-01-09 22:22:59,589 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 212 treesize of output 196 [2025-01-09 22:22:59,597 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 168 treesize of output 156 [2025-01-09 22:22:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 41 not checked. [2025-01-09 22:22:59,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604898414] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:22:59,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:22:59,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 18] total 45 [2025-01-09 22:22:59,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849311792] [2025-01-09 22:22:59,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:22:59,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-01-09 22:22:59,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:22:59,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-01-09 22:22:59,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1123, Unknown=10, NotChecked=702, Total=2070 [2025-01-09 22:22:59,752 INFO L87 Difference]: Start difference. First operand 176 states and 199 transitions. Second operand has 46 states, 45 states have (on average 2.0) internal successors, (90), 46 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) [2025-01-09 22:23:00,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:00,866 INFO L93 Difference]: Finished difference Result 194 states and 218 transitions. [2025-01-09 22:23:00,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 22:23:00,866 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.0) internal successors, (90), 46 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-01-09 22:23:00,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:00,867 INFO L225 Difference]: With dead ends: 194 [2025-01-09 22:23:00,867 INFO L226 Difference]: Without dead ends: 194 [2025-01-09 22:23:00,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=542, Invalid=2346, Unknown=10, NotChecked=1008, Total=3906 [2025-01-09 22:23:00,868 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 79 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 10 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 678 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:00,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1145 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 897 Invalid, 5 Unknown, 678 Unchecked, 0.5s Time] [2025-01-09 22:23:00,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-01-09 22:23:00,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2025-01-09 22:23:00,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 174 states have (on average 1.235632183908046) internal successors, (215), 190 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:00,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 215 transitions. [2025-01-09 22:23:00,871 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 215 transitions. Word has length 34 [2025-01-09 22:23:00,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:00,871 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 215 transitions. [2025-01-09 22:23:00,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.0) internal successors, (90), 46 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) [2025-01-09 22:23:00,871 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 215 transitions. [2025-01-09 22:23:00,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-09 22:23:00,872 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:00,872 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:00,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 22:23:01,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-01-09 22:23:01,072 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:23:01,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:01,073 INFO L85 PathProgramCache]: Analyzing trace with hash -231975872, now seen corresponding path program 1 times [2025-01-09 22:23:01,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:01,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683235896] [2025-01-09 22:23:01,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:01,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:01,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 22:23:01,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 22:23:01,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:01,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:01,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:01,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:01,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683235896] [2025-01-09 22:23:01,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683235896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:01,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:01,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 22:23:01,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205148920] [2025-01-09 22:23:01,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:01,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 22:23:01,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:01,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 22:23:01,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-01-09 22:23:01,294 INFO L87 Difference]: Start difference. First operand 191 states and 215 transitions. Second operand has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:01,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:01,522 INFO L93 Difference]: Finished difference Result 211 states and 229 transitions. [2025-01-09 22:23:01,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 22:23:01,522 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2025-01-09 22:23:01,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:01,523 INFO L225 Difference]: With dead ends: 211 [2025-01-09 22:23:01,523 INFO L226 Difference]: Without dead ends: 211 [2025-01-09 22:23:01,524 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2025-01-09 22:23:01,524 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 128 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:01,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 298 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:23:01,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2025-01-09 22:23:01,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 193. [2025-01-09 22:23:01,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 176 states have (on average 1.2329545454545454) internal successors, (217), 192 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:01,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 217 transitions. [2025-01-09 22:23:01,529 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 217 transitions. Word has length 34 [2025-01-09 22:23:01,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:01,529 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 217 transitions. [2025-01-09 22:23:01,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:01,530 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 217 transitions. [2025-01-09 22:23:01,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-09 22:23:01,530 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:01,530 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:01,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 22:23:01,530 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:23:01,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:01,530 INFO L85 PathProgramCache]: Analyzing trace with hash -559614942, now seen corresponding path program 1 times [2025-01-09 22:23:01,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:01,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842741259] [2025-01-09 22:23:01,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:01,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:01,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 22:23:01,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 22:23:01,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:01,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:01,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:01,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:01,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842741259] [2025-01-09 22:23:01,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842741259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:01,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:01,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 22:23:01,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407759827] [2025-01-09 22:23:01,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:01,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 22:23:01,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:01,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 22:23:01,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-01-09 22:23:01,783 INFO L87 Difference]: Start difference. First operand 193 states and 217 transitions. Second operand has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:02,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:02,098 INFO L93 Difference]: Finished difference Result 202 states and 217 transitions. [2025-01-09 22:23:02,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 22:23:02,099 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-01-09 22:23:02,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:02,099 INFO L225 Difference]: With dead ends: 202 [2025-01-09 22:23:02,099 INFO L226 Difference]: Without dead ends: 202 [2025-01-09 22:23:02,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2025-01-09 22:23:02,100 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 62 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:02,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 360 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:23:02,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-01-09 22:23:02,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 193. [2025-01-09 22:23:02,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 176 states have (on average 1.2159090909090908) internal successors, (214), 192 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:02,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 214 transitions. [2025-01-09 22:23:02,103 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 214 transitions. Word has length 36 [2025-01-09 22:23:02,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:02,103 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 214 transitions. [2025-01-09 22:23:02,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:02,103 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 214 transitions. [2025-01-09 22:23:02,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-01-09 22:23:02,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:02,104 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:02,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 22:23:02,104 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:23:02,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:02,104 INFO L85 PathProgramCache]: Analyzing trace with hash -190723131, now seen corresponding path program 1 times [2025-01-09 22:23:02,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:02,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561117292] [2025-01-09 22:23:02,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:02,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:02,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 22:23:02,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 22:23:02,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:02,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:02,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:02,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:02,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561117292] [2025-01-09 22:23:02,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561117292] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:02,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:02,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 22:23:02,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766196307] [2025-01-09 22:23:02,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:02,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 22:23:02,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:02,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 22:23:02,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-01-09 22:23:02,341 INFO L87 Difference]: Start difference. First operand 193 states and 214 transitions. Second operand has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:02,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:02,736 INFO L93 Difference]: Finished difference Result 261 states and 282 transitions. [2025-01-09 22:23:02,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 22:23:02,736 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2025-01-09 22:23:02,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:02,737 INFO L225 Difference]: With dead ends: 261 [2025-01-09 22:23:02,737 INFO L226 Difference]: Without dead ends: 261 [2025-01-09 22:23:02,737 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=638, Unknown=0, NotChecked=0, Total=756 [2025-01-09 22:23:02,738 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 96 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:02,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 555 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 640 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:23:02,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-01-09 22:23:02,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 196. [2025-01-09 22:23:02,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 179 states have (on average 1.2122905027932962) internal successors, (217), 195 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:02,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 217 transitions. [2025-01-09 22:23:02,744 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 217 transitions. Word has length 37 [2025-01-09 22:23:02,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:02,744 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 217 transitions. [2025-01-09 22:23:02,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:02,745 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 217 transitions. [2025-01-09 22:23:02,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 22:23:02,745 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:02,745 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:02,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 22:23:02,745 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:23:02,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:02,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1617449597, now seen corresponding path program 1 times [2025-01-09 22:23:02,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:02,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275968732] [2025-01-09 22:23:02,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:02,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:02,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 22:23:02,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 22:23:02,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:02,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:02,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:02,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:02,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275968732] [2025-01-09 22:23:02,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275968732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:02,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:02,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 22:23:02,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549674790] [2025-01-09 22:23:02,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:02,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 22:23:02,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:02,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 22:23:02,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:23:02,984 INFO L87 Difference]: Start difference. First operand 196 states and 217 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:03,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:03,085 INFO L93 Difference]: Finished difference Result 206 states and 220 transitions. [2025-01-09 22:23:03,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 22:23:03,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 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 [2025-01-09 22:23:03,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:03,086 INFO L225 Difference]: With dead ends: 206 [2025-01-09 22:23:03,086 INFO L226 Difference]: Without dead ends: 206 [2025-01-09 22:23:03,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 22:23:03,086 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 134 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:03,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 158 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:23:03,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-01-09 22:23:03,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 192. [2025-01-09 22:23:03,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 175 states have (on average 1.2228571428571429) internal successors, (214), 191 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:03,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 214 transitions. [2025-01-09 22:23:03,091 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 214 transitions. Word has length 38 [2025-01-09 22:23:03,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:03,092 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 214 transitions. [2025-01-09 22:23:03,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:03,092 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 214 transitions. [2025-01-09 22:23:03,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-09 22:23:03,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:03,093 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:03,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 22:23:03,097 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:23:03,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:03,097 INFO L85 PathProgramCache]: Analyzing trace with hash -919042267, now seen corresponding path program 1 times [2025-01-09 22:23:03,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:03,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513050430] [2025-01-09 22:23:03,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:03,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:03,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 22:23:03,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 22:23:03,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:03,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:03,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:03,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:03,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513050430] [2025-01-09 22:23:03,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513050430] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:03,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:03,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 22:23:03,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895993844] [2025-01-09 22:23:03,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:03,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 22:23:03,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:03,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 22:23:03,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-01-09 22:23:03,398 INFO L87 Difference]: Start difference. First operand 192 states and 214 transitions. Second operand has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:03,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:03,670 INFO L93 Difference]: Finished difference Result 199 states and 213 transitions. [2025-01-09 22:23:03,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:23:03,670 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 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 [2025-01-09 22:23:03,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:03,671 INFO L225 Difference]: With dead ends: 199 [2025-01-09 22:23:03,671 INFO L226 Difference]: Without dead ends: 199 [2025-01-09 22:23:03,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=703, Unknown=0, NotChecked=0, Total=870 [2025-01-09 22:23:03,671 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 182 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:03,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 231 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:23:03,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-01-09 22:23:03,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 192. [2025-01-09 22:23:03,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 175 states have (on average 1.217142857142857) internal successors, (213), 191 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:03,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 213 transitions. [2025-01-09 22:23:03,674 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 213 transitions. Word has length 38 [2025-01-09 22:23:03,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:03,674 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 213 transitions. [2025-01-09 22:23:03,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.235294117647059) internal successors, (38), 18 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:03,674 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 213 transitions. [2025-01-09 22:23:03,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-09 22:23:03,675 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:03,675 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:03,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 22:23:03,675 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:23:03,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:03,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1228436160, now seen corresponding path program 1 times [2025-01-09 22:23:03,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:03,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747729274] [2025-01-09 22:23:03,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:03,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:03,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 22:23:03,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 22:23:03,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:03,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:04,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:04,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747729274] [2025-01-09 22:23:04,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747729274] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:04,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:04,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 22:23:04,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240750290] [2025-01-09 22:23:04,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:04,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 22:23:04,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:04,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 22:23:04,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-01-09 22:23:04,090 INFO L87 Difference]: Start difference. First operand 192 states and 213 transitions. Second operand has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:04,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:04,662 INFO L93 Difference]: Finished difference Result 269 states and 291 transitions. [2025-01-09 22:23:04,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 22:23:04,662 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-01-09 22:23:04,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:04,663 INFO L225 Difference]: With dead ends: 269 [2025-01-09 22:23:04,663 INFO L226 Difference]: Without dead ends: 269 [2025-01-09 22:23:04,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=1357, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 22:23:04,664 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 127 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:04,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 670 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:23:04,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-01-09 22:23:04,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 183. [2025-01-09 22:23:04,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 166 states have (on average 1.216867469879518) internal successors, (202), 182 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:04,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 202 transitions. [2025-01-09 22:23:04,669 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 202 transitions. Word has length 41 [2025-01-09 22:23:04,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:04,669 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 202 transitions. [2025-01-09 22:23:04,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 20 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:04,669 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 202 transitions. [2025-01-09 22:23:04,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-09 22:23:04,669 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:04,670 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:04,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 22:23:04,670 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:23:04,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:04,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1563712494, now seen corresponding path program 1 times [2025-01-09 22:23:04,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:04,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720733468] [2025-01-09 22:23:04,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:04,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:04,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:23:04,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:23:04,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:04,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:05,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:05,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:05,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720733468] [2025-01-09 22:23:05,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720733468] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:05,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201606182] [2025-01-09 22:23:05,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:05,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:05,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:05,442 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:23:05,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 22:23:05,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 22:23:05,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 22:23:05,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:05,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:05,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-01-09 22:23:05,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:05,610 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 [2025-01-09 22:23:05,655 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 22:23:05,655 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 [2025-01-09 22:23:05,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:23:05,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:23:05,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 22:23:05,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 22:23:05,845 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 20 treesize of output 15 [2025-01-09 22:23:05,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-01-09 22:23:05,898 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-01-09 22:23:05,898 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 23 treesize of output 15 [2025-01-09 22:23:06,516 INFO L349 Elim1Store]: treesize reduction 24, result has 86.9 percent of original size [2025-01-09 22:23:06,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 145 treesize of output 226 [2025-01-09 22:23:06,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:23:06,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 74 [2025-01-09 22:23:07,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-01-09 22:23:07,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:07,791 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 22:23:07,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201606182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:07,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 22:23:07,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [17] total 36 [2025-01-09 22:23:07,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182832810] [2025-01-09 22:23:07,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:07,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 22:23:07,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:07,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 22:23:07,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1167, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 22:23:07,793 INFO L87 Difference]: Start difference. First operand 183 states and 202 transitions. Second operand has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:08,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:08,264 INFO L93 Difference]: Finished difference Result 276 states and 300 transitions. [2025-01-09 22:23:08,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 22:23:08,265 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2025-01-09 22:23:08,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:08,265 INFO L225 Difference]: With dead ends: 276 [2025-01-09 22:23:08,266 INFO L226 Difference]: Without dead ends: 270 [2025-01-09 22:23:08,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=162, Invalid=1908, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 22:23:08,267 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 87 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:08,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 424 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 22:23:08,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-01-09 22:23:08,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 205. [2025-01-09 22:23:08,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 188 states have (on average 1.202127659574468) internal successors, (226), 204 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 226 transitions. [2025-01-09 22:23:08,273 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 226 transitions. Word has length 43 [2025-01-09 22:23:08,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:08,273 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 226 transitions. [2025-01-09 22:23:08,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.15) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:08,273 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 226 transitions. [2025-01-09 22:23:08,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:23:08,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:08,273 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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] [2025-01-09 22:23:08,280 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 22:23:08,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:08,474 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:23:08,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:08,475 INFO L85 PathProgramCache]: Analyzing trace with hash -244404737, now seen corresponding path program 1 times [2025-01-09 22:23:08,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:08,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962348708] [2025-01-09 22:23:08,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:08,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:08,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:23:08,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:23:08,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:08,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:08,807 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:08,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:08,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962348708] [2025-01-09 22:23:08,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962348708] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:08,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [198732555] [2025-01-09 22:23:08,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:08,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:08,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:08,810 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:23:08,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 22:23:08,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:23:08,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:23:08,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:08,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:08,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-01-09 22:23:08,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:09,004 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 [2025-01-09 22:23:09,083 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 15 treesize of output 11 [2025-01-09 22:23:09,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-01-09 22:23:09,181 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 39 treesize of output 16 [2025-01-09 22:23:09,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:23:09,231 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 30 treesize of output 20 [2025-01-09 22:23:09,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-01-09 22:23:09,331 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 [2025-01-09 22:23:09,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-01-09 22:23:09,354 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:09,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:09,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-01-09 22:23:09,550 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 358 treesize of output 326 [2025-01-09 22:23:09,638 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 30 treesize of output 26 [2025-01-09 22:23:09,700 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:09,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [198732555] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:09,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:09,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 16] total 36 [2025-01-09 22:23:09,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611749574] [2025-01-09 22:23:09,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:09,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-01-09 22:23:09,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:09,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-01-09 22:23:09,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1117, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 22:23:09,701 INFO L87 Difference]: Start difference. First operand 205 states and 226 transitions. Second operand has 36 states, 36 states have (on average 3.2777777777777777) internal successors, (118), 36 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:10,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:10,253 INFO L93 Difference]: Finished difference Result 315 states and 347 transitions. [2025-01-09 22:23:10,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 22:23:10,253 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 3.2777777777777777) internal successors, (118), 36 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-01-09 22:23:10,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:10,254 INFO L225 Difference]: With dead ends: 315 [2025-01-09 22:23:10,254 INFO L226 Difference]: Without dead ends: 315 [2025-01-09 22:23:10,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=332, Invalid=1924, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 22:23:10,255 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 234 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1562 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:10,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1562 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 22:23:10,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-01-09 22:23:10,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 214. [2025-01-09 22:23:10,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 197 states have (on average 1.1928934010152283) internal successors, (235), 213 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:10,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 235 transitions. [2025-01-09 22:23:10,258 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 235 transitions. Word has length 44 [2025-01-09 22:23:10,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:10,258 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 235 transitions. [2025-01-09 22:23:10,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 3.2777777777777777) internal successors, (118), 36 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:10,258 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 235 transitions. [2025-01-09 22:23:10,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:23:10,258 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:10,258 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:10,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 22:23:10,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-01-09 22:23:10,459 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:23:10,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:10,459 INFO L85 PathProgramCache]: Analyzing trace with hash -244408609, now seen corresponding path program 1 times [2025-01-09 22:23:10,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:10,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930309440] [2025-01-09 22:23:10,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:10,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:10,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:23:10,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:23:10,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:10,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:10,802 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:10,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:10,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930309440] [2025-01-09 22:23:10,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930309440] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:10,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1483252989] [2025-01-09 22:23:10,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:10,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:10,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:10,804 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:23:10,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 22:23:10,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:23:10,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:23:10,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:10,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:10,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-01-09 22:23:10,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:10,945 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 [2025-01-09 22:23:11,017 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 15 treesize of output 1 [2025-01-09 22:23:11,049 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-01-09 22:23:11,049 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 23 treesize of output 24 [2025-01-09 22:23:11,119 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 11 [2025-01-09 22:23:11,201 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 27 treesize of output 15 [2025-01-09 22:23:11,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 25 [2025-01-09 22:23:11,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:23:11,316 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 47 treesize of output 29 [2025-01-09 22:23:11,440 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 45 treesize of output 37 [2025-01-09 22:23:11,515 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 22 treesize of output 9 [2025-01-09 22:23:11,540 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 28 treesize of output 8 [2025-01-09 22:23:11,570 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 17 treesize of output 9 [2025-01-09 22:23:11,571 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:11,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:11,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-01-09 22:23:11,810 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 486 treesize of output 454 [2025-01-09 22:23:12,017 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 38 treesize of output 34 [2025-01-09 22:23:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:12,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1483252989] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:12,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:12,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 16] total 40 [2025-01-09 22:23:12,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40407851] [2025-01-09 22:23:12,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:12,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-09 22:23:12,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:12,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-09 22:23:12,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1466, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 22:23:12,302 INFO L87 Difference]: Start difference. First operand 214 states and 235 transitions. Second operand has 41 states, 40 states have (on average 3.0) internal successors, (120), 41 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:13,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:13,330 INFO L93 Difference]: Finished difference Result 311 states and 340 transitions. [2025-01-09 22:23:13,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 22:23:13,330 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.0) internal successors, (120), 41 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-01-09 22:23:13,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:13,331 INFO L225 Difference]: With dead ends: 311 [2025-01-09 22:23:13,331 INFO L226 Difference]: Without dead ends: 311 [2025-01-09 22:23:13,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=393, Invalid=2469, Unknown=0, NotChecked=0, Total=2862 [2025-01-09 22:23:13,332 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 241 mSDsluCounter, 1260 mSDsCounter, 0 mSdLazyCounter, 1394 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 1332 SdHoareTripleChecker+Invalid, 1415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:13,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 1332 Invalid, 1415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1394 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 22:23:13,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-01-09 22:23:13,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 216. [2025-01-09 22:23:13,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 199 states have (on average 1.1959798994974875) internal successors, (238), 215 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 238 transitions. [2025-01-09 22:23:13,334 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 238 transitions. Word has length 44 [2025-01-09 22:23:13,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:13,335 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 238 transitions. [2025-01-09 22:23:13,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.0) internal successors, (120), 41 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:13,335 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 238 transitions. [2025-01-09 22:23:13,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-09 22:23:13,335 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:13,335 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:13,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 22:23:13,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-01-09 22:23:13,539 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:23:13,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:13,539 INFO L85 PathProgramCache]: Analyzing trace with hash -244408608, now seen corresponding path program 1 times [2025-01-09 22:23:13,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:13,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659831977] [2025-01-09 22:23:13,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:13,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:13,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:23:13,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:23:13,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:13,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:14,012 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:14,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:14,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659831977] [2025-01-09 22:23:14,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659831977] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:14,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122476013] [2025-01-09 22:23:14,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:14,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:14,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:14,015 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:23:14,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-09 22:23:14,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 22:23:14,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 22:23:14,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:14,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:14,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-01-09 22:23:14,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:14,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 22:23:14,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-01-09 22:23:14,274 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 [2025-01-09 22:23:14,280 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 15 treesize of output 1 [2025-01-09 22:23:14,323 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-01-09 22:23:14,323 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 21 [2025-01-09 22:23:14,338 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 22:23:14,338 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 15 treesize of output 15 [2025-01-09 22:23:14,375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 22:23:14,422 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 11 [2025-01-09 22:23:14,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 22:23:14,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 22:23:14,532 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 27 treesize of output 15 [2025-01-09 22:23:14,575 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 52 treesize of output 25 [2025-01-09 22:23:14,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:23:14,649 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 47 treesize of output 29 [2025-01-09 22:23:14,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:23:14,659 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 29 treesize of output 19 [2025-01-09 22:23:14,926 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 28 treesize of output 8 [2025-01-09 22:23:14,929 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 19 treesize of output 11 [2025-01-09 22:23:14,962 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 17 treesize of output 9 [2025-01-09 22:23:14,979 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:14,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:15,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-01-09 22:23:15,342 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 614 treesize of output 582 [2025-01-09 22:23:15,346 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 465 treesize of output 401 [2025-01-09 22:23:15,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 22:23:15,575 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 66 treesize of output 62 [2025-01-09 22:23:15,577 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 102 treesize of output 94 [2025-01-09 22:23:15,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2025-01-09 22:23:15,782 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:15,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122476013] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:15,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:15,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16, 15] total 43 [2025-01-09 22:23:15,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155166579] [2025-01-09 22:23:15,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:15,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-01-09 22:23:15,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:15,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-01-09 22:23:15,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1744, Unknown=0, NotChecked=0, Total=1892 [2025-01-09 22:23:15,787 INFO L87 Difference]: Start difference. First operand 216 states and 238 transitions. Second operand has 44 states, 43 states have (on average 3.0) internal successors, (129), 44 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:17,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:17,294 INFO L93 Difference]: Finished difference Result 320 states and 349 transitions. [2025-01-09 22:23:17,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 22:23:17,294 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 3.0) internal successors, (129), 44 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44 [2025-01-09 22:23:17,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:17,295 INFO L225 Difference]: With dead ends: 320 [2025-01-09 22:23:17,295 INFO L226 Difference]: Without dead ends: 320 [2025-01-09 22:23:17,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 689 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=532, Invalid=3628, Unknown=0, NotChecked=0, Total=4160 [2025-01-09 22:23:17,297 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 487 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 1507 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 1426 SdHoareTripleChecker+Invalid, 1551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:17,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 1426 Invalid, 1551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1507 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 22:23:17,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2025-01-09 22:23:17,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 216. [2025-01-09 22:23:17,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 199 states have (on average 1.185929648241206) internal successors, (236), 215 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:17,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 236 transitions. [2025-01-09 22:23:17,303 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 236 transitions. Word has length 44 [2025-01-09 22:23:17,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:17,303 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 236 transitions. [2025-01-09 22:23:17,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 3.0) internal successors, (129), 44 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:17,303 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 236 transitions. [2025-01-09 22:23:17,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 22:23:17,303 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:17,303 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:17,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-09 22:23:17,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:17,504 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:23:17,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:17,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1207246370, now seen corresponding path program 1 times [2025-01-09 22:23:17,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:17,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031329269] [2025-01-09 22:23:17,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:17,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:17,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:23:17,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:23:17,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:17,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 22:23:17,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:17,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031329269] [2025-01-09 22:23:17,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031329269] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 22:23:17,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 22:23:17,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 22:23:17,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903975373] [2025-01-09 22:23:17,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 22:23:17,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 22:23:17,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:17,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 22:23:17,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 22:23:17,606 INFO L87 Difference]: Start difference. First operand 216 states and 236 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 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) [2025-01-09 22:23:17,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:17,706 INFO L93 Difference]: Finished difference Result 227 states and 246 transitions. [2025-01-09 22:23:17,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 22:23:17,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 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 47 [2025-01-09 22:23:17,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:17,708 INFO L225 Difference]: With dead ends: 227 [2025-01-09 22:23:17,708 INFO L226 Difference]: Without dead ends: 227 [2025-01-09 22:23:17,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 22:23:17,710 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 26 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:17,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 182 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 22:23:17,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-01-09 22:23:17,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 215. [2025-01-09 22:23:17,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 199 states have (on average 1.1809045226130652) internal successors, (235), 214 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:17,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 235 transitions. [2025-01-09 22:23:17,716 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 235 transitions. Word has length 47 [2025-01-09 22:23:17,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:17,717 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 235 transitions. [2025-01-09 22:23:17,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 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) [2025-01-09 22:23:17,717 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 235 transitions. [2025-01-09 22:23:17,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 22:23:17,718 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:17,718 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:17,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 22:23:17,718 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:23:17,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:17,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1207246369, now seen corresponding path program 1 times [2025-01-09 22:23:17,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:17,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513385406] [2025-01-09 22:23:17,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:17,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:17,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:23:17,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:23:17,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:17,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:18,186 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:18,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:18,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513385406] [2025-01-09 22:23:18,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513385406] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:18,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278602621] [2025-01-09 22:23:18,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:18,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:18,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:18,188 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:23:18,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-09 22:23:18,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:23:18,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:23:18,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:18,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:18,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-01-09 22:23:18,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:18,403 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 [2025-01-09 22:23:18,451 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 22:23:18,452 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 22:23:18,478 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 [2025-01-09 22:23:18,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-01-09 22:23:18,562 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 15 treesize of output 1 [2025-01-09 22:23:18,651 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2025-01-09 22:23:18,651 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 29 treesize of output 19 [2025-01-09 22:23:18,783 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 19 treesize of output 11 [2025-01-09 22:23:18,874 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 17 treesize of output 9 [2025-01-09 22:23:18,892 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:18,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 22:23:18,936 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:23:18,937 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 31 treesize of output 35 [2025-01-09 22:23:19,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2025-01-09 22:23:19,116 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 40 treesize of output 36 [2025-01-09 22:23:19,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 22:23:19,328 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 95 treesize of output 99 [2025-01-09 22:23:19,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2025-01-09 22:23:19,353 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 150 treesize of output 144 [2025-01-09 22:23:19,367 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 24 treesize of output 20 [2025-01-09 22:23:19,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2025-01-09 22:23:19,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2025-01-09 22:23:19,615 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:19,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278602621] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 22:23:19,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 22:23:19,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 18] total 47 [2025-01-09 22:23:19,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813837567] [2025-01-09 22:23:19,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 22:23:19,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-01-09 22:23:19,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 22:23:19,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-01-09 22:23:19,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2053, Unknown=0, NotChecked=0, Total=2256 [2025-01-09 22:23:19,618 INFO L87 Difference]: Start difference. First operand 215 states and 235 transitions. Second operand has 48 states, 47 states have (on average 2.9361702127659575) internal successors, (138), 48 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) [2025-01-09 22:23:20,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 22:23:20,334 INFO L93 Difference]: Finished difference Result 263 states and 291 transitions. [2025-01-09 22:23:20,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 22:23:20,334 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 2.9361702127659575) internal successors, (138), 48 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) Word has length 47 [2025-01-09 22:23:20,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 22:23:20,335 INFO L225 Difference]: With dead ends: 263 [2025-01-09 22:23:20,335 INFO L226 Difference]: Without dead ends: 263 [2025-01-09 22:23:20,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1012 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=490, Invalid=3542, Unknown=0, NotChecked=0, Total=4032 [2025-01-09 22:23:20,338 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 396 mSDsluCounter, 1134 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 22:23:20,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 1195 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 22:23:20,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-01-09 22:23:20,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 218. [2025-01-09 22:23:20,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 202 states have (on average 1.1782178217821782) internal successors, (238), 217 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 22:23:20,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 238 transitions. [2025-01-09 22:23:20,341 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 238 transitions. Word has length 47 [2025-01-09 22:23:20,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 22:23:20,341 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 238 transitions. [2025-01-09 22:23:20,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 2.9361702127659575) internal successors, (138), 48 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) [2025-01-09 22:23:20,342 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 238 transitions. [2025-01-09 22:23:20,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-01-09 22:23:20,343 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 22:23:20,343 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 22:23:20,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-01-09 22:23:20,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2025-01-09 22:23:20,544 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-01-09 22:23:20,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 22:23:20,544 INFO L85 PathProgramCache]: Analyzing trace with hash -687217971, now seen corresponding path program 1 times [2025-01-09 22:23:20,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 22:23:20,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243630711] [2025-01-09 22:23:20,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:20,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 22:23:20,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:23:20,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:23:20,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:20,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:22,782 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 22:23:22,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 22:23:22,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243630711] [2025-01-09 22:23:22,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243630711] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 22:23:22,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322230217] [2025-01-09 22:23:22,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 22:23:22,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 22:23:22,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 22:23:22,785 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 22:23:22,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-09 22:23:22,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 22:23:22,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 22:23:22,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 22:23:22,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 22:23:22,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-01-09 22:23:22,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 22:23:23,576 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 15 treesize of output 1 [2025-01-09 22:23:23,717 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-01-09 22:23:23,718 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 23 treesize of output 15 [2025-01-09 22:23:26,297 INFO L349 Elim1Store]: treesize reduction 48, result has 74.1 percent of original size [2025-01-09 22:23:26,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 383 treesize of output 405 [2025-01-09 22:23:45,526 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse31 (select .cse9 |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse4 (= 0 .cse31)) (.cse159 (not (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0)))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0) (let ((.cse16 (= |c_ULTIMATE.start_freeData_~data#1.base| 0)) (.cse22 (select |c_#memory_$Pointer$#2.base| 0)) (.cse10 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~#list~0#1.base|)))) (let ((.cse151 (store |c_ULTIMATE.start_main_old_#valid#1| .cse31 1)) (.cse19 (= |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (.cse142 (exists ((v_prenex_3 Int)) (not (= (select .cse9 v_prenex_3) 0)))) (.cse80 (exists ((v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse216 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse215 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse216 1))) (and (= (select .cse215 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (= .cse216 |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse216 1) 0 0)) (= (select .cse215 0) 0)))))) (.cse3 (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse31)) (.cse32 (store .cse10 .cse31 1)) (.cse27 (select .cse22 |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse11 (select |c_#valid| |c_ULTIMATE.start_freeData_~data#1.base|)) (.cse12 (not .cse16))) (let ((.cse23 (and (exists ((v_prenex_3 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse214 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse213 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse214 1))) (and (= (select .cse213 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= (select .cse9 v_prenex_3) .cse214)) (= .cse214 |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse214 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse11) 0 0)) (= (select .cse213 |c_ULTIMATE.start_freeData_~data#1.base|) 0))))) .cse12)) (.cse50 (exists ((v_arrayElimCell_160 Int) (v_prenex_3 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse212 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse211 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse212 1)) (.cse210 (select .cse9 v_prenex_3))) (and (not (= .cse210 0)) (= (select .cse211 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= .cse212 0)) (= (select .cse211 v_arrayElimCell_160) 0) (not (= .cse210 .cse212)) (not (= v_arrayElimCell_160 0)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse212 1) v_arrayElimCell_160 (select |c_#valid| v_arrayElimCell_160)) 0 0)) (= .cse212 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (.cse51 (exists ((v_prenex_3 Int) (v_arrayElimCell_157 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse206 (select .cse9 v_prenex_3))) (let ((.cse209 (store (store .cse10 .cse206 1) v_arrayElimCell_157 (select |c_#valid| v_arrayElimCell_157)))) (let ((.cse207 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse209 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse206 1)) (.cse208 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (not (= v_arrayElimCell_157 0)) (not (= .cse206 0)) (= (select .cse207 v_arrayElimCell_157) 0) (not (= .cse208 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse206) 0) (= (select .cse207 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse206 .cse208)) (not (= .cse206 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse209 0 0)))))))) (.cse56 (exists ((v_prenex_3 Int) (v_arrayElimCell_157 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse203 (select .cse9 v_prenex_3))) (let ((.cse205 (store (store .cse10 .cse203 1) v_arrayElimCell_157 (select |c_#valid| v_arrayElimCell_157)))) (let ((.cse204 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse205 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse203 1))) (and (not (= v_arrayElimCell_157 0)) (not (= .cse203 0)) (= (select .cse204 v_arrayElimCell_157) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse203) 0) (= (select .cse204 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse203 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (not (= .cse203 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse205 0 0)))))))) (.cse45 (exists ((v_prenex_3 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse202 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse200 (select .cse9 v_prenex_3)) (.cse201 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse202 1))) (and (not (= .cse200 0)) (= (select .cse201 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= .cse200 .cse202)) (= .cse202 |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse202 1) 0 0)) (= (select .cse201 0) 0)))))) (.cse36 (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (not (= (select .cse9 v_prenex_3) (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))))) (.cse24 (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse198 (select .cse9 v_prenex_3)) (.cse199 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (not (= .cse198 .cse199)) (not (= .cse198 .cse31)) (not (= .cse199 .cse31)))))) (.cse25 (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse31) 0)) (.cse28 (store |c_ULTIMATE.start_main_old_#valid#1| .cse27 1)) (.cse33 (= |c_#valid| (store .cse32 0 0))) (.cse35 (not .cse3)) (.cse106 (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse197 (select .cse9 v_prenex_3))) (and (not (= .cse197 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (not (= .cse197 .cse31)))))) (.cse105 (and .cse142 (or .cse80 (exists ((v_arrayElimCell_157 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse196 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse195 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse196 1))) (and (not (= v_arrayElimCell_157 0)) (= (select .cse195 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= .cse196 0)) (= (select .cse195 v_arrayElimCell_157) 0) (= .cse196 |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse196 1) v_arrayElimCell_157 (select |c_#valid| v_arrayElimCell_157)) 0 0))))))))) (.cse37 (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (not (= (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|) 0)))) (.cse104 (exists ((v_prenex_3 Int) (v_arrayElimCell_157 Int)) (let ((.cse192 (select .cse9 v_prenex_3))) (let ((.cse194 (store (store .cse10 .cse192 1) v_arrayElimCell_157 (select |c_#valid| v_arrayElimCell_157)))) (let ((.cse193 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse194 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse192 1))) (and (not (= v_arrayElimCell_157 0)) (not (= .cse192 0)) (= (select .cse193 v_arrayElimCell_157) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse192) 0) (= (select .cse193 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse192 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse194 0 0)))))))) (.cse126 (exists ((v_arrayElimCell_160 Int) (v_prenex_3 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse191 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse190 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse191 1))) (and (= (select .cse190 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= .cse191 0)) (= (select .cse190 v_arrayElimCell_160) 0) (not (= (select .cse9 v_prenex_3) .cse191)) (not (= v_arrayElimCell_160 0)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse191 1) v_arrayElimCell_160 (select |c_#valid| v_arrayElimCell_160)) 0 0)) (= .cse191 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (.cse18 (exists ((v_prenex_3 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse189 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse188 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse189 1))) (and (= (select .cse188 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= (select .cse9 v_prenex_3) .cse189)) (= .cse189 |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse189 1) 0 0)) (= (select .cse188 0) 0)))))) (.cse5 (not (= |c_ULTIMATE.start_freeData_~data#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (.cse17 (not .cse19)) (.cse43 (and .cse12 (exists ((v_prenex_3 Int)) (let ((.cse187 (select .cse9 v_prenex_3))) (let ((.cse186 (store (store .cse10 .cse187 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse11))) (let ((.cse185 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse186 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse187 1))) (and (= (select .cse185 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store .cse186 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse187) 0) (= (select .cse185 |c_ULTIMATE.start_freeData_~data#1.base|) 0)))))))) (.cse44 (and .cse16 .cse80)) (.cse68 (and (exists ((v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse184 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse183 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse184 1))) (and (= (select .cse183 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (= .cse184 |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse184 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse11) 0 0)) (= (select .cse183 |c_ULTIMATE.start_freeData_~data#1.base|) 0))))) .cse12)) (.cse107 (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse182 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (not (= (select .cse9 v_prenex_3) .cse182)) (not (= .cse182 .cse31)))))) (.cse69 (exists ((v_prenex_3 Int)) (not (= (select .cse9 v_prenex_3) .cse31)))) (.cse0 (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (not (= (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|) .cse31)))) (.cse1 (= |c_#valid| (store (store .cse151 |c_ULTIMATE.start_freeData_~data#1.base| .cse11) 0 0))) (.cse2 (exists ((v_prenex_4 Int)) (let ((.cse181 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_4) .cse31 1))) (and (= 0 (select .cse181 |c_ULTIMATE.start_freeData_~data#1.base|)) (= (select .cse181 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_4)))))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 (or (and .cse5 (or (and (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse8 (select .cse9 v_prenex_3))) (let ((.cse7 (store (store .cse10 .cse8 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse11))) (let ((.cse6 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse7 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse8 1))) (and (= (select .cse6 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store .cse7 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse8) 0) (not (= .cse8 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select .cse6 |c_ULTIMATE.start_freeData_~data#1.base|) 0)))))) .cse12) (and (exists ((v_prenex_3 Int) (v_DerPreprocessor_64 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse14 (select .cse9 v_prenex_3))) (let ((.cse13 (store .cse10 .cse14 1))) (let ((.cse15 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse13 0 v_DerPreprocessor_64) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse14 1))) (and (= |c_#valid| (store .cse13 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse14) 0) (= (select .cse15 0) 0) (not (= .cse14 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (not (= .cse14 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse15 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) .cse16)) .cse17) (and .cse16 .cse18) (and .cse19 .cse12 (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int) (v_DerPreprocessor_63 Int)) (let ((.cse21 (select .cse22 v_prenex_3))) (let ((.cse20 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_63) .cse21 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse11) 0)) .cse21 1))) (and (= (select .cse20 0) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse21 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse11) 0 0)) (not (= .cse21 0)) (= (select .cse20 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (not (= .cse21 (select .cse22 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse21) 0)))))) .cse23)) (and .cse24 .cse1 .cse2 .cse3) (and .cse25 (or (and (or (and (exists ((v_DerPreprocessor_51 Int)) (let ((.cse26 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_51) .cse27 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse11) 0)) .cse27 1))) (and (= (select .cse26 0) 1) (= (select .cse26 |c_ULTIMATE.start_freeData_~data#1.base|) 0)))) (= |c_#valid| (store (store .cse28 |c_ULTIMATE.start_freeData_~data#1.base| .cse11) 0 0)) .cse19 .cse12) (and .cse5 (or (let ((.cse30 (store .cse32 |c_ULTIMATE.start_freeData_~data#1.base| .cse11))) (let ((.cse29 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse30 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse31 1))) (and (= (select .cse29 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store .cse30 0 0)) .cse12 (= (select .cse29 |c_ULTIMATE.start_freeData_~data#1.base|) 0)))) (and .cse33 .cse16 (exists ((v_DerPreprocessor_52 Int)) (let ((.cse34 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse32 0 v_DerPreprocessor_52) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse31 1))) (and (= (select .cse34 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse34 0) 0)))))))) .cse35) (and .cse1 .cse2 .cse3))) (and .cse36 .cse1 .cse2 .cse3) (and .cse4 (or (and .cse37 (or (and (exists ((v_prenex_3 Int) (v_DerPreprocessor_73 Int)) (let ((.cse39 (select .cse22 v_prenex_3))) (let ((.cse38 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_73) .cse39 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse11) 0)) .cse39 1))) (and (= (select .cse38 0) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse39 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse11) 0 0)) (not (= .cse39 0)) (= (select .cse38 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse39) 0))))) .cse19 .cse12) (and .cse5 (or (and (exists ((v_prenex_3 Int) (v_DerPreprocessor_74 Int)) (let ((.cse41 (select .cse9 v_prenex_3))) (let ((.cse40 (store .cse10 .cse41 1))) (let ((.cse42 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse40 0 v_DerPreprocessor_74) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse41 1))) (and (= |c_#valid| (store .cse40 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse41) 0) (not (= .cse41 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse42 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse42 0) 0)))))) .cse16) .cse43) .cse17))) .cse44)) (and .cse4 (or .cse45 (and .cse19 (exists ((v_prenex_3 Int) (v_DerPreprocessor_9 Int) (v_arrayElimCell_157 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse47 (select |c_#valid| v_arrayElimCell_157)) (.cse46 (select .cse22 v_prenex_3))) (let ((.cse49 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_9) .cse46 1) v_arrayElimCell_157 .cse47) 0)) .cse46 1)) (.cse48 (select .cse22 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse46 1) v_arrayElimCell_157 .cse47) 0 0)) (not (= .cse48 0)) (= (select .cse49 0) 1) (= (select .cse49 v_arrayElimCell_157) 0) (not (= .cse46 0)) (not (= .cse46 .cse48)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse46) 0)))))) .cse50 (and (or .cse51 (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int) (v_DerPreprocessor_10 Int)) (let ((.cse55 (select .cse9 v_prenex_3))) (let ((.cse53 (store .cse10 .cse55 1))) (let ((.cse54 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|)) (.cse52 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse53 0 v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse55 1))) (and (= (select .cse52 0) 0) (= |c_#valid| (store .cse53 0 0)) (not (= .cse54 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse55) 0) (not (= .cse55 .cse54)) (not (= .cse55 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse52 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))))) .cse17))) (and .cse4 (or (and .cse17 (or .cse56 (exists ((v_DerPreprocessor_56 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse59 (select .cse9 v_prenex_3))) (let ((.cse57 (store .cse10 .cse59 1))) (let ((.cse58 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse57 0 v_DerPreprocessor_56) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse59 1))) (and (= |c_#valid| (store .cse57 0 0)) (= (select .cse58 0) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse59) 0) (not (= .cse59 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (not (= .cse59 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse58 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))))) (and .cse45 .cse16) (and .cse19 (exists ((v_DerPreprocessor_55 Int) (v_prenex_3 Int) (v_arrayElimCell_157 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse61 (select |c_#valid| v_arrayElimCell_157)) (.cse60 (select .cse22 v_prenex_3))) (let ((.cse62 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_55) .cse60 1) v_arrayElimCell_157 .cse61) 0)) .cse60 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse60 1) v_arrayElimCell_157 .cse61) 0 0)) (= (select .cse62 0) 1) (= 0 (select .cse62 v_arrayElimCell_157)) (not (= .cse60 0)) (not (= .cse60 (select .cse22 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse60) 0)))))) .cse23)) (and .cse4 (or (and .cse5 .cse17 (or (and .cse16 (exists ((v_prenex_3 Int) (v_DerPreprocessor_71 Int)) (let ((.cse65 (select .cse9 v_prenex_3))) (let ((.cse63 (store .cse10 .cse65 1))) (let ((.cse64 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse63 0 v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse65 1))) (and (= |c_#valid| (store .cse63 0 0)) (= (select .cse64 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse65) 0) (= (select .cse64 0) 0) (not (= .cse65 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) .cse43)) (and .cse19 .cse12 (exists ((v_prenex_3 Int) (v_DerPreprocessor_70 Int)) (let ((.cse67 (select .cse22 v_prenex_3))) (let ((.cse66 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_70) .cse67 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse11) 0)) .cse67 1))) (and (= (select .cse66 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse67 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse11) 0 0)) (= (select .cse66 0) 1) (not (= .cse67 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse67) 0)))))) .cse44 .cse68)) (and (let ((.cse125 (exists ((v_arrayElimCell_161 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse158 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse157 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse158 1))) (and (= (select .cse157 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= v_arrayElimCell_161 0)) (= .cse158 |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select .cse157 v_arrayElimCell_161) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse158 1) v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)) 0 0))))))) (.cse74 (exists ((v_arrayElimCell_161 Int) (v_prenex_3 Int)) (let ((.cse155 (select .cse9 v_prenex_3))) (let ((.cse154 (store (store .cse10 .cse155 1) v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)))) (let ((.cse156 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse154 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse155 1))) (and (= |c_#valid| (store .cse154 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse155) 0) (not (= v_arrayElimCell_161 0)) (not (= .cse155 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse156 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse156 v_arrayElimCell_161) 0))))))) (.cse70 (or (and (= |c_#valid| (store .cse151 0 0)) (exists ((v_prenex_4 Int)) (let ((.cse152 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_4) .cse31 1))) (and (= (select .cse152 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_4) (= (select .cse152 0) 0))))) (exists ((v_prenex_4 Int) (v_arrayElimCell_161 Int)) (let ((.cse153 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_4) .cse31 1))) (and (= (select .cse153 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_4) (= |c_#valid| (store (store .cse151 v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)) 0 0)) (not (= v_arrayElimCell_161 0)) (= (select .cse153 v_arrayElimCell_161) 0))))))) (or (and .cse69 .cse0 .cse70 .cse3) (and .cse4 (or (and .cse37 (or (and (or (exists ((v_DerPreprocessor_24 Int) (v_prenex_3 Int)) (let ((.cse73 (select .cse9 v_prenex_3))) (let ((.cse71 (store .cse10 .cse73 1))) (let ((.cse72 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse71 0 v_DerPreprocessor_24) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse73 1))) (and (= |c_#valid| (store .cse71 0 0)) (= (select .cse72 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse73) 0) (not (= .cse73 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse72 0) 0)))))) .cse74) .cse17) (and .cse19 (exists ((v_DerPreprocessor_23 Int) (v_arrayElimCell_161 Int) (v_prenex_3 Int)) (let ((.cse77 (select |c_#valid| v_arrayElimCell_161)) (.cse76 (select .cse22 v_prenex_3))) (let ((.cse75 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_23) .cse76 1) v_arrayElimCell_161 .cse77) 0)) .cse76 1))) (and (= (select .cse75 v_arrayElimCell_161) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse76 1) v_arrayElimCell_161 .cse77) 0 0)) (= (select .cse75 0) 1) (not (= .cse76 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse76) 0)))))))) (exists ((v_arrayElimCell_161 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse79 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse78 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse79 1))) (and (= (select .cse78 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= .cse79 0)) (not (= v_arrayElimCell_161 0)) (= .cse79 |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select .cse78 v_arrayElimCell_161) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse79 1) v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)) 0 0)))))) .cse80)) (and .cse0 .cse70 .cse3) (and .cse4 (or .cse45 (and .cse19 (exists ((v_DerPreprocessor_18 Int) (v_prenex_3 Int) (v_arrayElimCell_157 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse82 (select |c_#valid| v_arrayElimCell_157)) (.cse81 (select .cse22 v_prenex_3))) (let ((.cse84 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_18) .cse81 1) v_arrayElimCell_157 .cse82) 0)) .cse81 1)) (.cse83 (select .cse22 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse81 1) v_arrayElimCell_157 .cse82) 0 0)) (not (= .cse83 0)) (= (select .cse84 0) 1) (not (= .cse81 0)) (= (select .cse84 v_arrayElimCell_157) 0) (not (= .cse81 .cse83)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse81) 0)))))) .cse50 (and .cse17 (or .cse51 (exists ((v_prenex_3 Int) (v_DerPreprocessor_19 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse88 (select .cse9 v_prenex_3))) (let ((.cse85 (store .cse10 .cse88 1))) (let ((.cse87 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|)) (.cse86 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse85 0 v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse88 1))) (and (= |c_#valid| (store .cse85 0 0)) (= (select .cse86 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse87 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse88) 0) (not (= .cse88 .cse87)) (not (= .cse88 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse86 0) 0)))))))))) (and .cse4 (or (and .cse17 (or .cse56 (exists ((v_DerPreprocessor_35 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse90 (select .cse9 v_prenex_3))) (let ((.cse89 (store .cse10 .cse90 1))) (let ((.cse91 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse89 0 v_DerPreprocessor_35) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse90 1))) (and (= |c_#valid| (store .cse89 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse90) 0) (not (= .cse90 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select .cse91 0) 0) (= (select .cse91 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse90 |c_ULTIMATE.start_main_~#list~0#1.base|))))))))) .cse45 (and (exists ((v_DerPreprocessor_34 Int) (v_prenex_3 Int) (v_arrayElimCell_157 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse93 (select |c_#valid| v_arrayElimCell_157)) (.cse92 (select .cse22 v_prenex_3))) (let ((.cse94 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_34) .cse92 1) v_arrayElimCell_157 .cse93) 0)) .cse92 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse92 1) v_arrayElimCell_157 .cse93) 0 0)) (= (select .cse94 0) 1) (not (= .cse92 0)) (not (= .cse92 (select .cse22 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse92) 0) (= (select .cse94 v_arrayElimCell_157) 0))))) .cse19) (exists ((v_arrayElimCell_161 Int) (v_prenex_3 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse97 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse95 (select .cse9 v_prenex_3)) (.cse96 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse97 1))) (and (not (= .cse95 0)) (= (select .cse96 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= .cse95 .cse97)) (not (= v_arrayElimCell_161 0)) (= .cse97 |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select .cse96 v_arrayElimCell_161) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse97 1) v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)) 0 0)))))))) (and .cse36 .cse70 .cse3) (and .cse4 (or (and .cse37 (or (and (exists ((v_DerPreprocessor_47 Int) (v_prenex_3 Int) (v_arrayElimCell_157 Int)) (let ((.cse99 (select |c_#valid| v_arrayElimCell_157)) (.cse98 (select .cse22 v_prenex_3))) (let ((.cse100 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_47) .cse98 1) v_arrayElimCell_157 .cse99) 0)) .cse98 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse98 1) v_arrayElimCell_157 .cse99) 0 0)) (= (select .cse100 0) 1) (not (= .cse98 0)) (= (select .cse100 v_arrayElimCell_157) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse98) 0))))) .cse19) (and .cse17 (or (exists ((v_prenex_3 Int) (v_DerPreprocessor_48 Int)) (let ((.cse103 (select .cse9 v_prenex_3))) (let ((.cse101 (store .cse10 .cse103 1))) (let ((.cse102 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse101 0 v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse103 1))) (and (= |c_#valid| (store .cse101 0 0)) (= (select .cse102 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse103) 0) (not (= .cse103 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse102 0) 0)))))) .cse104)))) .cse105)) (and .cse70 .cse3 .cse106) (and .cse69 .cse70 .cse3) (and .cse107 .cse70 .cse3) (and .cse24 .cse70 .cse3) (and .cse4 (or (and (exists ((v_arrayElimCell_161 Int) (v_DerPreprocessor_29 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse110 (select |c_#valid| v_arrayElimCell_161)) (.cse109 (select .cse22 v_prenex_3))) (let ((.cse108 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_29) .cse109 1) v_arrayElimCell_161 .cse110) 0)) .cse109 1))) (and (= (select .cse108 0) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse109 1) v_arrayElimCell_161 .cse110) 0 0)) (not (= .cse109 0)) (= 0 (select .cse108 v_arrayElimCell_161)) (not (= .cse109 (select .cse22 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse109) 0))))) .cse19) .cse18 (and .cse17 (or (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int) (v_DerPreprocessor_30 Int)) (let ((.cse112 (select .cse9 v_prenex_3))) (let ((.cse111 (store .cse10 .cse112 1))) (let ((.cse113 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse111 0 v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse112 1))) (and (= |c_#valid| (store .cse111 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse112) 0) (not (= .cse112 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select .cse113 0) 0) (= (select .cse113 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse112 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (exists ((v_arrayElimCell_161 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse115 (select .cse9 v_prenex_3))) (let ((.cse114 (store (store .cse10 .cse115 1) v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)))) (let ((.cse116 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse114 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse115 1))) (and (= |c_#valid| (store .cse114 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse115) 0) (not (= .cse115 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (not (= v_arrayElimCell_161 0)) (not (= .cse115 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse116 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse116 v_arrayElimCell_161) 0)))))))) (exists ((v_arrayElimCell_161 Int) (v_prenex_3 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse118 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse117 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse118 1))) (and (= (select .cse117 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= (select .cse9 v_prenex_3) .cse118)) (not (= v_arrayElimCell_161 0)) (= .cse118 |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select .cse117 v_arrayElimCell_161) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse118 1) v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)) 0 0)))))))) (and (or (and .cse17 (or .cse74 (exists ((v_prenex_3 Int) (v_DerPreprocessor_26 Int)) (let ((.cse120 (select .cse9 v_prenex_3))) (let ((.cse119 (store .cse10 .cse120 1))) (let ((.cse121 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse119 0 v_DerPreprocessor_26) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse120 1))) (and (= |c_#valid| (store .cse119 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse120) 0) (= (select .cse121 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse121 0) 0) (not (= .cse120 |c_ULTIMATE.start_main_~#list~0#1.base|))))))))) (and .cse19 (exists ((v_DerPreprocessor_25 Int) (v_arrayElimCell_161 Int) (v_prenex_3 Int)) (let ((.cse124 (select |c_#valid| v_arrayElimCell_161)) (.cse123 (select .cse22 v_prenex_3))) (let ((.cse122 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_25) .cse123 1) v_arrayElimCell_161 .cse124) 0)) .cse123 1))) (and (= (select .cse122 0) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse123 1) v_arrayElimCell_161 .cse124) 0 0)) (= 0 (select .cse122 v_arrayElimCell_161)) (not (= .cse123 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse123) 0)))))) .cse80 .cse125) .cse4) (and .cse4 (or .cse126 (and .cse19 (exists ((v_arrayElimCell_161 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int) (v_DerPreprocessor_40 Int)) (let ((.cse130 (select |c_#valid| v_arrayElimCell_161)) (.cse129 (select .cse22 v_prenex_3))) (let ((.cse127 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_40) .cse129 1) v_arrayElimCell_161 .cse130) 0)) .cse129 1)) (.cse128 (select .cse22 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (= (select .cse127 v_arrayElimCell_161) 0) (not (= .cse128 0)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse129 1) v_arrayElimCell_161 .cse130) 0 0)) (not (= .cse129 0)) (= (select .cse127 0) 1) (not (= .cse129 .cse128)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse129) 0)))))) (and (or (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int) (v_DerPreprocessor_41 Int)) (let ((.cse134 (select .cse9 v_prenex_3))) (let ((.cse132 (store .cse10 .cse134 1))) (let ((.cse131 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse132 0 v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse134 1)) (.cse133 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (= (select .cse131 0) 0) (= |c_#valid| (store .cse132 0 0)) (= (select .cse131 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse133 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse134) 0) (not (= .cse134 .cse133)) (not (= .cse134 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (exists ((v_arrayElimCell_161 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse137 (select .cse9 v_prenex_3))) (let ((.cse135 (store (store .cse10 .cse137 1) v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)))) (let ((.cse136 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|)) (.cse138 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse135 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse137 1))) (and (= |c_#valid| (store .cse135 0 0)) (not (= .cse136 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse137) 0) (not (= .cse137 .cse136)) (not (= v_arrayElimCell_161 0)) (not (= .cse137 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse138 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse138 v_arrayElimCell_161) 0))))))) .cse17) .cse18)) (and .cse4 (or (and (exists ((v_arrayElimCell_161 Int) (v_prenex_3 Int) (v_DerPreprocessor_32 Int)) (let ((.cse140 (select |c_#valid| v_arrayElimCell_161)) (.cse139 (select .cse22 v_prenex_3))) (let ((.cse141 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_32) .cse139 1) v_arrayElimCell_161 .cse140) 0)) .cse139 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse139 1) v_arrayElimCell_161 .cse140) 0 0)) (not (= .cse139 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse139) 0) (= (select .cse141 v_arrayElimCell_161) 0) (= (select .cse141 0) 1))))) .cse19) (and (or .cse80 .cse125) .cse142) (and .cse17 (or .cse74 (exists ((v_DerPreprocessor_33 Int) (v_prenex_3 Int)) (let ((.cse144 (select .cse9 v_prenex_3))) (let ((.cse143 (store .cse10 .cse144 1))) (let ((.cse145 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse143 0 v_DerPreprocessor_33) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse144 1))) (and (= |c_#valid| (store .cse143 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse144) 0) (= (select .cse145 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse145 0) 0) (not (= .cse144 |c_ULTIMATE.start_main_~#list~0#1.base|))))))))))) (and .cse25 (or (and (or (and (exists ((v_DerPreprocessor_44 Int) (v_arrayElimCell_161 Int)) (let ((.cse147 (select |c_#valid| v_arrayElimCell_161))) (let ((.cse146 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_44) .cse27 1) v_arrayElimCell_161 .cse147) 0)) .cse27 1))) (and (= (select .cse146 0) 1) (= (select .cse146 v_arrayElimCell_161) 0) (= |c_#valid| (store (store .cse28 v_arrayElimCell_161 .cse147) 0 0)))))) .cse19) (and (or (exists ((v_arrayElimCell_161 Int)) (let ((.cse149 (store .cse32 v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)))) (let ((.cse148 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse149 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse31 1))) (and (= (select .cse148 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store .cse149 0 0)) (not (= v_arrayElimCell_161 0)) (= (select .cse148 v_arrayElimCell_161) 0))))) (and .cse33 (exists ((v_DerPreprocessor_45 Int)) (let ((.cse150 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse32 0 v_DerPreprocessor_45) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse31 1))) (and (= (select .cse150 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse150 0) 0)))))) .cse17)) .cse35) (and .cse70 .cse3))))) .cse159) (and .cse1 .cse2 .cse3 .cse106) (and .cse4 (or .cse105 (and .cse37 (or (and .cse17 (or (exists ((v_prenex_3 Int) (v_DerPreprocessor_62 Int)) (let ((.cse161 (select .cse9 v_prenex_3))) (let ((.cse160 (store .cse10 .cse161 1))) (and (= |c_#valid| (store .cse160 0 0)) (not (= .cse161 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse161) 0) (not (= .cse161 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse160 0 v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse161 1) |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))) .cse104)) (and .cse19 (exists ((v_prenex_3 Int) (v_arrayElimCell_157 Int) (v_DerPreprocessor_61 Int)) (let ((.cse163 (select |c_#valid| v_arrayElimCell_157)) (.cse162 (select .cse22 v_prenex_3))) (let ((.cse164 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_61) .cse162 1) v_arrayElimCell_157 .cse163) 0)) .cse162 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse162 1) v_arrayElimCell_157 .cse163) 0 0)) (= 1 (select .cse164 0)) (not (= .cse162 0)) (= (select .cse164 v_arrayElimCell_157) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse162) 0)))))))))) (and .cse69 .cse1 .cse2 .cse3) (and .cse4 (or .cse126 (and (exists ((v_DerPreprocessor_13 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse167 (select .cse22 v_prenex_3))) (let ((.cse165 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_13) .cse167 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse11) 0)) .cse167 1)) (.cse166 (select .cse22 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (= (select .cse165 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (not (= .cse166 0)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse167 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse11) 0 0)) (= (select .cse165 0) 1) (not (= .cse167 0)) (not (= .cse167 .cse166)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse167) 0))))) .cse19 .cse12) (and .cse5 (or (and .cse12 (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse171 (select .cse9 v_prenex_3))) (let ((.cse169 (store (store .cse10 .cse171 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse11))) (let ((.cse170 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|)) (.cse168 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse169 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse171 1))) (and (= (select .cse168 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store .cse169 0 0)) (not (= .cse170 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse171) 0) (not (= .cse171 .cse170)) (not (= .cse171 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse168 |c_ULTIMATE.start_freeData_~data#1.base|) 0))))))) (and .cse16 (exists ((v_DerPreprocessor_14 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse174 (select .cse9 v_prenex_3))) (let ((.cse172 (store .cse10 .cse174 1))) (let ((.cse173 (select .cse9 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|)) (.cse175 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse172 0 v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse174 1))) (and (= |c_#valid| (store .cse172 0 0)) (not (= .cse173 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse174) 0) (not (= .cse174 .cse173)) (= (select .cse175 0) 0) (= (select .cse175 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse174 |c_ULTIMATE.start_main_~#list~0#1.base|))))))))) .cse17) .cse18)) (and .cse4 (or (and .cse19 .cse12 (exists ((v_DerPreprocessor_67 Int) (v_prenex_3 Int)) (let ((.cse177 (select .cse22 v_prenex_3))) (let ((.cse176 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_67) .cse177 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse11) 0)) .cse177 1))) (and (= (select .cse176 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse177 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse11) 0 0)) (not (= .cse177 0)) (= (select .cse176 0) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse177) 0)))))) (and .cse5 .cse17 (or .cse43 (and .cse16 (exists ((v_DerPreprocessor_68 Int) (v_prenex_3 Int)) (let ((.cse180 (select .cse9 v_prenex_3))) (let ((.cse178 (store .cse10 .cse180 1))) (let ((.cse179 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse178 0 v_DerPreprocessor_68) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse180 1))) (and (= |c_#valid| (store .cse178 0 0)) (= (select .cse179 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse180) 0) (= (select .cse179 0) 0) (not (= .cse180 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))))) (and (or .cse44 .cse68) .cse142))) (and .cse107 .cse1 .cse2 .cse3) (and .cse69 .cse0 .cse1 .cse2 .cse3))))) (or (not .cse4) .cse159) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base|) 0))))) is different from false [2025-01-09 22:23:53,174 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse32 (select .cse10 |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse1 (not (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0))) (.cse0 (= 0 .cse32))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0) (or (not .cse0) .cse1) (let ((.cse17 (= |c_ULTIMATE.start_freeData_~data#1.base| 0)) (.cse23 (select |c_#memory_$Pointer$#2.base| 0)) (.cse11 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~#list~0#1.base|)))) (let ((.cse163 (store |c_ULTIMATE.start_main_old_#valid#1| .cse32 1)) (.cse20 (= |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (.cse154 (exists ((v_prenex_3 Int)) (not (= (select .cse10 v_prenex_3) 0)))) (.cse93 (exists ((v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse216 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse215 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse216 1))) (and (= (select .cse215 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (= .cse216 |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse216 1) 0 0)) (= (select .cse215 0) 0)))))) (.cse5 (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse32)) (.cse33 (store .cse11 .cse32 1)) (.cse28 (select .cse23 |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse12 (select |c_#valid| |c_ULTIMATE.start_freeData_~data#1.base|)) (.cse13 (not .cse17))) (let ((.cse24 (and (exists ((v_prenex_3 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse214 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse213 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse214 1))) (and (= (select .cse213 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= (select .cse10 v_prenex_3) .cse214)) (= .cse214 |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse214 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse12) 0 0)) (= (select .cse213 |c_ULTIMATE.start_freeData_~data#1.base|) 0))))) .cse13)) (.cse51 (exists ((v_arrayElimCell_160 Int) (v_prenex_3 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse212 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse211 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse212 1)) (.cse210 (select .cse10 v_prenex_3))) (and (not (= .cse210 0)) (= (select .cse211 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= .cse212 0)) (= (select .cse211 v_arrayElimCell_160) 0) (not (= .cse210 .cse212)) (not (= v_arrayElimCell_160 0)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse212 1) v_arrayElimCell_160 (select |c_#valid| v_arrayElimCell_160)) 0 0)) (= .cse212 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (.cse52 (exists ((v_prenex_3 Int) (v_arrayElimCell_157 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse206 (select .cse10 v_prenex_3))) (let ((.cse209 (store (store .cse11 .cse206 1) v_arrayElimCell_157 (select |c_#valid| v_arrayElimCell_157)))) (let ((.cse207 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse209 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse206 1)) (.cse208 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (not (= v_arrayElimCell_157 0)) (not (= .cse206 0)) (= (select .cse207 v_arrayElimCell_157) 0) (not (= .cse208 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse206) 0) (= (select .cse207 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse206 .cse208)) (not (= .cse206 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse209 0 0)))))))) (.cse57 (exists ((v_prenex_3 Int) (v_arrayElimCell_157 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse203 (select .cse10 v_prenex_3))) (let ((.cse205 (store (store .cse11 .cse203 1) v_arrayElimCell_157 (select |c_#valid| v_arrayElimCell_157)))) (let ((.cse204 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse205 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse203 1))) (and (not (= v_arrayElimCell_157 0)) (not (= .cse203 0)) (= (select .cse204 v_arrayElimCell_157) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse203) 0) (= (select .cse204 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse203 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (not (= .cse203 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse205 0 0)))))))) (.cse46 (exists ((v_prenex_3 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse202 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse200 (select .cse10 v_prenex_3)) (.cse201 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse202 1))) (and (not (= .cse200 0)) (= (select .cse201 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= .cse200 .cse202)) (= .cse202 |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse202 1) 0 0)) (= (select .cse201 0) 0)))))) (.cse37 (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (not (= (select .cse10 v_prenex_3) (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))))) (.cse25 (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse198 (select .cse10 v_prenex_3)) (.cse199 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (not (= .cse198 .cse199)) (not (= .cse198 .cse32)) (not (= .cse199 .cse32)))))) (.cse70 (exists ((v_arrayElimCell_160 Int) (v_prenex_3 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse197 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse196 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse197 1))) (and (= (select .cse196 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= .cse197 0)) (= (select .cse196 v_arrayElimCell_160) 0) (not (= (select .cse10 v_prenex_3) .cse197)) (not (= v_arrayElimCell_160 0)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse197 1) v_arrayElimCell_160 (select |c_#valid| v_arrayElimCell_160)) 0 0)) (= .cse197 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (.cse19 (exists ((v_prenex_3 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse195 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse194 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse195 1))) (and (= (select .cse194 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= (select .cse10 v_prenex_3) .cse195)) (= .cse195 |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse195 1) 0 0)) (= (select .cse194 0) 0)))))) (.cse26 (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse32) 0)) (.cse29 (store |c_ULTIMATE.start_main_old_#valid#1| .cse28 1)) (.cse34 (= |c_#valid| (store .cse33 0 0))) (.cse36 (not .cse5)) (.cse119 (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse193 (select .cse10 v_prenex_3))) (and (not (= .cse193 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (not (= .cse193 .cse32)))))) (.cse118 (and .cse154 (or .cse93 (exists ((v_arrayElimCell_157 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse192 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse191 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse192 1))) (and (not (= v_arrayElimCell_157 0)) (= (select .cse191 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= .cse192 0)) (= (select .cse191 v_arrayElimCell_157) 0) (= .cse192 |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse192 1) v_arrayElimCell_157 (select |c_#valid| v_arrayElimCell_157)) 0 0))))))))) (.cse38 (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (not (= (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|) 0)))) (.cse117 (exists ((v_prenex_3 Int) (v_arrayElimCell_157 Int)) (let ((.cse188 (select .cse10 v_prenex_3))) (let ((.cse190 (store (store .cse11 .cse188 1) v_arrayElimCell_157 (select |c_#valid| v_arrayElimCell_157)))) (let ((.cse189 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse190 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse188 1))) (and (not (= v_arrayElimCell_157 0)) (not (= .cse188 0)) (= (select .cse189 v_arrayElimCell_157) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse188) 0) (= (select .cse189 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse188 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse190 0 0)))))))) (.cse6 (not (= |c_ULTIMATE.start_freeData_~data#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (.cse18 (not .cse20)) (.cse44 (and .cse13 (exists ((v_prenex_3 Int)) (let ((.cse187 (select .cse10 v_prenex_3))) (let ((.cse186 (store (store .cse11 .cse187 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse12))) (let ((.cse185 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse186 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse187 1))) (and (= (select .cse185 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store .cse186 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse187) 0) (= (select .cse185 |c_ULTIMATE.start_freeData_~data#1.base|) 0)))))))) (.cse45 (and .cse17 .cse93)) (.cse69 (and (exists ((v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse184 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse183 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse184 1))) (and (= (select .cse183 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (= .cse184 |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse184 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse12) 0 0)) (= (select .cse183 |c_ULTIMATE.start_freeData_~data#1.base|) 0))))) .cse13)) (.cse120 (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse182 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (not (= (select .cse10 v_prenex_3) .cse182)) (not (= .cse182 .cse32)))))) (.cse82 (exists ((v_prenex_3 Int)) (not (= (select .cse10 v_prenex_3) .cse32)))) (.cse2 (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (not (= (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|) .cse32)))) (.cse3 (= |c_#valid| (store (store .cse163 |c_ULTIMATE.start_freeData_~data#1.base| .cse12) 0 0))) (.cse4 (exists ((v_prenex_4 Int)) (let ((.cse181 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_4) .cse32 1))) (and (= 0 (select .cse181 |c_ULTIMATE.start_freeData_~data#1.base|)) (= (select .cse181 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_4)))))) (or (and .cse2 .cse3 .cse4 .cse5) (and .cse0 (or (and .cse6 (or (and (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse9 (select .cse10 v_prenex_3))) (let ((.cse8 (store (store .cse11 .cse9 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse12))) (let ((.cse7 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse8 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse9 1))) (and (= (select .cse7 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store .cse8 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse9) 0) (not (= .cse9 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select .cse7 |c_ULTIMATE.start_freeData_~data#1.base|) 0)))))) .cse13) (and (exists ((v_prenex_3 Int) (v_DerPreprocessor_64 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse15 (select .cse10 v_prenex_3))) (let ((.cse14 (store .cse11 .cse15 1))) (let ((.cse16 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse14 0 v_DerPreprocessor_64) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse15 1))) (and (= |c_#valid| (store .cse14 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse15) 0) (= (select .cse16 0) 0) (not (= .cse15 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (not (= .cse15 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse16 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) .cse17)) .cse18) (and .cse17 .cse19) (and .cse20 .cse13 (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int) (v_DerPreprocessor_63 Int)) (let ((.cse22 (select .cse23 v_prenex_3))) (let ((.cse21 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_63) .cse22 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse12) 0)) .cse22 1))) (and (= (select .cse21 0) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse22 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse12) 0 0)) (not (= .cse22 0)) (= (select .cse21 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (not (= .cse22 (select .cse23 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse22) 0)))))) .cse24)) (and .cse25 .cse3 .cse4 .cse5) (and .cse26 (or (and (or (and (exists ((v_DerPreprocessor_51 Int)) (let ((.cse27 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_51) .cse28 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse12) 0)) .cse28 1))) (and (= (select .cse27 0) 1) (= (select .cse27 |c_ULTIMATE.start_freeData_~data#1.base|) 0)))) (= |c_#valid| (store (store .cse29 |c_ULTIMATE.start_freeData_~data#1.base| .cse12) 0 0)) .cse20 .cse13) (and .cse6 (or (let ((.cse31 (store .cse33 |c_ULTIMATE.start_freeData_~data#1.base| .cse12))) (let ((.cse30 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse31 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse32 1))) (and (= (select .cse30 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store .cse31 0 0)) .cse13 (= (select .cse30 |c_ULTIMATE.start_freeData_~data#1.base|) 0)))) (and .cse34 .cse17 (exists ((v_DerPreprocessor_52 Int)) (let ((.cse35 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse33 0 v_DerPreprocessor_52) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse32 1))) (and (= (select .cse35 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse35 0) 0)))))))) .cse36) (and .cse3 .cse4 .cse5))) (and .cse37 .cse3 .cse4 .cse5) (and .cse0 (or (and .cse38 (or (and (exists ((v_prenex_3 Int) (v_DerPreprocessor_73 Int)) (let ((.cse40 (select .cse23 v_prenex_3))) (let ((.cse39 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_73) .cse40 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse12) 0)) .cse40 1))) (and (= (select .cse39 0) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse40 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse12) 0 0)) (not (= .cse40 0)) (= (select .cse39 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse40) 0))))) .cse20 .cse13) (and .cse6 (or (and (exists ((v_prenex_3 Int) (v_DerPreprocessor_74 Int)) (let ((.cse42 (select .cse10 v_prenex_3))) (let ((.cse41 (store .cse11 .cse42 1))) (let ((.cse43 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse41 0 v_DerPreprocessor_74) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse42 1))) (and (= |c_#valid| (store .cse41 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse42) 0) (not (= .cse42 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse43 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse43 0) 0)))))) .cse17) .cse44) .cse18))) .cse45)) (and .cse0 (or .cse46 (and .cse20 (exists ((v_prenex_3 Int) (v_DerPreprocessor_9 Int) (v_arrayElimCell_157 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse48 (select |c_#valid| v_arrayElimCell_157)) (.cse47 (select .cse23 v_prenex_3))) (let ((.cse50 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_9) .cse47 1) v_arrayElimCell_157 .cse48) 0)) .cse47 1)) (.cse49 (select .cse23 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse47 1) v_arrayElimCell_157 .cse48) 0 0)) (not (= .cse49 0)) (= (select .cse50 0) 1) (= (select .cse50 v_arrayElimCell_157) 0) (not (= .cse47 0)) (not (= .cse47 .cse49)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse47) 0)))))) .cse51 (and (or .cse52 (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int) (v_DerPreprocessor_10 Int)) (let ((.cse56 (select .cse10 v_prenex_3))) (let ((.cse54 (store .cse11 .cse56 1))) (let ((.cse55 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|)) (.cse53 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse54 0 v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse56 1))) (and (= (select .cse53 0) 0) (= |c_#valid| (store .cse54 0 0)) (not (= .cse55 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse56) 0) (not (= .cse56 .cse55)) (not (= .cse56 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse53 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))))) .cse18))) (and .cse0 (or (and .cse18 (or .cse57 (exists ((v_DerPreprocessor_56 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse60 (select .cse10 v_prenex_3))) (let ((.cse58 (store .cse11 .cse60 1))) (let ((.cse59 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse58 0 v_DerPreprocessor_56) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse60 1))) (and (= |c_#valid| (store .cse58 0 0)) (= (select .cse59 0) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse60) 0) (not (= .cse60 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (not (= .cse60 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse59 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))))) (and .cse46 .cse17) (and .cse20 (exists ((v_DerPreprocessor_55 Int) (v_prenex_3 Int) (v_arrayElimCell_157 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse62 (select |c_#valid| v_arrayElimCell_157)) (.cse61 (select .cse23 v_prenex_3))) (let ((.cse63 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_55) .cse61 1) v_arrayElimCell_157 .cse62) 0)) .cse61 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse61 1) v_arrayElimCell_157 .cse62) 0 0)) (= (select .cse63 0) 1) (= 0 (select .cse63 v_arrayElimCell_157)) (not (= .cse61 0)) (not (= .cse61 (select .cse23 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse61) 0)))))) .cse24)) (and .cse0 (or (and .cse6 .cse18 (or (and .cse17 (exists ((v_prenex_3 Int) (v_DerPreprocessor_71 Int)) (let ((.cse66 (select .cse10 v_prenex_3))) (let ((.cse64 (store .cse11 .cse66 1))) (let ((.cse65 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse64 0 v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse66 1))) (and (= |c_#valid| (store .cse64 0 0)) (= (select .cse65 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse66) 0) (= (select .cse65 0) 0) (not (= .cse66 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) .cse44)) (and .cse20 .cse13 (exists ((v_prenex_3 Int) (v_DerPreprocessor_70 Int)) (let ((.cse68 (select .cse23 v_prenex_3))) (let ((.cse67 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_70) .cse68 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse12) 0)) .cse68 1))) (and (= (select .cse67 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse68 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse12) 0 0)) (= (select .cse67 0) 1) (not (= .cse68 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse68) 0)))))) .cse45 .cse69)) (and .cse0 (or .cse70 (and (exists ((v_DerPreprocessor_13 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse73 (select .cse23 v_prenex_3))) (let ((.cse71 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_13) .cse73 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse12) 0)) .cse73 1)) (.cse72 (select .cse23 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (= (select .cse71 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (not (= .cse72 0)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse73 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse12) 0 0)) (= (select .cse71 0) 1) (not (= .cse73 0)) (not (= .cse73 .cse72)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse73) 0))))) .cse20 .cse13) (and .cse6 (or (and (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse77 (select .cse10 v_prenex_3))) (let ((.cse75 (store (store .cse11 .cse77 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse12))) (let ((.cse76 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|)) (.cse74 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse75 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse77 1))) (and (= (select .cse74 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store .cse75 0 0)) (not (= .cse76 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse77) 0) (not (= .cse77 .cse76)) (= (select .cse74 |c_ULTIMATE.start_freeData_~data#1.base|) 0)))))) .cse13) (and .cse17 (exists ((v_DerPreprocessor_14 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse80 (select .cse10 v_prenex_3))) (let ((.cse78 (store .cse11 .cse80 1))) (let ((.cse79 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|)) (.cse81 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse78 0 v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse80 1))) (and (= |c_#valid| (store .cse78 0 0)) (not (= .cse79 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse80) 0) (not (= .cse80 .cse79)) (= (select .cse81 0) 0) (= (select .cse81 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse80 |c_ULTIMATE.start_main_~#list~0#1.base|))))))))) .cse18) .cse19)) (and (let ((.cse138 (exists ((v_arrayElimCell_161 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse170 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse169 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse170 1))) (and (= (select .cse169 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= v_arrayElimCell_161 0)) (= .cse170 |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select .cse169 v_arrayElimCell_161) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse170 1) v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)) 0 0))))))) (.cse87 (exists ((v_arrayElimCell_161 Int) (v_prenex_3 Int)) (let ((.cse167 (select .cse10 v_prenex_3))) (let ((.cse166 (store (store .cse11 .cse167 1) v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)))) (let ((.cse168 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse166 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse167 1))) (and (= |c_#valid| (store .cse166 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse167) 0) (not (= v_arrayElimCell_161 0)) (not (= .cse167 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse168 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse168 v_arrayElimCell_161) 0))))))) (.cse83 (or (and (= |c_#valid| (store .cse163 0 0)) (exists ((v_prenex_4 Int)) (let ((.cse164 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_4) .cse32 1))) (and (= (select .cse164 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_4) (= (select .cse164 0) 0))))) (exists ((v_prenex_4 Int) (v_arrayElimCell_161 Int)) (let ((.cse165 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_4) .cse32 1))) (and (= (select .cse165 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_4) (= |c_#valid| (store (store .cse163 v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)) 0 0)) (not (= v_arrayElimCell_161 0)) (= (select .cse165 v_arrayElimCell_161) 0))))))) (or (and .cse82 .cse2 .cse83 .cse5) (and .cse0 (or (and .cse38 (or (and (or (exists ((v_DerPreprocessor_24 Int) (v_prenex_3 Int)) (let ((.cse86 (select .cse10 v_prenex_3))) (let ((.cse84 (store .cse11 .cse86 1))) (let ((.cse85 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse84 0 v_DerPreprocessor_24) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse86 1))) (and (= |c_#valid| (store .cse84 0 0)) (= (select .cse85 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse86) 0) (not (= .cse86 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse85 0) 0)))))) .cse87) .cse18) (and .cse20 (exists ((v_DerPreprocessor_23 Int) (v_arrayElimCell_161 Int) (v_prenex_3 Int)) (let ((.cse90 (select |c_#valid| v_arrayElimCell_161)) (.cse89 (select .cse23 v_prenex_3))) (let ((.cse88 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_23) .cse89 1) v_arrayElimCell_161 .cse90) 0)) .cse89 1))) (and (= (select .cse88 v_arrayElimCell_161) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse89 1) v_arrayElimCell_161 .cse90) 0 0)) (= (select .cse88 0) 1) (not (= .cse89 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse89) 0)))))))) (exists ((v_arrayElimCell_161 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse92 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse91 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse92 1))) (and (= (select .cse91 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= .cse92 0)) (not (= v_arrayElimCell_161 0)) (= .cse92 |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select .cse91 v_arrayElimCell_161) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse92 1) v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)) 0 0)))))) .cse93)) (and .cse2 .cse83 .cse5) (and .cse0 (or .cse46 (and .cse20 (exists ((v_DerPreprocessor_18 Int) (v_prenex_3 Int) (v_arrayElimCell_157 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse95 (select |c_#valid| v_arrayElimCell_157)) (.cse94 (select .cse23 v_prenex_3))) (let ((.cse97 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_18) .cse94 1) v_arrayElimCell_157 .cse95) 0)) .cse94 1)) (.cse96 (select .cse23 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse94 1) v_arrayElimCell_157 .cse95) 0 0)) (not (= .cse96 0)) (= (select .cse97 0) 1) (not (= .cse94 0)) (= (select .cse97 v_arrayElimCell_157) 0) (not (= .cse94 .cse96)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse94) 0)))))) .cse51 (and .cse18 (or .cse52 (exists ((v_prenex_3 Int) (v_DerPreprocessor_19 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse101 (select .cse10 v_prenex_3))) (let ((.cse98 (store .cse11 .cse101 1))) (let ((.cse100 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|)) (.cse99 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse98 0 v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse101 1))) (and (= |c_#valid| (store .cse98 0 0)) (= (select .cse99 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse100 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse101) 0) (not (= .cse101 .cse100)) (not (= .cse101 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse99 0) 0)))))))))) (and .cse0 (or (and .cse18 (or .cse57 (exists ((v_DerPreprocessor_35 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse103 (select .cse10 v_prenex_3))) (let ((.cse102 (store .cse11 .cse103 1))) (let ((.cse104 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse102 0 v_DerPreprocessor_35) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse103 1))) (and (= |c_#valid| (store .cse102 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse103) 0) (not (= .cse103 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select .cse104 0) 0) (= (select .cse104 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse103 |c_ULTIMATE.start_main_~#list~0#1.base|))))))))) .cse46 (and (exists ((v_DerPreprocessor_34 Int) (v_prenex_3 Int) (v_arrayElimCell_157 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse106 (select |c_#valid| v_arrayElimCell_157)) (.cse105 (select .cse23 v_prenex_3))) (let ((.cse107 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_34) .cse105 1) v_arrayElimCell_157 .cse106) 0)) .cse105 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse105 1) v_arrayElimCell_157 .cse106) 0 0)) (= (select .cse107 0) 1) (not (= .cse105 0)) (not (= .cse105 (select .cse23 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse105) 0) (= (select .cse107 v_arrayElimCell_157) 0))))) .cse20) (exists ((v_arrayElimCell_161 Int) (v_prenex_3 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse110 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse108 (select .cse10 v_prenex_3)) (.cse109 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse110 1))) (and (not (= .cse108 0)) (= (select .cse109 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= .cse108 .cse110)) (not (= v_arrayElimCell_161 0)) (= .cse110 |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select .cse109 v_arrayElimCell_161) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse110 1) v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)) 0 0)))))))) (and .cse37 .cse83 .cse5) (and .cse0 (or (and .cse38 (or (and (exists ((v_DerPreprocessor_47 Int) (v_prenex_3 Int) (v_arrayElimCell_157 Int)) (let ((.cse112 (select |c_#valid| v_arrayElimCell_157)) (.cse111 (select .cse23 v_prenex_3))) (let ((.cse113 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_47) .cse111 1) v_arrayElimCell_157 .cse112) 0)) .cse111 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse111 1) v_arrayElimCell_157 .cse112) 0 0)) (= (select .cse113 0) 1) (not (= .cse111 0)) (= (select .cse113 v_arrayElimCell_157) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse111) 0))))) .cse20) (and .cse18 (or (exists ((v_prenex_3 Int) (v_DerPreprocessor_48 Int)) (let ((.cse116 (select .cse10 v_prenex_3))) (let ((.cse114 (store .cse11 .cse116 1))) (let ((.cse115 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse114 0 v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse116 1))) (and (= |c_#valid| (store .cse114 0 0)) (= (select .cse115 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse116) 0) (not (= .cse116 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse115 0) 0)))))) .cse117)))) .cse118)) (and .cse83 .cse5 .cse119) (and .cse82 .cse83 .cse5) (and .cse120 .cse83 .cse5) (and .cse25 .cse83 .cse5) (and .cse0 (or (and (exists ((v_arrayElimCell_161 Int) (v_DerPreprocessor_29 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse123 (select |c_#valid| v_arrayElimCell_161)) (.cse122 (select .cse23 v_prenex_3))) (let ((.cse121 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_29) .cse122 1) v_arrayElimCell_161 .cse123) 0)) .cse122 1))) (and (= (select .cse121 0) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse122 1) v_arrayElimCell_161 .cse123) 0 0)) (not (= .cse122 0)) (= 0 (select .cse121 v_arrayElimCell_161)) (not (= .cse122 (select .cse23 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse122) 0))))) .cse20) .cse19 (and .cse18 (or (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int) (v_DerPreprocessor_30 Int)) (let ((.cse125 (select .cse10 v_prenex_3))) (let ((.cse124 (store .cse11 .cse125 1))) (let ((.cse126 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse124 0 v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse125 1))) (and (= |c_#valid| (store .cse124 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse125) 0) (not (= .cse125 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select .cse126 0) 0) (= (select .cse126 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse125 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (exists ((v_arrayElimCell_161 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse128 (select .cse10 v_prenex_3))) (let ((.cse127 (store (store .cse11 .cse128 1) v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)))) (let ((.cse129 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse127 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse128 1))) (and (= |c_#valid| (store .cse127 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse128) 0) (not (= .cse128 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (not (= v_arrayElimCell_161 0)) (not (= .cse128 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse129 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse129 v_arrayElimCell_161) 0)))))))) (exists ((v_arrayElimCell_161 Int) (v_prenex_3 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse131 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse130 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse131 1))) (and (= (select .cse130 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= (select .cse10 v_prenex_3) .cse131)) (not (= v_arrayElimCell_161 0)) (= .cse131 |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select .cse130 v_arrayElimCell_161) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse131 1) v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)) 0 0)))))))) (and (or (and .cse18 (or .cse87 (exists ((v_prenex_3 Int) (v_DerPreprocessor_26 Int)) (let ((.cse133 (select .cse10 v_prenex_3))) (let ((.cse132 (store .cse11 .cse133 1))) (let ((.cse134 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse132 0 v_DerPreprocessor_26) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse133 1))) (and (= |c_#valid| (store .cse132 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse133) 0) (= (select .cse134 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse134 0) 0) (not (= .cse133 |c_ULTIMATE.start_main_~#list~0#1.base|))))))))) (and .cse20 (exists ((v_DerPreprocessor_25 Int) (v_arrayElimCell_161 Int) (v_prenex_3 Int)) (let ((.cse137 (select |c_#valid| v_arrayElimCell_161)) (.cse136 (select .cse23 v_prenex_3))) (let ((.cse135 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_25) .cse136 1) v_arrayElimCell_161 .cse137) 0)) .cse136 1))) (and (= (select .cse135 0) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse136 1) v_arrayElimCell_161 .cse137) 0 0)) (= 0 (select .cse135 v_arrayElimCell_161)) (not (= .cse136 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse136) 0)))))) .cse93 .cse138) .cse0) (and .cse0 (or .cse70 (and .cse20 (exists ((v_arrayElimCell_161 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int) (v_DerPreprocessor_40 Int)) (let ((.cse142 (select |c_#valid| v_arrayElimCell_161)) (.cse141 (select .cse23 v_prenex_3))) (let ((.cse139 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_40) .cse141 1) v_arrayElimCell_161 .cse142) 0)) .cse141 1)) (.cse140 (select .cse23 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (= (select .cse139 v_arrayElimCell_161) 0) (not (= .cse140 0)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse141 1) v_arrayElimCell_161 .cse142) 0 0)) (not (= .cse141 0)) (= (select .cse139 0) 1) (not (= .cse141 .cse140)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse141) 0)))))) (and (or (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int) (v_DerPreprocessor_41 Int)) (let ((.cse146 (select .cse10 v_prenex_3))) (let ((.cse144 (store .cse11 .cse146 1))) (let ((.cse143 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse144 0 v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse146 1)) (.cse145 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (= (select .cse143 0) 0) (= |c_#valid| (store .cse144 0 0)) (= (select .cse143 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse145 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse146) 0) (not (= .cse146 .cse145)) (not (= .cse146 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (exists ((v_arrayElimCell_161 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse149 (select .cse10 v_prenex_3))) (let ((.cse147 (store (store .cse11 .cse149 1) v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)))) (let ((.cse148 (select .cse10 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|)) (.cse150 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse147 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse149 1))) (and (= |c_#valid| (store .cse147 0 0)) (not (= .cse148 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse149) 0) (not (= .cse149 .cse148)) (not (= v_arrayElimCell_161 0)) (not (= .cse149 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse150 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse150 v_arrayElimCell_161) 0))))))) .cse18) .cse19)) (and .cse0 (or (and (exists ((v_arrayElimCell_161 Int) (v_prenex_3 Int) (v_DerPreprocessor_32 Int)) (let ((.cse152 (select |c_#valid| v_arrayElimCell_161)) (.cse151 (select .cse23 v_prenex_3))) (let ((.cse153 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_32) .cse151 1) v_arrayElimCell_161 .cse152) 0)) .cse151 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse151 1) v_arrayElimCell_161 .cse152) 0 0)) (not (= .cse151 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse151) 0) (= (select .cse153 v_arrayElimCell_161) 0) (= (select .cse153 0) 1))))) .cse20) (and (or .cse93 .cse138) .cse154) (and .cse18 (or .cse87 (exists ((v_DerPreprocessor_33 Int) (v_prenex_3 Int)) (let ((.cse156 (select .cse10 v_prenex_3))) (let ((.cse155 (store .cse11 .cse156 1))) (let ((.cse157 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse155 0 v_DerPreprocessor_33) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse156 1))) (and (= |c_#valid| (store .cse155 0 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse156) 0) (= (select .cse157 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse157 0) 0) (not (= .cse156 |c_ULTIMATE.start_main_~#list~0#1.base|))))))))))) (and .cse26 (or (and (or (and (exists ((v_DerPreprocessor_44 Int) (v_arrayElimCell_161 Int)) (let ((.cse159 (select |c_#valid| v_arrayElimCell_161))) (let ((.cse158 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_44) .cse28 1) v_arrayElimCell_161 .cse159) 0)) .cse28 1))) (and (= (select .cse158 0) 1) (= (select .cse158 v_arrayElimCell_161) 0) (= |c_#valid| (store (store .cse29 v_arrayElimCell_161 .cse159) 0 0)))))) .cse20) (and (or (exists ((v_arrayElimCell_161 Int)) (let ((.cse161 (store .cse33 v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)))) (let ((.cse160 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse161 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse32 1))) (and (= (select .cse160 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store .cse161 0 0)) (not (= v_arrayElimCell_161 0)) (= (select .cse160 v_arrayElimCell_161) 0))))) (and .cse34 (exists ((v_DerPreprocessor_45 Int)) (let ((.cse162 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse33 0 v_DerPreprocessor_45) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse32 1))) (and (= (select .cse162 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse162 0) 0)))))) .cse18)) .cse36) (and .cse83 .cse5))))) .cse1) (and .cse3 .cse4 .cse5 .cse119) (and .cse0 (or .cse118 (and .cse38 (or (and .cse18 (or (exists ((v_prenex_3 Int) (v_DerPreprocessor_62 Int)) (let ((.cse172 (select .cse10 v_prenex_3))) (let ((.cse171 (store .cse11 .cse172 1))) (and (= |c_#valid| (store .cse171 0 0)) (not (= .cse172 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse172) 0) (not (= .cse172 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse171 0 v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse172 1) |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))) .cse117)) (and .cse20 (exists ((v_prenex_3 Int) (v_arrayElimCell_157 Int) (v_DerPreprocessor_61 Int)) (let ((.cse174 (select |c_#valid| v_arrayElimCell_157)) (.cse173 (select .cse23 v_prenex_3))) (let ((.cse175 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_61) .cse173 1) v_arrayElimCell_157 .cse174) 0)) .cse173 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse173 1) v_arrayElimCell_157 .cse174) 0 0)) (= 1 (select .cse175 0)) (not (= .cse173 0)) (= (select .cse175 v_arrayElimCell_157) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse173) 0)))))))))) (and .cse82 .cse3 .cse4 .cse5) (and .cse0 (or (and .cse20 .cse13 (exists ((v_DerPreprocessor_67 Int) (v_prenex_3 Int)) (let ((.cse177 (select .cse23 v_prenex_3))) (let ((.cse176 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_67) .cse177 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse12) 0)) .cse177 1))) (and (= (select .cse176 |c_ULTIMATE.start_freeData_~data#1.base|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse177 1) |c_ULTIMATE.start_freeData_~data#1.base| .cse12) 0 0)) (not (= .cse177 0)) (= (select .cse176 0) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse177) 0)))))) (and .cse6 .cse18 (or .cse44 (and .cse17 (exists ((v_DerPreprocessor_68 Int) (v_prenex_3 Int)) (let ((.cse180 (select .cse10 v_prenex_3))) (let ((.cse178 (store .cse11 .cse180 1))) (let ((.cse179 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse178 0 v_DerPreprocessor_68) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse180 1))) (and (= |c_#valid| (store .cse178 0 0)) (= (select .cse179 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse180) 0) (= (select .cse179 0) 0) (not (= .cse180 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))))) (and (or .cse45 .cse69) .cse154))) (and .cse120 .cse3 .cse4 .cse5) (and .cse82 .cse2 .cse3 .cse4 .cse5))))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base|) 0))))) is different from false [2025-01-09 22:24:07,466 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#list~0#1.base|))) (let ((.cse42 (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.offset|))) (let ((.cse0 (= 0 .cse42)) (.cse359 (not (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) |c_ULTIMATE.start_main_~#list~0#1.offset|) 0)))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| 0) 0) (let ((.cse23 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select |c_#valid| |c_ULTIMATE.start_main_~#list~0#1.base|))) (.cse34 (select |c_#memory_$Pointer$#2.base| 0))) (let ((.cse46 (select .cse34 |c_ULTIMATE.start_main_~#list~0#1.offset|)) (.cse50 (store .cse23 .cse42 1))) (let ((.cse141 (exists ((v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse441 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse440 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse441 1))) (and (= (select .cse440 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= (select .cse440 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= .cse441 0)) (= (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse441 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0) |c_#valid|) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= .cse441 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (.cse142 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse439 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse438 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse439 1))) (and (= (select .cse438 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (= (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse439 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0) |c_#valid|) (= .cse439 |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select .cse438 0) 0)))))) (.cse138 (exists ((v_prenex_3 Int)) (not (= (select .cse4 v_prenex_3) 0)))) (.cse29 (= |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (.cse54 (store |c_ULTIMATE.start_main_old_#valid#1| .cse42 1)) (.cse55 (= |c_ULTIMATE.start_main_~#list~0#1.base| .cse42)) (.cse43 (store .cse50 0 0)) (.cse47 (store |c_ULTIMATE.start_main_old_#valid#1| .cse46 1))) (let ((.cse80 (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (not (= (select .cse4 v_prenex_3) (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))))) (.cse82 (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse436 (select .cse4 v_prenex_3)) (.cse437 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (not (= .cse436 .cse437)) (not (= .cse436 .cse42)) (not (= .cse437 .cse42)))))) (.cse62 (exists ((v_prenex_3 Int) (v_arrayElimCell_157 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse434 (select .cse4 v_prenex_3))) (let ((.cse433 (store (store (store .cse23 .cse434 1) v_arrayElimCell_157 (select |c_#valid| v_arrayElimCell_157)) 0 0))) (let ((.cse435 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse433 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse434 1) v_arrayElimCell_157 (select .cse433 v_arrayElimCell_157)) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse434 1))) (and (= |c_#valid| (store .cse433 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= v_arrayElimCell_157 0)) (not (= .cse434 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_157)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse434) 0) (= (select .cse435 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse434 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select .cse435 v_arrayElimCell_157) 0) (not (= .cse434 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) (.cse39 (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse42) 0)) (.cse44 (store .cse47 0 0)) (.cse41 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse43 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse42 1)) (.cse51 (not .cse55)) (.cse104 (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse432 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse431 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse432 1))) (and (= (select .cse431 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= (select .cse431 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= .cse432 0)) (not (= (select .cse4 v_prenex_3) .cse432)) (= (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse432 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0) |c_#valid|) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= .cse432 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (.cse137 (exists ((|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse430 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse429 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse430 1))) (and (= (select .cse429 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= (select .cse429 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (= (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse430 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0) |c_#valid|) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= .cse430 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (.cse97 (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse428 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse427 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse428 1))) (and (= (select .cse427 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= (select .cse4 v_prenex_3) .cse428)) (= (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse428 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0) |c_#valid|) (= .cse428 |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select .cse427 0) 0)))))) (.cse123 (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse426 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (not (= (select .cse4 v_prenex_3) .cse426)) (not (= .cse426 .cse42)))))) (.cse105 (exists ((v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse425 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse424 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse425 1))) (and (= (select .cse424 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= (select .cse424 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (= (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse425 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0) |c_#valid|) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= .cse425 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (.cse10 (exists ((v_prenex_3 Int) (v_arrayElimCell_157 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse421 (select .cse4 v_prenex_3))) (let ((.cse420 (store (store (store .cse23 .cse421 1) v_arrayElimCell_157 (select |c_#valid| v_arrayElimCell_157)) 0 0))) (let ((.cse422 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|)) (.cse423 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse420 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse421 1) v_arrayElimCell_157 (select .cse420 v_arrayElimCell_157)) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse421 1))) (and (= |c_#valid| (store .cse420 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= v_arrayElimCell_157 0)) (not (= .cse421 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_157)) (not (= .cse422 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse421) 0) (= (select .cse423 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse421 .cse422)) (= (select .cse423 v_arrayElimCell_157) 0) (not (= .cse421 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) (.cse5 (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse419 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse417 (select .cse4 v_prenex_3)) (.cse418 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse419 1))) (and (not (= .cse417 0)) (= (select .cse418 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= .cse417 .cse419)) (= (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse419 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0) |c_#valid|) (= .cse419 |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select .cse418 0) 0)))))) (.cse73 (exists ((v_prenex_3 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse416 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse415 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse416 1))) (and (= (select .cse415 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= (select .cse415 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= (select .cse4 v_prenex_3) .cse416)) (= (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse416 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0) |c_#valid|) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= .cse416 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (.cse120 (exists ((v_prenex_3 Int)) (not (= (select .cse4 v_prenex_3) .cse42)))) (.cse140 (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (not (= (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|) .cse42)))) (.cse116 (exists ((v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse414 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse413 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse414 1))) (and (= (select .cse413 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (= .cse414 |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse414 1) 0 0)) (= (select .cse413 0) 0)))))) (.cse53 (store .cse54 0 0)) (.cse225 (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse412 (select .cse4 v_prenex_3))) (and (not (= .cse412 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (not (= .cse412 .cse42)))))) (.cse145 (exists ((|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (not (= (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|) 0)))) (.cse175 (exists ((v_prenex_3 Int) (v_arrayElimCell_157 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (let ((.cse410 (select .cse4 v_prenex_3))) (let ((.cse409 (store (store (store .cse23 .cse410 1) v_arrayElimCell_157 (select |c_#valid| v_arrayElimCell_157)) 0 0))) (let ((.cse411 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse409 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse410 1) v_arrayElimCell_157 (select .cse409 v_arrayElimCell_157)) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse410 1))) (and (= |c_#valid| (store .cse409 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= v_arrayElimCell_157 0)) (not (= .cse410 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_157)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse410) 0) (= (select .cse411 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse411 v_arrayElimCell_157) 0) (not (= .cse410 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) (.cse9 (not .cse29)) (.cse167 (and (or .cse141 .cse142 (exists ((v_arrayElimCell_157 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse408 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse407 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse408 1))) (and (not (= v_arrayElimCell_157 0)) (= (select .cse407 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_157)) (not (= .cse408 0)) (= (select .cse407 v_arrayElimCell_157) 0) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse408 1) v_arrayElimCell_157 (select |c_#valid| v_arrayElimCell_157)) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= .cse408 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) .cse138))) (or (and .cse0 (or (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse3 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse2 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse3 1)) (.cse1 (select .cse4 v_prenex_3))) (and (not (= .cse1 0)) (= (select .cse2 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= .cse3 0)) (not (= .cse1 .cse3)) (= (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse3 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0) |c_#valid|) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= .cse3 |c_ULTIMATE.start_main_~#list~0#1.base|))))) .cse5 (exists ((v_arrayElimCell_160 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse8 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse7 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse8 1)) (.cse6 (select .cse4 v_prenex_3))) (and (not (= .cse6 0)) (= (select .cse7 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= .cse8 0)) (= (select .cse7 v_arrayElimCell_160) 0) (not (= .cse6 .cse8)) (not (= v_arrayElimCell_160 0)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse8 1) v_arrayElimCell_160 (select |c_#valid| v_arrayElimCell_160)) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_160)) (= .cse8 |c_ULTIMATE.start_main_~#list~0#1.base|))))) (and .cse9 (or .cse10 (exists ((v_prenex_3 Int) (v_DerPreprocessor_97 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int) (v_DerPreprocessor_10 Int)) (let ((.cse11 (select .cse4 v_prenex_3))) (let ((.cse12 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|)) (.cse13 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_97) .cse11 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse11 1) 0 v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse11 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse11 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= .cse12 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse11) 0) (not (= .cse11 .cse12)) (= (select .cse13 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse11 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse13 0) 0))))) (exists ((v_prenex_3 Int) (v_arrayElimCell_157 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int) (v_DerPreprocessor_98 Int)) (let ((.cse17 (select |c_#valid| v_arrayElimCell_157)) (.cse14 (select .cse4 v_prenex_3))) (let ((.cse15 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|)) (.cse16 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse18 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_98) .cse14 1) v_arrayElimCell_157 .cse17) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse18 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse14 1) v_arrayElimCell_157 (select .cse18 v_arrayElimCell_157))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse14 1))) (and (not (= v_arrayElimCell_157 0)) (not (= .cse14 0)) (not (= .cse15 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse14) 0) (not (= .cse14 .cse15)) (= (select .cse16 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse16 v_arrayElimCell_157) 0) (not (= .cse14 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse14 1) v_arrayElimCell_157 .cse17) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0) |c_#valid|))))) (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int) (v_DerPreprocessor_10 Int)) (let ((.cse22 (select .cse4 v_prenex_3))) (let ((.cse19 (store (store .cse23 .cse22 1) 0 0))) (let ((.cse20 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse19 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse22 1) 0 v_DerPreprocessor_10) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse22 1)) (.cse21 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (= |c_#valid| (store .cse19 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse20 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse20 0) 0) (not (= .cse21 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse22) 0) (not (= .cse22 .cse21)) (not (= .cse22 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (exists ((v_DerPreprocessor_99 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse26 (select .cse4 v_prenex_3))) (let ((.cse24 (store .cse23 .cse26 1))) (let ((.cse27 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|)) (.cse25 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse28 (store (store .cse24 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_99) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse28 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse26 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select .cse28 |v_ULTIMATE.start_freeData_~data#1.base_28|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse26 1))) (and (= |c_#valid| (store (store .cse24 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse25 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse26 0)) (not (= .cse27 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse26) 0) (not (= .cse26 .cse27)) (= (select .cse25 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (not (= .cse26 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0))))))))) (and .cse29 (or (exists ((v_prenex_3 Int) (v_DerPreprocessor_9 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_100 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse33 (select .cse34 v_prenex_3))) (let ((.cse32 (store |c_ULTIMATE.start_main_old_#valid#1| .cse33 1))) (let ((.cse30 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_9) .cse33 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select (store (store .cse32 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_100) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28|)) 0)) .cse33 1)) (.cse31 (select .cse34 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (= (select .cse30 0) 1) (= (select .cse30 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (not (= .cse31 0)) (= |c_#valid| (store (store .cse32 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse33 0)) (not (= .cse33 .cse31)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse33) 0)))))) (exists ((v_prenex_3 Int) (v_DerPreprocessor_9 Int) (v_arrayElimCell_157 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse38 (select .cse34 v_prenex_3))) (let ((.cse37 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse38 1) v_arrayElimCell_157 (select |c_#valid| v_arrayElimCell_157)) 0 0))) (let ((.cse35 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_9) .cse38 1) v_arrayElimCell_157 (select .cse37 v_arrayElimCell_157)) 0)) .cse38 1)) (.cse36 (select .cse34 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (= (select .cse35 0) 1) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_157)) (not (= .cse36 0)) (= |c_#valid| (store .cse37 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse35 v_arrayElimCell_157) 0) (not (= .cse38 0)) (not (= .cse38 .cse36)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse38) 0)))))))))) (and .cse39 (or (and (or (and (exists ((v_DerPreprocessor_52 Int)) (let ((.cse40 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse41 0 v_DerPreprocessor_52) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse42 1))) (and (= (select .cse40 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= 0 (select .cse40 0))))) (= |c_#valid| .cse43) .cse9) (and .cse29 (exists ((v_DerPreprocessor_170 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_51 Int)) (let ((.cse45 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_51) .cse46 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select (store (store .cse47 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_170) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28|)) 0)) .cse46 1))) (and (= |c_#valid| (store .cse44 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse45 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= (select .cse45 0) 1))))) (and (exists ((|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_168 Int)) (let ((.cse48 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse49 (store (store .cse50 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_168) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse49 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse42 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select .cse49 |v_ULTIMATE.start_freeData_~data#1.base_28|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse42 1))) (and (= (select .cse48 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= (select .cse48 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= |c_#valid| (store .cse43 |v_ULTIMATE.start_freeData_~data#1.base_28| 0))))) .cse9)) .cse51) (and (exists ((v_prenex_4 Int) (v_DerPreprocessor_171 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (let ((.cse52 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_4) .cse42 1))) (and (= (select .cse52 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_4) (= |c_#valid| (store .cse53 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse52 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= v_DerPreprocessor_171 (select (store (store .cse54 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_171) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28|))))) .cse55))) (and .cse0 (or (exists ((v_prenex_3 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse58 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse56 (select .cse4 v_prenex_3)) (.cse57 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse58 1))) (and (not (= .cse56 0)) (= (select .cse57 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= .cse56 .cse58)) (= .cse58 |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse58 1) 0 0)) (= (select .cse57 0) 0))))) (and (or (exists ((v_DerPreprocessor_56 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse61 (select .cse4 v_prenex_3))) (let ((.cse60 (store (store .cse23 .cse61 1) 0 0))) (let ((.cse59 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse60 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse61 1) 0 v_DerPreprocessor_56) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse61 1))) (and (= (select .cse59 0) 0) (= |c_#valid| (store .cse60 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse61) 0) (not (= .cse61 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (not (= .cse61 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse59 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) .cse62 (exists ((v_DerPreprocessor_56 Int) (v_prenex_3 Int) (v_DerPreprocessor_157 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse64 (select .cse4 v_prenex_3))) (let ((.cse63 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_157) .cse64 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse64 1) 0 v_DerPreprocessor_56) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse64 1))) (and (= (select .cse63 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse64 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse64) 0) (not (= .cse64 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select .cse63 0) 0) (not (= .cse64 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (exists ((v_prenex_3 Int) (v_arrayElimCell_157 Int) (v_DerPreprocessor_158 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse67 (select |c_#valid| v_arrayElimCell_157)) (.cse66 (select .cse4 v_prenex_3))) (let ((.cse65 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse68 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_158) .cse66 1) v_arrayElimCell_157 .cse67) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse68 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse66 1) v_arrayElimCell_157 (select .cse68 v_arrayElimCell_157))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse66 1))) (and (= (select .cse65 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= v_arrayElimCell_157 0)) (not (= .cse66 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse66) 0) (not (= .cse66 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select .cse65 v_arrayElimCell_157) 0) (not (= .cse66 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse66 1) v_arrayElimCell_157 .cse67) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0) |c_#valid|))))) (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int) (v_DerPreprocessor_159 Int)) (let ((.cse71 (select .cse4 v_prenex_3))) (let ((.cse70 (store .cse23 .cse71 1))) (let ((.cse69 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse72 (store (store .cse70 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_159) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse72 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse71 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select .cse72 |v_ULTIMATE.start_freeData_~data#1.base_28|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse71 1))) (and (= (select .cse69 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= |c_#valid| (store (store .cse70 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse71 0)) (= (select .cse69 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse71) 0) (not (= .cse71 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (not (= .cse71 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0)))))))) .cse9) .cse73 (and .cse29 (or (exists ((v_DerPreprocessor_55 Int) (v_prenex_3 Int) (v_arrayElimCell_157 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse76 (select .cse34 v_prenex_3))) (let ((.cse75 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse76 1) v_arrayElimCell_157 (select |c_#valid| v_arrayElimCell_157)) 0 0))) (let ((.cse74 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_55) .cse76 1) v_arrayElimCell_157 (select .cse75 v_arrayElimCell_157)) 0)) .cse76 1))) (and (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_157)) (= (select .cse74 v_arrayElimCell_157) 0) (= |c_#valid| (store .cse75 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse76 0)) (= (select .cse74 0) 1) (not (= .cse76 (select .cse34 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse76) 0)))))) (exists ((v_DerPreprocessor_55 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_156 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse78 (select .cse34 v_prenex_3))) (let ((.cse77 (store |c_ULTIMATE.start_main_old_#valid#1| .cse78 1))) (let ((.cse79 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_55) .cse78 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select (store (store .cse77 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_156) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28|)) 0)) .cse78 1))) (and (= |c_#valid| (store (store .cse77 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse78 0)) (= (select .cse79 0) 1) (= (select .cse79 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (not (= .cse78 (select .cse34 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse78) 0)))))))))) (and .cse80 (exists ((v_prenex_4 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_91 Int)) (let ((.cse81 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_4) .cse42 1))) (and (= (select .cse81 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_4) (= |c_#valid| (store .cse53 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse81 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= (select (store (store .cse54 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_91) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28|) v_DerPreprocessor_91)))) .cse55) (and .cse82 (exists ((v_prenex_4 Int) (v_DerPreprocessor_153 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (let ((.cse83 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_4) .cse42 1))) (and (= (select .cse83 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_4) (= |c_#valid| (store .cse53 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse83 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= v_DerPreprocessor_153 (select (store (store .cse54 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_153) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28|))))) .cse55) (and .cse0 (or (and .cse9 (or (exists ((|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (and (exists ((v_prenex_3 Int) (v_DerPreprocessor_83 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse87 (select .cse4 v_prenex_3))) (let ((.cse85 (store .cse23 .cse87 1))) (let ((.cse84 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse88 (store (store .cse85 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_83) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse88 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse87 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select .cse88 |v_ULTIMATE.start_freeData_~data#1.base_28|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse87 1)) (.cse86 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (= 1 (select .cse84 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store .cse85 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse84 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (not (= .cse86 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse87) 0) (not (= .cse87 .cse86)) (not (= .cse87 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0)))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (and (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| |c_ULTIMATE.start_main_~#list~0#1.base|)) (exists ((v_prenex_3 Int) (v_DerPreprocessor_82 Int) (v_DerPreprocessor_83 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse89 (select .cse4 v_prenex_3))) (let ((.cse92 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_82) .cse89 1) |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_83) 0 0))) (let ((.cse90 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|)) (.cse91 (select .cse92 |c_ULTIMATE.start_main_~#list~0#1.base|))) (and (= .cse89 |c_ULTIMATE.start_main_~#list~0#1.base|) (not (= .cse90 0)) (not (= .cse89 .cse90)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| .cse91) .cse89 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select .cse92 |v_ULTIMATE.start_freeData_~data#1.base_28|)) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse89 1) |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= v_DerPreprocessor_82 .cse91) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse89 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0))))))) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0)))) (exists ((v_DerPreprocessor_14 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse95 (select .cse4 v_prenex_3))) (let ((.cse93 (store (store .cse23 .cse95 1) 0 0))) (let ((.cse94 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|)) (.cse96 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse93 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse95 1) 0 v_DerPreprocessor_14) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse95 1))) (and (= |c_#valid| .cse93) (not (= .cse94 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse95) 0) (= (select .cse96 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse95 .cse94)) (= (select .cse96 0) 0) (not (= .cse95 |c_ULTIMATE.start_main_~#list~0#1.base|))))))))) .cse97 (exists ((v_arrayElimCell_160 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse99 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse98 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse99 1))) (and (= (select .cse98 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= .cse99 0)) (= (select .cse98 v_arrayElimCell_160) 0) (not (= (select .cse4 v_prenex_3) .cse99)) (not (= v_arrayElimCell_160 0)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse99 1) v_arrayElimCell_160 (select |c_#valid| v_arrayElimCell_160)) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_160)) (= .cse99 |c_ULTIMATE.start_main_~#list~0#1.base|))))) (and .cse29 (exists ((v_DerPreprocessor_13 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_81 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse103 (select .cse34 v_prenex_3))) (let ((.cse102 (store |c_ULTIMATE.start_main_old_#valid#1| .cse103 1))) (let ((.cse100 (select .cse34 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|)) (.cse101 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_13) .cse103 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select (store (store .cse102 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_81) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28|)) 0)) .cse103 1))) (and (not (= .cse100 0)) (= (select .cse101 0) 1) (= |c_#valid| (store (store .cse102 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse103 0)) (not (= .cse103 .cse100)) (= (select .cse101 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse103) 0))))))) .cse104)) (and .cse0 (or .cse105 (and (or (exists ((v_prenex_3 Int) (v_DerPreprocessor_71 Int)) (let ((.cse108 (select .cse4 v_prenex_3))) (let ((.cse107 (store (store .cse23 .cse108 1) 0 0))) (let ((.cse106 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse107 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse108 1) 0 v_DerPreprocessor_71) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse108 1))) (and (= (select .cse106 0) 0) (= |c_#valid| .cse107) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse108) 0) (= (select .cse106 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse108 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (and (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| |c_ULTIMATE.start_main_~#list~0#1.base|)) (exists ((v_prenex_3 Int) (v_DerPreprocessor_165 Int) (v_DerPreprocessor_166 Int)) (let ((.cse109 (select .cse4 v_prenex_3))) (let ((.cse111 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_165) .cse109 1) |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_166) 0 0))) (let ((.cse110 (select .cse111 |c_ULTIMATE.start_main_~#list~0#1.base|))) (and (= .cse109 |c_ULTIMATE.start_main_~#list~0#1.base|) (= .cse110 v_DerPreprocessor_165) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse109 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| .cse110) .cse109 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select .cse111 |v_ULTIMATE.start_freeData_~data#1.base_28|)) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse109 1) |v_ULTIMATE.start_freeData_~data#1.base_28|) 0)))))) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0)))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (and (exists ((v_prenex_3 Int) (v_DerPreprocessor_166 Int)) (let ((.cse113 (select .cse4 v_prenex_3))) (let ((.cse112 (store .cse23 .cse113 1))) (let ((.cse114 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse115 (store (store .cse112 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_166) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse115 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse113 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select .cse115 |v_ULTIMATE.start_freeData_~data#1.base_28|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse113 1))) (and (= |c_#valid| (store (store .cse112 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse113) 0) (= (select .cse114 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse114 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (not (= .cse113 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0))))) .cse9) .cse116 (and (exists ((v_prenex_3 Int) (v_DerPreprocessor_162 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_70 Int)) (let ((.cse119 (select .cse34 v_prenex_3))) (let ((.cse118 (store |c_ULTIMATE.start_main_old_#valid#1| .cse119 1))) (let ((.cse117 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_70) .cse119 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select (store (store .cse118 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_162) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28|)) 0)) .cse119 1))) (and (= (select .cse117 0) 1) (= |c_#valid| (store (store .cse118 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse119 0)) (= (select .cse117 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse119) 0)))))) .cse29))) (and .cse120 (exists ((v_prenex_4 Int) (v_DerPreprocessor_154 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (let ((.cse121 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_4) .cse42 1))) (and (= (select .cse121 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_4) (= |c_#valid| (store .cse53 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse121 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= v_DerPreprocessor_154 (select (store (store .cse54 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_154) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28|))))) .cse55) (and (exists ((v_prenex_4 Int) (v_DerPreprocessor_172 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (let ((.cse122 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_4) .cse42 1))) (and (= (select .cse122 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_4) (= |c_#valid| (store .cse53 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse122 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= (select (store (store .cse54 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_172) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28|) v_DerPreprocessor_172)))) .cse123 .cse55) (and .cse0 (or (and (or (exists ((|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (and (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (exists ((v_DerPreprocessor_77 Int) (v_prenex_3 Int) (v_DerPreprocessor_76 Int)) (let ((.cse124 (select .cse4 v_prenex_3))) (let ((.cse126 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_76) .cse124 1) |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_77) 0 0))) (let ((.cse125 (select .cse126 |c_ULTIMATE.start_main_~#list~0#1.base|))) (and (= .cse124 |c_ULTIMATE.start_main_~#list~0#1.base|) (= v_DerPreprocessor_76 .cse125) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse124 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| .cse125) .cse124 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select .cse126 |v_ULTIMATE.start_freeData_~data#1.base_28|)) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse124 1) |v_ULTIMATE.start_freeData_~data#1.base_28|) 0)))))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (and (exists ((v_DerPreprocessor_77 Int) (v_prenex_3 Int)) (let ((.cse128 (select .cse4 v_prenex_3))) (let ((.cse127 (store .cse23 .cse128 1))) (let ((.cse129 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse130 (store (store .cse127 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_77) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse130 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse128 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select .cse130 |v_ULTIMATE.start_freeData_~data#1.base_28|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse128 1))) (and (= |c_#valid| (store (store .cse127 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse128) 0) (= (select .cse129 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse128 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse129 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0)))))) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0)))) (exists ((v_DerPreprocessor_68 Int) (v_prenex_3 Int)) (let ((.cse132 (select .cse4 v_prenex_3))) (let ((.cse131 (store (store .cse23 .cse132 1) 0 0))) (let ((.cse133 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse131 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse132 1) 0 v_DerPreprocessor_68) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse132 1))) (and (= |c_#valid| .cse131) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse132) 0) (= (select .cse133 0) 0) (= (select .cse133 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse132 |c_ULTIMATE.start_main_~#list~0#1.base|)))))))) .cse9) (and (exists ((v_DerPreprocessor_78 Int) (v_DerPreprocessor_67 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (let ((.cse136 (select .cse34 v_prenex_3))) (let ((.cse134 (store |c_ULTIMATE.start_main_old_#valid#1| .cse136 1))) (let ((.cse135 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_67) .cse136 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select (store (store .cse134 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_78) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28|)) 0)) .cse136 1))) (and (= |c_#valid| (store (store .cse134 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse135 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (not (= .cse136 0)) (= (select .cse135 0) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse136) 0)))))) .cse29) (and (or .cse137 .cse116) .cse138))) (and (exists ((v_prenex_4 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_80 Int)) (let ((.cse139 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_4) .cse42 1))) (and (= (select .cse139 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_4) (= |c_#valid| (store .cse53 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse139 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= v_DerPreprocessor_80 (select (store (store .cse54 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_80) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28|))))) .cse140 .cse55) (and (let ((.cse166 (or (exists ((v_prenex_4 Int) (v_arrayElimCell_161 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (let ((.cse356 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_4) .cse42 1))) (and (= (select .cse356 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_4) (= (store (store (store .cse54 v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0) |c_#valid|) (not (= v_arrayElimCell_161 0)) (= (select .cse356 v_arrayElimCell_161) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_161))))) (exists ((v_prenex_4 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (let ((.cse357 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_4) .cse42 1))) (and (= (select .cse357 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_4) (= |c_#valid| (store .cse53 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse357 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0))))) (and (exists ((|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (= |c_#valid| (store .cse53 |v_ULTIMATE.start_freeData_~data#1.base_28| 0))) (exists ((v_prenex_4 Int)) (let ((.cse358 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_4) .cse42 1))) (and (= (select .cse358 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_4) (= (select .cse358 0) 0))))))) (.cse165 (exists ((v_arrayElimCell_161 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (let ((.cse353 (select .cse4 v_prenex_3))) (let ((.cse354 (store (store (store .cse23 .cse353 1) v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)) 0 0))) (let ((.cse355 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse354 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse353 1) v_arrayElimCell_161 (select .cse354 v_arrayElimCell_161)) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse353 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse353) 0) (= |c_#valid| (store .cse354 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse355 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= v_arrayElimCell_161 0)) (not (= .cse353 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse355 v_arrayElimCell_161) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_161)))))))) (.cse257 (exists ((v_arrayElimCell_161 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse352 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse351 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse352 1))) (and (= (select .cse351 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= v_arrayElimCell_161 0)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse352 1) v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= .cse352 |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select .cse351 v_arrayElimCell_161) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_161)))))))) (or (and .cse0 (or .cse141 .cse142 (exists ((v_arrayElimCell_161 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse144 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse143 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse144 1))) (and (= (select .cse143 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= .cse144 0)) (not (= v_arrayElimCell_161 0)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse144 1) v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= .cse144 |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select .cse143 v_arrayElimCell_161) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_161)))))) (and .cse145 (or (and .cse29 (or (exists ((v_arrayElimCell_161 Int) (v_DerPreprocessor_23 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (let ((.cse148 (select .cse34 v_prenex_3))) (let ((.cse147 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse148 1) v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)) 0 0))) (let ((.cse146 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_23) .cse148 1) v_arrayElimCell_161 (select .cse147 v_arrayElimCell_161)) 0)) .cse148 1))) (and (= (select .cse146 0) 1) (= |c_#valid| (store .cse147 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse148 0)) (= (select .cse146 v_arrayElimCell_161) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_161)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse148) 0)))))) (exists ((v_DerPreprocessor_23 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_148 Int)) (let ((.cse151 (select .cse34 v_prenex_3))) (let ((.cse150 (store |c_ULTIMATE.start_main_old_#valid#1| .cse151 1))) (let ((.cse149 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_23) .cse151 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select (store (store .cse150 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_148) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28|)) 0)) .cse151 1))) (and (= (select .cse149 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= (select .cse149 0) 1) (= |c_#valid| (store (store .cse150 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse151 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse151) 0)))))))) (and (or (exists ((v_prenex_3 Int) (v_DerPreprocessor_151 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (let ((.cse154 (select .cse4 v_prenex_3))) (let ((.cse153 (store .cse23 .cse154 1))) (let ((.cse152 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse155 (store (store .cse153 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_151) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse155 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse154 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select .cse155 |v_ULTIMATE.start_freeData_~data#1.base_28|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse154 1))) (and (= (select .cse152 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= |c_#valid| (store (store .cse153 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse154) 0) (not (= .cse154 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse152 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) (exists ((v_arrayElimCell_161 Int) (v_DerPreprocessor_150 Int) (v_prenex_3 Int)) (let ((.cse158 (select |c_#valid| v_arrayElimCell_161)) (.cse157 (select .cse4 v_prenex_3))) (let ((.cse156 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse159 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_150) .cse157 1) v_arrayElimCell_161 .cse158) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse159 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse157 1) v_arrayElimCell_161 (select .cse159 v_arrayElimCell_161))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse157 1))) (and (= (select .cse156 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse157) 0) (= (select .cse156 v_arrayElimCell_161) 0) (not (= v_arrayElimCell_161 0)) (not (= .cse157 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse157 1) v_arrayElimCell_161 .cse158) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)))))) (exists ((v_DerPreprocessor_24 Int) (v_prenex_3 Int) (v_DerPreprocessor_149 Int)) (let ((.cse161 (select .cse4 v_prenex_3))) (let ((.cse160 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_149) .cse161 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse161 1) 0 v_DerPreprocessor_24) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse161 1))) (and (= (select .cse160 0) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse161 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse161) 0) (= (select .cse160 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse161 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (exists ((v_DerPreprocessor_24 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (let ((.cse163 (select .cse4 v_prenex_3))) (let ((.cse162 (store (store .cse23 .cse163 1) 0 0))) (let ((.cse164 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse162 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse163 1) 0 v_DerPreprocessor_24) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse163 1))) (and (= |c_#valid| (store .cse162 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse163) 0) (not (= .cse163 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse164 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse164 0) 0)))))) .cse165) .cse9))))) (and .cse80 .cse166 .cse55) (and .cse120 .cse166 .cse55) (and .cse82 .cse166 .cse55) (and .cse0 (or .cse167 (and .cse145 (or (and .cse9 (or (exists ((v_prenex_3 Int) (v_DerPreprocessor_141 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (let ((.cse170 (select .cse4 v_prenex_3))) (let ((.cse168 (store .cse23 .cse170 1))) (let ((.cse169 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse171 (store (store .cse168 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_141) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse171 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse170 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select .cse171 |v_ULTIMATE.start_freeData_~data#1.base_28|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse170 1))) (and (= |c_#valid| (store (store .cse168 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse169 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (not (= .cse170 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse170) 0) (= (select .cse169 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse170 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0))))))) (exists ((v_prenex_3 Int) (v_DerPreprocessor_48 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (let ((.cse174 (select .cse4 v_prenex_3))) (let ((.cse173 (store (store .cse23 .cse174 1) 0 0))) (let ((.cse172 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse173 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse174 1) 0 v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse174 1))) (and (= (select .cse172 0) 0) (= |c_#valid| (store .cse173 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse172 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse174) 0) (not (= .cse174 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) .cse175 (exists ((v_prenex_3 Int) (v_DerPreprocessor_48 Int) (v_DerPreprocessor_139 Int)) (let ((.cse177 (select .cse4 v_prenex_3))) (let ((.cse176 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_139) .cse177 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse177 1) 0 v_DerPreprocessor_48) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse177 1))) (and (= (select .cse176 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse177 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse177) 0) (not (= .cse177 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse176 0) 0))))) (exists ((v_DerPreprocessor_140 Int) (v_prenex_3 Int) (v_arrayElimCell_157 Int)) (let ((.cse180 (select |c_#valid| v_arrayElimCell_157)) (.cse179 (select .cse4 v_prenex_3))) (let ((.cse178 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse181 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_140) .cse179 1) v_arrayElimCell_157 .cse180) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse181 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse179 1) v_arrayElimCell_157 (select .cse181 v_arrayElimCell_157))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse179 1))) (and (= (select .cse178 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= v_arrayElimCell_157 0)) (= (select .cse178 v_arrayElimCell_157) 0) (not (= .cse179 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse179) 0) (not (= .cse179 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse179 1) v_arrayElimCell_157 .cse180) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0) |c_#valid|))))))) (and (or (exists ((v_DerPreprocessor_47 Int) (v_prenex_3 Int) (v_arrayElimCell_157 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (let ((.cse184 (select .cse34 v_prenex_3))) (let ((.cse182 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse184 1) v_arrayElimCell_157 (select |c_#valid| v_arrayElimCell_157)) 0 0))) (let ((.cse183 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_47) .cse184 1) v_arrayElimCell_157 (select .cse182 v_arrayElimCell_157)) 0)) .cse184 1))) (and (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_157)) (= |c_#valid| (store .cse182 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse183 v_arrayElimCell_157) 0) (= (select .cse183 0) 1) (not (= .cse184 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse184) 0)))))) (exists ((v_DerPreprocessor_47 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_138 Int)) (let ((.cse187 (select .cse34 v_prenex_3))) (let ((.cse186 (store |c_ULTIMATE.start_main_old_#valid#1| .cse187 1))) (let ((.cse185 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_47) .cse187 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select (store (store .cse186 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_138) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28|)) 0)) .cse187 1))) (and (= (select .cse185 0) 1) (= |c_#valid| (store (store .cse186 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse187 0)) (= (select .cse185 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse187) 0))))))) .cse29))))) (and .cse140 .cse166 .cse55) (and .cse120 .cse140 .cse166 .cse55) (and .cse0 (or .cse5 (exists ((v_prenex_3 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse190 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse189 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse190 1)) (.cse188 (select .cse4 v_prenex_3))) (and (not (= .cse188 0)) (= (select .cse189 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= (select .cse189 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= .cse188 .cse190)) (= (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse190 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0) |c_#valid|) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= .cse190 |c_ULTIMATE.start_main_~#list~0#1.base|))))) (exists ((v_arrayElimCell_161 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse193 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse191 (select .cse4 v_prenex_3)) (.cse192 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse193 1))) (and (not (= .cse191 0)) (= (select .cse192 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= .cse191 .cse193)) (not (= v_arrayElimCell_161 0)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse193 1) v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= .cse193 |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select .cse192 v_arrayElimCell_161) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_161)))))) (and .cse9 (or (exists ((v_prenex_3 Int) (v_DerPreprocessor_130 Int) (v_arrayElimCell_157 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse196 (select |c_#valid| v_arrayElimCell_157)) (.cse195 (select .cse4 v_prenex_3))) (let ((.cse194 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse197 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_130) .cse195 1) v_arrayElimCell_157 .cse196) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse197 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse195 1) v_arrayElimCell_157 (select .cse197 v_arrayElimCell_157))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse195 1))) (and (not (= v_arrayElimCell_157 0)) (= 0 (select .cse194 v_arrayElimCell_157)) (not (= .cse195 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse195) 0) (not (= .cse195 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (not (= .cse195 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse194 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse195 1) v_arrayElimCell_157 .cse196) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0) |c_#valid|))))) (exists ((v_DerPreprocessor_35 Int) (v_prenex_3 Int) (v_DerPreprocessor_132 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse198 (select .cse4 v_prenex_3))) (let ((.cse199 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_132) .cse198 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse198 1) 0 v_DerPreprocessor_35) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse198 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse198 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse198) 0) (= (select .cse199 0) 0) (not (= .cse198 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= 1 (select .cse199 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= .cse198 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) .cse62 (exists ((v_DerPreprocessor_35 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse201 (select .cse4 v_prenex_3))) (let ((.cse200 (store (store .cse23 .cse201 1) 0 0))) (let ((.cse202 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse200 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse201 1) 0 v_DerPreprocessor_35) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse201 1))) (and (= |c_#valid| (store .cse200 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse201) 0) (not (= .cse201 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select .cse202 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse201 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse202 0) 0)))))) (exists ((v_prenex_3 Int) (v_DerPreprocessor_131 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse204 (select .cse4 v_prenex_3))) (let ((.cse203 (store .cse23 .cse204 1))) (let ((.cse205 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse206 (store (store .cse203 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_131) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse206 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse204 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select .cse206 |v_ULTIMATE.start_freeData_~data#1.base_28|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse204 1))) (and (= |c_#valid| (store (store .cse203 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse204 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse204) 0) (not (= .cse204 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select .cse205 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse204 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse205 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0)))))))) (and (or (exists ((v_DerPreprocessor_34 Int) (v_prenex_3 Int) (v_arrayElimCell_157 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse209 (select .cse34 v_prenex_3))) (let ((.cse208 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse209 1) v_arrayElimCell_157 (select |c_#valid| v_arrayElimCell_157)) 0 0))) (let ((.cse207 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_34) .cse209 1) v_arrayElimCell_157 (select .cse208 v_arrayElimCell_157)) 0)) .cse209 1))) (and (= (select .cse207 0) 1) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_157)) (= |c_#valid| (store .cse208 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse207 v_arrayElimCell_157) 0) (not (= .cse209 0)) (not (= .cse209 (select .cse34 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse209) 0)))))) (exists ((v_DerPreprocessor_34 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_133 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse212 (select .cse34 v_prenex_3))) (let ((.cse211 (store |c_ULTIMATE.start_main_old_#valid#1| .cse212 1))) (let ((.cse210 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_34) .cse212 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select (store (store .cse211 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_133) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28|)) 0)) .cse212 1))) (and (= (select .cse210 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= (select .cse210 0) 1) (= |c_#valid| (store (store .cse211 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse212 0)) (not (= .cse212 (select .cse34 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse212) 0))))))) .cse29))) (and .cse39 (or (and (or (and .cse29 (or (exists ((v_DerPreprocessor_44 Int) (v_arrayElimCell_161 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (let ((.cse213 (store (store .cse47 v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)) 0 0))) (let ((.cse214 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_44) .cse46 1) v_arrayElimCell_161 (select .cse213 v_arrayElimCell_161)) 0)) .cse46 1))) (and (= |c_#valid| (store .cse213 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse214 v_arrayElimCell_161) 0) (= (select .cse214 0) 1) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_161)))))) (exists ((v_DerPreprocessor_44 Int) (v_DerPreprocessor_143 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (let ((.cse215 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_44) .cse46 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select (store (store .cse47 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_143) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28|)) 0)) .cse46 1))) (and (= |c_#valid| (store .cse44 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse215 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= (select .cse215 0) 1)))))) (and .cse9 (or (and (= |c_#valid| (store .cse53 |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (exists ((v_DerPreprocessor_45 Int) (v_DerPreprocessor_146 Int)) (let ((.cse216 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_146) .cse42 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse42 1) 0 v_DerPreprocessor_45) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse42 1))) (and (= (select .cse216 0) 0) (= (select .cse216 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))) (exists ((v_arrayElimCell_161 Int) (v_DerPreprocessor_144 Int)) (let ((.cse217 (select |c_#valid| v_arrayElimCell_161))) (let ((.cse218 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse219 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_144) .cse42 1) v_arrayElimCell_161 .cse217) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse219 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse42 1) v_arrayElimCell_161 (select .cse219 v_arrayElimCell_161))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse42 1))) (and (= |c_#valid| (store (store (store .cse54 v_arrayElimCell_161 .cse217) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select .cse218 v_arrayElimCell_161) 0) (not (= v_arrayElimCell_161 0)) (= 1 (select .cse218 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_145 Int)) (let ((.cse220 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse221 (store (store .cse50 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_145) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse221 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse42 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select .cse221 |v_ULTIMATE.start_freeData_~data#1.base_28|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse42 1))) (and (= (select .cse220 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse220 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= |c_#valid| (store .cse43 |v_ULTIMATE.start_freeData_~data#1.base_28| 0))))) (exists ((v_arrayElimCell_161 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (let ((.cse222 (store (store .cse50 v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)) 0 0))) (let ((.cse223 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse222 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse42 1) v_arrayElimCell_161 (select .cse222 v_arrayElimCell_161)) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse42 1))) (and (= |c_#valid| (store .cse222 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= v_arrayElimCell_161 0)) (= (select .cse223 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse223 v_arrayElimCell_161) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_161)))))) (and (exists ((v_DerPreprocessor_45 Int)) (let ((.cse224 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store .cse41 0 v_DerPreprocessor_45) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse42 1))) (and (= (select .cse224 0) 0) (= (select .cse224 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (and (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store .cse43 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)))))))) .cse51) (and .cse166 .cse55))) (and .cse166 .cse55 .cse225) (and .cse0 (or (and (or (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_112 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int) (v_DerPreprocessor_40 Int)) (let ((.cse229 (select .cse34 v_prenex_3))) (let ((.cse228 (store |c_ULTIMATE.start_main_old_#valid#1| .cse229 1))) (let ((.cse227 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_40) .cse229 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select (store (store .cse228 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_112) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28|)) 0)) .cse229 1)) (.cse226 (select .cse34 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (not (= .cse226 0)) (= (select .cse227 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= (select .cse227 0) 1) (= |c_#valid| (store (store .cse228 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse229 0)) (not (= .cse229 .cse226)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse229) 0)))))) (exists ((v_arrayElimCell_161 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int) (v_DerPreprocessor_40 Int)) (let ((.cse233 (select .cse34 v_prenex_3))) (let ((.cse232 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse233 1) v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)) 0 0))) (let ((.cse231 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_40) .cse233 1) v_arrayElimCell_161 (select .cse232 v_arrayElimCell_161)) 0)) .cse233 1)) (.cse230 (select .cse34 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (not (= .cse230 0)) (= (select .cse231 0) 1) (= |c_#valid| (store .cse232 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse233 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_161)) (= 0 (select .cse231 v_arrayElimCell_161)) (not (= .cse233 .cse230)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse233) 0))))))) .cse29) .cse97 (exists ((v_arrayElimCell_160 Int) (v_prenex_3 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse235 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse234 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse235 1))) (and (= (select .cse234 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= .cse235 0)) (= (select .cse234 v_arrayElimCell_160) 0) (not (= (select .cse4 v_prenex_3) .cse235)) (not (= v_arrayElimCell_160 0)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse235 1) v_arrayElimCell_160 (select |c_#valid| v_arrayElimCell_160)) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_160)) (= .cse235 |c_ULTIMATE.start_main_~#list~0#1.base|))))) (and .cse9 (or (exists ((v_arrayElimCell_161 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse237 (select .cse4 v_prenex_3))) (let ((.cse238 (store (store (store .cse23 .cse237 1) v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)) 0 0))) (let ((.cse236 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|)) (.cse239 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse238 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse237 1) v_arrayElimCell_161 (select .cse238 v_arrayElimCell_161)) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse237 1))) (and (not (= .cse236 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse237) 0) (not (= .cse237 .cse236)) (= |c_#valid| (store .cse238 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse239 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= v_arrayElimCell_161 0)) (not (= .cse237 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse239 v_arrayElimCell_161) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_161))))))) (exists ((v_arrayElimCell_161 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int) (v_DerPreprocessor_115 Int)) (let ((.cse243 (select |c_#valid| v_arrayElimCell_161)) (.cse242 (select .cse4 v_prenex_3))) (let ((.cse240 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse244 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_115) .cse242 1) v_arrayElimCell_161 .cse243) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse244 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse242 1) v_arrayElimCell_161 (select .cse244 v_arrayElimCell_161))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse242 1)) (.cse241 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (= (select .cse240 v_arrayElimCell_161) 0) (= (select .cse240 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse241 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse242) 0) (not (= .cse242 .cse241)) (not (= v_arrayElimCell_161 0)) (not (= .cse242 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse242 1) v_arrayElimCell_161 .cse243) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)))))) (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int) (v_DerPreprocessor_116 Int)) (let ((.cse248 (select .cse4 v_prenex_3))) (let ((.cse246 (store .cse23 .cse248 1))) (let ((.cse247 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|)) (.cse245 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse249 (store (store .cse246 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_116) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse249 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse248 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select .cse249 |v_ULTIMATE.start_freeData_~data#1.base_28|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse248 1))) (and (= (select .cse245 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store (store .cse246 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse247 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse248) 0) (not (= .cse248 .cse247)) (not (= .cse248 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse245 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0))))))) (exists ((v_prenex_3 Int) (v_DerPreprocessor_114 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int) (v_DerPreprocessor_41 Int)) (let ((.cse250 (select .cse4 v_prenex_3))) (let ((.cse251 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|)) (.cse252 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_114) .cse250 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse250 1) 0 v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse250 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse250 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= .cse251 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse250) 0) (= (select .cse252 0) 0) (not (= .cse250 .cse251)) (= (select .cse252 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse250 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int) (v_DerPreprocessor_41 Int)) (let ((.cse255 (select .cse4 v_prenex_3))) (let ((.cse253 (store (store .cse23 .cse255 1) 0 0))) (let ((.cse254 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|)) (.cse256 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse253 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse255 1) 0 v_DerPreprocessor_41) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse255 1))) (and (= |c_#valid| (store .cse253 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse254 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse255) 0) (not (= .cse255 .cse254)) (not (= .cse255 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse256 0) 0) (= (select .cse256 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))))) .cse104)) (and (or .cse142 .cse257 (and (or (exists ((v_prenex_3 Int) (v_DerPreprocessor_26 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (let ((.cse259 (select .cse4 v_prenex_3))) (let ((.cse258 (store (store .cse23 .cse259 1) 0 0))) (let ((.cse260 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse258 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse259 1) 0 v_DerPreprocessor_26) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse259 1))) (and (= |c_#valid| (store .cse258 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse259) 0) (not (= .cse259 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse260 0) 0) (= (select .cse260 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_127 Int)) (let ((.cse263 (select .cse4 v_prenex_3))) (let ((.cse261 (store .cse23 .cse263 1))) (let ((.cse262 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse264 (store (store .cse261 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_127) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse264 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse263 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select .cse264 |v_ULTIMATE.start_freeData_~data#1.base_28|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse263 1))) (and (= |c_#valid| (store (store .cse261 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse262 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse263) 0) (= (select .cse262 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (not (= .cse263 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0))))))) (exists ((v_arrayElimCell_161 Int) (v_prenex_3 Int) (v_DerPreprocessor_126 Int)) (let ((.cse267 (select |c_#valid| v_arrayElimCell_161)) (.cse266 (select .cse4 v_prenex_3))) (let ((.cse265 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse268 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_126) .cse266 1) v_arrayElimCell_161 .cse267) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse268 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse266 1) v_arrayElimCell_161 (select .cse268 v_arrayElimCell_161))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse266 1))) (and (= (select .cse265 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse265 v_arrayElimCell_161) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse266) 0) (not (= v_arrayElimCell_161 0)) (not (= .cse266 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse266 1) v_arrayElimCell_161 .cse267) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)))))) (exists ((v_prenex_3 Int) (v_DerPreprocessor_26 Int) (v_DerPreprocessor_125 Int)) (let ((.cse269 (select .cse4 v_prenex_3))) (let ((.cse270 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_125) .cse269 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse269 1) 0 v_DerPreprocessor_26) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse269 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse269 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse269) 0) (= (select .cse270 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse270 0) 0) (not (= .cse269 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) .cse165) .cse9) .cse137 (and .cse29 (or (exists ((v_DerPreprocessor_25 Int) (v_arrayElimCell_161 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (let ((.cse273 (select .cse34 v_prenex_3))) (let ((.cse272 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse273 1) v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)) 0 0))) (let ((.cse271 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_25) .cse273 1) v_arrayElimCell_161 (select .cse272 v_arrayElimCell_161)) 0)) .cse273 1))) (and (= (select .cse271 0) 1) (= (select .cse271 v_arrayElimCell_161) 0) (= |c_#valid| (store .cse272 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse273 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_161)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse273) 0)))))) (exists ((v_DerPreprocessor_25 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_123 Int)) (let ((.cse276 (select .cse34 v_prenex_3))) (let ((.cse275 (store |c_ULTIMATE.start_main_old_#valid#1| .cse276 1))) (let ((.cse274 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_25) .cse276 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select (store (store .cse275 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_123) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28|)) 0)) .cse276 1))) (and (= (select .cse274 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= |c_#valid| (store (store .cse275 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse276 0)) (= (select .cse274 0) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse276) 0))))))))) .cse0) (and .cse0 (or (and .cse29 (or (exists ((v_arrayElimCell_161 Int) (v_prenex_3 Int) (v_DerPreprocessor_29 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse279 (select .cse34 v_prenex_3))) (let ((.cse278 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse279 1) v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)) 0 0))) (let ((.cse277 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_29) .cse279 1) v_arrayElimCell_161 (select .cse278 v_arrayElimCell_161)) 0)) .cse279 1))) (and (= (select .cse277 0) 1) (= |c_#valid| (store .cse278 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse279 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_161)) (not (= .cse279 (select .cse34 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse279) 0) (= (select .cse277 v_arrayElimCell_161) 0)))))) (exists ((v_prenex_3 Int) (v_DerPreprocessor_29 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_111 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse282 (select .cse34 v_prenex_3))) (let ((.cse281 (store |c_ULTIMATE.start_main_old_#valid#1| .cse282 1))) (let ((.cse280 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_29) .cse282 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select (store (store .cse281 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_111) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28|)) 0)) .cse282 1))) (and (= (select .cse280 0) 1) (= (select .cse280 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= |c_#valid| (store (store .cse281 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse282 0)) (not (= .cse282 (select .cse34 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse282) 0)))))))) .cse73 .cse97 (exists ((v_arrayElimCell_161 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse284 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse283 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse284 1))) (and (= (select .cse283 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= (select .cse4 v_prenex_3) .cse284)) (not (= v_arrayElimCell_161 0)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse284 1) v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= .cse284 |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select .cse283 v_arrayElimCell_161) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_161)))))) (and .cse9 (or (exists ((v_DerPreprocessor_107 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int) (v_DerPreprocessor_30 Int)) (let ((.cse286 (select .cse4 v_prenex_3))) (let ((.cse285 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_107) .cse286 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse286 1) 0 v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse286 1))) (and (= (select .cse285 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse286 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse286) 0) (= (select .cse285 0) 0) (not (= .cse286 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (not (= .cse286 |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (exists ((v_arrayElimCell_161 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse287 (select .cse4 v_prenex_3))) (let ((.cse288 (store (store (store .cse23 .cse287 1) v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)) 0 0))) (let ((.cse289 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse288 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse287 1) v_arrayElimCell_161 (select .cse288 v_arrayElimCell_161)) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse287 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse287) 0) (not (= .cse287 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= |c_#valid| (store .cse288 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse289 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= v_arrayElimCell_161 0)) (not (= .cse287 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse289 v_arrayElimCell_161) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_161))))))) (exists ((v_DerPreprocessor_109 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse291 (select .cse4 v_prenex_3))) (let ((.cse290 (store .cse23 .cse291 1))) (let ((.cse292 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse293 (store (store .cse290 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_109) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse293 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse291 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select .cse293 |v_ULTIMATE.start_freeData_~data#1.base_28|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse291 1))) (and (= |c_#valid| (store (store .cse290 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse291) 0) (not (= .cse291 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (not (= .cse291 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse292 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= (select .cse292 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) (exists ((v_DerPreprocessor_108 Int) (v_arrayElimCell_161 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse296 (select |c_#valid| v_arrayElimCell_161)) (.cse294 (select .cse4 v_prenex_3))) (let ((.cse295 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse297 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_108) .cse294 1) v_arrayElimCell_161 .cse296) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse297 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse294 1) v_arrayElimCell_161 (select .cse297 v_arrayElimCell_161))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse294 1))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse294) 0) (not (= .cse294 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select .cse295 v_arrayElimCell_161) 0) (not (= v_arrayElimCell_161 0)) (not (= .cse294 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse294 1) v_arrayElimCell_161 .cse296) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select .cse295 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))) (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int) (v_DerPreprocessor_30 Int)) (let ((.cse300 (select .cse4 v_prenex_3))) (let ((.cse298 (store (store .cse23 .cse300 1) 0 0))) (let ((.cse299 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse298 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse300 1) 0 v_DerPreprocessor_30) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse300 1))) (and (= |c_#valid| (store .cse298 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse299 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse300) 0) (not (= .cse300 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select .cse299 0) 0) (not (= .cse300 |c_ULTIMATE.start_main_~#list~0#1.base|))))))))))) (and .cse123 .cse166 .cse55) (and (or (and (or (exists ((v_DerPreprocessor_33 Int) (v_prenex_3 Int) (v_DerPreprocessor_102 Int)) (let ((.cse301 (select .cse4 v_prenex_3))) (let ((.cse302 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_102) .cse301 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse301 1) 0 v_DerPreprocessor_33) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse301 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse301 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse301) 0) (= (select .cse302 0) 0) (not (= .cse301 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse302 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))) (exists ((v_DerPreprocessor_33 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (let ((.cse304 (select .cse4 v_prenex_3))) (let ((.cse303 (store (store .cse23 .cse304 1) 0 0))) (let ((.cse305 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse303 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse304 1) 0 v_DerPreprocessor_33) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse304 1))) (and (= |c_#valid| (store .cse303 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse304) 0) (= (select .cse305 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse304 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse305 0) 0)))))) (exists ((v_arrayElimCell_161 Int) (v_prenex_3 Int) (v_DerPreprocessor_103 Int)) (let ((.cse308 (select |c_#valid| v_arrayElimCell_161)) (.cse307 (select .cse4 v_prenex_3))) (let ((.cse306 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse309 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_103) .cse307 1) v_arrayElimCell_161 .cse308) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse309 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse307 1) v_arrayElimCell_161 (select .cse309 v_arrayElimCell_161))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse307 1))) (and (= (select .cse306 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse306 v_arrayElimCell_161) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse307) 0) (not (= v_arrayElimCell_161 0)) (not (= .cse307 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse307 1) v_arrayElimCell_161 .cse308) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)))))) (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_104 Int)) (let ((.cse312 (select .cse4 v_prenex_3))) (let ((.cse310 (store .cse23 .cse312 1))) (let ((.cse311 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse313 (store (store .cse310 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_104) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse313 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse312 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select .cse313 |v_ULTIMATE.start_freeData_~data#1.base_28|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse312 1))) (and (= |c_#valid| (store (store .cse310 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse311 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse312) 0) (= (select .cse311 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (not (= .cse312 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0))))))) .cse165) .cse9) (and .cse29 (or (exists ((v_arrayElimCell_161 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_32 Int)) (let ((.cse315 (select .cse34 v_prenex_3))) (let ((.cse314 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse315 1) v_arrayElimCell_161 (select |c_#valid| v_arrayElimCell_161)) 0 0))) (let ((.cse316 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_32) .cse315 1) v_arrayElimCell_161 (select .cse314 v_arrayElimCell_161)) 0)) .cse315 1))) (and (= |c_#valid| (store .cse314 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse315 0)) (= (select .cse316 0) 1) (= (select .cse316 v_arrayElimCell_161) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_161)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse315) 0)))))) (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_32 Int) (v_DerPreprocessor_105 Int)) (let ((.cse319 (select .cse34 v_prenex_3))) (let ((.cse318 (store |c_ULTIMATE.start_main_old_#valid#1| .cse319 1))) (let ((.cse317 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_32) .cse319 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select (store (store .cse318 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_105) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28|)) 0)) .cse319 1))) (and (= (select .cse317 0) 1) (= (select .cse317 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= |c_#valid| (store (store .cse318 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse319 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse319) 0)))))))) (and (or .cse105 .cse142 .cse257) .cse138)) .cse0) (and .cse0 (or (and (or (exists ((v_DerPreprocessor_119 Int) (v_prenex_3 Int) (v_arrayElimCell_157 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse323 (select |c_#valid| v_arrayElimCell_157)) (.cse321 (select .cse4 v_prenex_3))) (let ((.cse322 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|)) (.cse320 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse324 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_119) .cse321 1) v_arrayElimCell_157 .cse323) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse324 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse321 1) v_arrayElimCell_157 (select .cse324 v_arrayElimCell_157))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse321 1))) (and (not (= v_arrayElimCell_157 0)) (= (select .cse320 v_arrayElimCell_157) 0) (not (= .cse321 0)) (not (= .cse322 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse321) 0) (not (= .cse321 .cse322)) (not (= .cse321 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse320 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse321 1) v_arrayElimCell_157 .cse323) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0) |c_#valid|))))) (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_19 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse327 (select .cse4 v_prenex_3))) (let ((.cse325 (store (store .cse23 .cse327 1) 0 0))) (let ((.cse328 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse325 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse327 1) 0 v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse327 1)) (.cse326 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (= |c_#valid| (store .cse325 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse326 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse327) 0) (= (select .cse328 0) 0) (= (select .cse328 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse327 .cse326)) (not (= .cse327 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (exists ((v_prenex_3 Int) (v_DerPreprocessor_121 Int) (v_DerPreprocessor_19 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse329 (select .cse4 v_prenex_3))) (let ((.cse330 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|)) (.cse331 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_121) .cse329 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse329 1) 0 v_DerPreprocessor_19) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse329 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse329 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (not (= .cse330 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse329) 0) (not (= .cse329 .cse330)) (not (= .cse329 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse331 0) 0) (= (select .cse331 |c_ULTIMATE.start_main_~#list~0#1.base|) 1))))) .cse10 (exists ((v_prenex_3 Int) (v_DerPreprocessor_120 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse334 (select .cse4 v_prenex_3))) (let ((.cse332 (store .cse23 .cse334 1))) (let ((.cse335 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|)) (.cse333 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse336 (store (store .cse332 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_120) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse336 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse334 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select .cse336 |v_ULTIMATE.start_freeData_~data#1.base_28|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse334 1))) (and (= |c_#valid| (store (store .cse332 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse333 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= .cse334 0)) (not (= .cse335 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse334) 0) (not (= .cse334 .cse335)) (= (select .cse333 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (not (= .cse334 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0)))))))) .cse9) .cse5 (exists ((v_arrayElimCell_160 Int) (v_prenex_3 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse339 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse338 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse339 1)) (.cse337 (select .cse4 v_prenex_3))) (and (not (= .cse337 0)) (= (select .cse338 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= .cse339 0)) (= (select .cse338 v_arrayElimCell_160) 0) (not (= .cse337 .cse339)) (not (= v_arrayElimCell_160 0)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse339 1) v_arrayElimCell_160 (select |c_#valid| v_arrayElimCell_160)) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_160)) (= .cse339 |c_ULTIMATE.start_main_~#list~0#1.base|))))) (and .cse29 (or (exists ((v_prenex_3 Int) (v_DerPreprocessor_18 Int) (v_arrayElimCell_157 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse343 (select .cse34 v_prenex_3))) (let ((.cse342 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse343 1) v_arrayElimCell_157 (select |c_#valid| v_arrayElimCell_157)) 0 0))) (let ((.cse340 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_18) .cse343 1) v_arrayElimCell_157 (select .cse342 v_arrayElimCell_157)) 0)) .cse343 1)) (.cse341 (select .cse34 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (= (select .cse340 v_arrayElimCell_157) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_157)) (not (= .cse341 0)) (= |c_#valid| (store .cse342 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse343 0)) (= (select .cse340 0) 1) (not (= .cse343 .cse341)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse343) 0)))))) (exists ((v_prenex_3 Int) (v_DerPreprocessor_18 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_122 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse347 (select .cse34 v_prenex_3))) (let ((.cse346 (store |c_ULTIMATE.start_main_old_#valid#1| .cse347 1))) (let ((.cse345 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_18) .cse347 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select (store (store .cse346 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_122) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28|)) 0)) .cse347 1)) (.cse344 (select .cse34 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (and (not (= .cse344 0)) (= 0 (select .cse345 |v_ULTIMATE.start_freeData_~data#1.base_28|)) (= |c_#valid| (store (store .cse346 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse347 0)) (= (select .cse345 0) 1) (not (= .cse347 .cse344)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse347) 0)))))))) (exists ((v_prenex_3 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse350 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse349 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse350 1)) (.cse348 (select .cse4 v_prenex_3))) (and (not (= .cse348 0)) (= (select .cse349 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= (select .cse349 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= .cse350 0)) (not (= .cse348 .cse350)) (= (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse350 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0) |c_#valid|) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= .cse350 |c_ULTIMATE.start_main_~#list~0#1.base|))))))))) .cse359) (and .cse0 (or (and (or (exists ((|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (and (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| |c_ULTIMATE.start_main_~#list~0#1.base|)) (exists ((v_DerPreprocessor_89 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse362 (select .cse4 v_prenex_3))) (let ((.cse360 (store .cse23 .cse362 1))) (let ((.cse361 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse363 (store (store .cse360 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_89) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse363 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse362 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select .cse363 |v_ULTIMATE.start_freeData_~data#1.base_28|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse362 1))) (and (= |c_#valid| (store (store .cse360 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse361 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= (select .cse361 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse362) 0) (not (= .cse362 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (not (= .cse362 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0)))) (exists ((v_prenex_3 Int) (v_DerPreprocessor_64 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse365 (select .cse4 v_prenex_3))) (let ((.cse364 (store (store .cse23 .cse365 1) 0 0))) (let ((.cse366 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse364 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse365 1) 0 v_DerPreprocessor_64) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse365 1))) (and (= |c_#valid| .cse364) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse365) 0) (= (select .cse366 0) 0) (not (= .cse365 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (not (= .cse365 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse366 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (and (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| |c_ULTIMATE.start_main_~#list~0#1.base|)) (exists ((v_DerPreprocessor_88 Int) (v_DerPreprocessor_89 Int) (v_prenex_3 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse367 (select .cse4 v_prenex_3))) (let ((.cse369 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_88) .cse367 1) |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_89) 0 0))) (let ((.cse368 (select .cse369 |c_ULTIMATE.start_main_~#list~0#1.base|))) (and (= .cse367 |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| .cse368) .cse367 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select .cse369 |v_ULTIMATE.start_freeData_~data#1.base_28|)) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse367 1) |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (not (= .cse367 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= v_DerPreprocessor_88 .cse368) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse367 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0))))))) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0))))) .cse9) (and .cse29 (exists ((v_prenex_3 Int) (v_DerPreprocessor_90 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int) (v_DerPreprocessor_63 Int)) (let ((.cse372 (select .cse34 v_prenex_3))) (let ((.cse371 (store |c_ULTIMATE.start_main_old_#valid#1| .cse372 1))) (let ((.cse370 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_63) .cse372 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select (store (store .cse371 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_90) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28|)) 0)) .cse372 1))) (and (= (select .cse370 0) 1) (= |c_#valid| (store (store .cse371 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse372 0)) (= (select .cse370 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (not (= .cse372 (select .cse34 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse372) 0))))))) .cse73 (exists ((v_prenex_3 Int) (v_DerPreprocessor_6 Int) (|v_ULTIMATE.start_append_~pointerToList#1.offset_39| Int)) (let ((.cse374 (select .cse4 |v_ULTIMATE.start_append_~pointerToList#1.offset_39|))) (let ((.cse373 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_6) .cse374 1))) (and (= (select .cse373 |c_ULTIMATE.start_main_~#list~0#1.base|) v_DerPreprocessor_6) (not (= (select .cse4 v_prenex_3) .cse374)) (= .cse374 |c_ULTIMATE.start_main_~#list~0#1.base|) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse374 1) 0 0)) (= (select .cse373 0) 0))))))) (and (exists ((v_prenex_4 Int) (v_DerPreprocessor_160 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (let ((.cse375 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_4) .cse42 1))) (and (= (select .cse375 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_4) (= |c_#valid| (store .cse53 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse375 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= (select (store (store .cse54 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_160) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28|) v_DerPreprocessor_160)))) .cse120 .cse140 .cse55) (and .cse0 (or (and (or (and (or (exists ((|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (and (exists ((v_prenex_3 Int) (v_DerPreprocessor_95 Int)) (let ((.cse377 (select .cse4 v_prenex_3))) (let ((.cse376 (store .cse23 .cse377 1))) (let ((.cse378 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse379 (store (store .cse376 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_95) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse379 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse377 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select .cse379 |v_ULTIMATE.start_freeData_~data#1.base_28|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse377 1))) (and (= |c_#valid| (store (store .cse376 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse377) 0) (not (= .cse377 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse378 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= (select .cse378 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0)))) (exists ((v_prenex_3 Int) (v_DerPreprocessor_74 Int)) (let ((.cse382 (select .cse4 v_prenex_3))) (let ((.cse380 (store (store .cse23 .cse382 1) 0 0))) (let ((.cse381 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse380 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse382 1) 0 v_DerPreprocessor_74) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse382 1))) (and (= |c_#valid| .cse380) (= (select .cse381 0) 0) (= (select .cse381 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse382) 0) (not (= .cse382 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) (exists ((|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (and (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| |c_ULTIMATE.start_main_~#list~0#1.base|)) (exists ((v_prenex_3 Int) (v_DerPreprocessor_94 Int) (v_DerPreprocessor_95 Int)) (let ((.cse383 (select .cse4 v_prenex_3))) (let ((.cse385 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_94) .cse383 1) |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_95) 0 0))) (let ((.cse384 (select .cse385 |c_ULTIMATE.start_main_~#list~0#1.base|))) (and (= .cse383 |c_ULTIMATE.start_main_~#list~0#1.base|) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| .cse384) .cse383 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select .cse385 |v_ULTIMATE.start_freeData_~data#1.base_28|)) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse383 1) |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse383 1) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= .cse384 v_DerPreprocessor_94)))))) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0))))) .cse9) (and .cse29 (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_92 Int) (v_DerPreprocessor_73 Int)) (let ((.cse388 (select .cse34 v_prenex_3))) (let ((.cse387 (store |c_ULTIMATE.start_main_old_#valid#1| .cse388 1))) (let ((.cse386 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_73) .cse388 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select (store (store .cse387 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_92) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28|)) 0)) .cse388 1))) (and (= (select .cse386 0) 1) (= (select .cse386 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= |c_#valid| (store (store .cse387 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse388 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse388) 0)))))))) .cse145) .cse116)) (and (exists ((v_prenex_4 Int) (v_DerPreprocessor_161 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (let ((.cse389 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_prenex_4) .cse42 1))) (and (= (select .cse389 |c_ULTIMATE.start_main_~#list~0#1.base|) v_prenex_4) (= |c_#valid| (store .cse53 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse389 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= (select (store (store .cse54 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_161) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28|) v_DerPreprocessor_161)))) .cse55 .cse225) (and (or (and .cse145 (or (and .cse29 (or (exists ((v_prenex_3 Int) (v_DerPreprocessor_174 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_61 Int)) (let ((.cse392 (select .cse34 v_prenex_3))) (let ((.cse391 (store |c_ULTIMATE.start_main_old_#valid#1| .cse392 1))) (let ((.cse390 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_61) .cse392 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select (store (store .cse391 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_174) 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28|)) 0)) .cse392 1))) (and (= (select .cse390 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (= |c_#valid| (store (store .cse391 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse390 0) 1) (not (= .cse392 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse392) 0)))))) (exists ((v_prenex_3 Int) (v_arrayElimCell_157 Int) (v_DerPreprocessor_61 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int)) (let ((.cse395 (select .cse34 v_prenex_3))) (let ((.cse394 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse395 1) v_arrayElimCell_157 (select |c_#valid| v_arrayElimCell_157)) 0 0))) (let ((.cse393 (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| 0 v_DerPreprocessor_61) .cse395 1) v_arrayElimCell_157 (select .cse394 v_arrayElimCell_157)) 0)) .cse395 1))) (and (= (select .cse393 v_arrayElimCell_157) 0) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| v_arrayElimCell_157)) (= |c_#valid| (store .cse394 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse393 0) 1) (not (= .cse395 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse395) 0)))))))) (and (or .cse175 (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_177 Int)) (let ((.cse397 (select .cse4 v_prenex_3))) (let ((.cse396 (store .cse23 .cse397 1))) (let ((.cse398 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse399 (store (store .cse396 |v_ULTIMATE.start_freeData_~data#1.base_28| v_DerPreprocessor_177) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse399 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse397 1) |v_ULTIMATE.start_freeData_~data#1.base_28| (select .cse399 |v_ULTIMATE.start_freeData_~data#1.base_28|))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse397 1))) (and (= |c_#valid| (store (store .cse396 0 0) |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse397 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse397) 0) (= (select .cse398 |v_ULTIMATE.start_freeData_~data#1.base_28|) 0) (not (= .cse397 |c_ULTIMATE.start_main_~#list~0#1.base|)) (not (= |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (= (select .cse398 |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))))) (exists ((v_prenex_3 Int) (v_DerPreprocessor_176 Int) (v_arrayElimCell_157 Int)) (let ((.cse402 (select |c_#valid| v_arrayElimCell_157)) (.cse400 (select .cse4 v_prenex_3))) (let ((.cse401 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (let ((.cse403 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_176) .cse400 1) v_arrayElimCell_157 .cse402) 0 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse403 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse400 1) v_arrayElimCell_157 (select .cse403 v_arrayElimCell_157))) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse400 1))) (and (not (= v_arrayElimCell_157 0)) (not (= .cse400 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse400) 0) (not (= .cse400 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select .cse401 |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select .cse401 v_arrayElimCell_157) 0) (= (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse400 1) v_arrayElimCell_157 .cse402) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0) |c_#valid|))))) (exists ((v_prenex_3 Int) (v_DerPreprocessor_175 Int) (v_DerPreprocessor_62 Int)) (let ((.cse404 (select .cse4 v_prenex_3))) (and (not (= .cse404 0)) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| .cse404 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0)) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse404) 0) (not (= .cse404 |c_ULTIMATE.start_main_~#list~0#1.base|)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| v_DerPreprocessor_175) .cse404 1) 0 0) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse404 1) 0 v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse404 1) |c_ULTIMATE.start_main_~#list~0#1.base|) 1)))) (exists ((v_prenex_3 Int) (|v_ULTIMATE.start_freeData_~data#1.base_28| Int) (v_DerPreprocessor_62 Int)) (let ((.cse406 (select .cse4 v_prenex_3))) (let ((.cse405 (store (store .cse23 .cse406 1) 0 0))) (and (= |c_#valid| (store .cse405 |v_ULTIMATE.start_freeData_~data#1.base_28| 0)) (not (= .cse406 0)) (= (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base| (select .cse405 |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse406 1) 0 v_DerPreprocessor_62) |c_ULTIMATE.start_main_~#list~0#1.base|)) .cse406 1) |c_ULTIMATE.start_main_~#list~0#1.base|) 1) (= (select |c_ULTIMATE.start_main_old_#valid#1| .cse406) 0) (not (= .cse406 |c_ULTIMATE.start_main_~#list~0#1.base|))))))) .cse9))) .cse167) .cse0)))))) (or (not .cse0) .cse359) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_main_~#list~0#1.base|) 0))))) is different from false