./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 d7d99b84861b7e58e44833cf97c5fb5fa14d1ad6f1b87526d3144a9659451e97 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:54:48,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:54:48,297 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 17:54:48,302 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:54:48,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:54:48,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:54:48,323 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:54:48,324 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:54:48,324 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:54:48,326 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:54:48,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:54:48,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:54:48,327 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:54:48,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:54:48,330 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:54:48,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:54:48,331 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:54:48,331 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:54:48,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:54:48,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:54:48,332 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:54:48,332 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:54:48,332 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 17:54:48,332 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:54:48,333 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:54:48,333 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:54:48,333 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:54:48,333 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:54:48,333 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:54:48,334 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:54:48,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:54:48,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:54:48,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:54:48,334 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:54:48,334 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:54:48,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:54:48,335 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:54:48,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:54:48,335 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:54:48,335 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:54:48,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:54:48,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:54:48,336 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> d7d99b84861b7e58e44833cf97c5fb5fa14d1ad6f1b87526d3144a9659451e97 [2024-10-14 17:54:48,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:54:48,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:54:48,593 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:54:48,594 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:54:48,594 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:54:48,595 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-2.i [2024-10-14 17:54:49,958 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:54:50,223 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:54:50,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-2.i [2024-10-14 17:54:50,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/245bbc4c8/6c99f52da38b41aeafa63cd88bd20753/FLAGd0e20d318 [2024-10-14 17:54:50,253 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/245bbc4c8/6c99f52da38b41aeafa63cd88bd20753 [2024-10-14 17:54:50,255 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:54:50,256 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:54:50,259 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:54:50,259 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:54:50,263 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:54:50,264 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:54:50" (1/1) ... [2024-10-14 17:54:50,264 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50a3f0ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:54:50, skipping insertion in model container [2024-10-14 17:54:50,265 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:54:50" (1/1) ... [2024-10-14 17:54:50,300 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:54:50,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:54:50,535 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:54:50,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:54:50,602 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:54:50,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:54:50 WrapperNode [2024-10-14 17:54:50,603 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:54:50,604 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:54:50,604 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:54:50,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:54:50,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:54:50" (1/1) ... [2024-10-14 17:54:50,621 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:54:50" (1/1) ... [2024-10-14 17:54:50,645 INFO L138 Inliner]: procedures = 126, calls = 35, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 91 [2024-10-14 17:54:50,645 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:54:50,646 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:54:50,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:54:50,646 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:54:50,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:54:50" (1/1) ... [2024-10-14 17:54:50,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:54:50" (1/1) ... [2024-10-14 17:54:50,656 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:54:50" (1/1) ... [2024-10-14 17:54:50,670 INFO L175 MemorySlicer]: Split 22 memory accesses to 3 slices as follows [2, 8, 12]. 55 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 2, 3]. [2024-10-14 17:54:50,670 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:54:50" (1/1) ... [2024-10-14 17:54:50,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:54:50" (1/1) ... [2024-10-14 17:54:50,676 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:54:50" (1/1) ... [2024-10-14 17:54:50,679 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:54:50" (1/1) ... [2024-10-14 17:54:50,680 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:54:50" (1/1) ... [2024-10-14 17:54:50,681 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:54:50" (1/1) ... [2024-10-14 17:54:50,683 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:54:50,684 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:54:50,684 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:54:50,684 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:54:50,684 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:54:50" (1/1) ... [2024-10-14 17:54:50,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:54:50,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:54:50,712 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:54:50,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:54:50,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:54:50,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:54:50,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 17:54:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 17:54:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 17:54:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 17:54:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 17:54:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 17:54:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 17:54:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:54:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 17:54:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 17:54:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-14 17:54:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 17:54:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 17:54:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 17:54:50,752 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:54:50,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:54:50,900 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:54:50,901 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:54:51,349 INFO L? ?]: Removed 103 outVars from TransFormulas that were not future-live. [2024-10-14 17:54:51,349 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:54:51,385 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:54:51,385 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 17:54:51,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:54:51 BoogieIcfgContainer [2024-10-14 17:54:51,386 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:54:51,387 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:54:51,388 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:54:51,391 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:54:51,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:54:50" (1/3) ... [2024-10-14 17:54:51,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19473d00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:54:51, skipping insertion in model container [2024-10-14 17:54:51,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:54:50" (2/3) ... [2024-10-14 17:54:51,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19473d00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:54:51, skipping insertion in model container [2024-10-14 17:54:51,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:54:51" (3/3) ... [2024-10-14 17:54:51,397 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232-2.i [2024-10-14 17:54:51,414 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:54:51,414 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2024-10-14 17:54:51,462 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:54:51,468 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;@507eb3dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:54:51,468 INFO L334 AbstractCegarLoop]: Starting to check reachability of 48 error locations. [2024-10-14 17:54:51,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 36 states have (on average 2.5) internal successors, (90), 84 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:51,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 17:54:51,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:54:51,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 17:54:51,478 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-14 17:54:51,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:54:51,483 INFO L85 PathProgramCache]: Analyzing trace with hash 161642, now seen corresponding path program 1 times [2024-10-14 17:54:51,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:54:51,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120481683] [2024-10-14 17:54:51,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:54:51,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:54:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:54:51,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:54:51,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:54:51,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120481683] [2024-10-14 17:54:51,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120481683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:54:51,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:54:51,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:54:51,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575915657] [2024-10-14 17:54:51,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:54:51,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:54:51,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:54:51,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:54:51,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:54:51,725 INFO L87 Difference]: Start difference. First operand has 85 states, 36 states have (on average 2.5) internal successors, (90), 84 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:51,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:54:51,836 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2024-10-14 17:54:51,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:54:51,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-10-14 17:54:51,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:54:51,844 INFO L225 Difference]: With dead ends: 77 [2024-10-14 17:54:51,844 INFO L226 Difference]: Without dead ends: 76 [2024-10-14 17:54:51,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:54:51,848 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 73 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:54:51,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 59 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:54:51,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-14 17:54:51,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-14 17:54:51,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 36 states have (on average 2.1944444444444446) internal successors, (79), 75 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:51,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2024-10-14 17:54:51,874 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 3 [2024-10-14 17:54:51,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:54:51,874 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2024-10-14 17:54:51,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:51,875 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2024-10-14 17:54:51,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-14 17:54:51,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:54:51,875 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-14 17:54:51,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:54:51,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-14 17:54:51,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:54:51,876 INFO L85 PathProgramCache]: Analyzing trace with hash 161643, now seen corresponding path program 1 times [2024-10-14 17:54:51,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:54:51,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091347144] [2024-10-14 17:54:51,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:54:51,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:54:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:54:51,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:54:51,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:54:51,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091347144] [2024-10-14 17:54:51,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091347144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:54:51,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:54:51,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:54:51,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892393379] [2024-10-14 17:54:51,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:54:52,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:54:52,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:54:52,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:54:52,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:54:52,001 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:52,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:54:52,160 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2024-10-14 17:54:52,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:54:52,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-10-14 17:54:52,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:54:52,162 INFO L225 Difference]: With dead ends: 85 [2024-10-14 17:54:52,162 INFO L226 Difference]: Without dead ends: 85 [2024-10-14 17:54:52,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:54:52,164 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 66 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:54:52,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 66 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:54:52,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-14 17:54:52,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 76. [2024-10-14 17:54:52,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 41 states have (on average 2.0) internal successors, (82), 75 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:52,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 82 transitions. [2024-10-14 17:54:52,181 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 82 transitions. Word has length 3 [2024-10-14 17:54:52,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:54:52,181 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 82 transitions. [2024-10-14 17:54:52,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:52,183 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 82 transitions. [2024-10-14 17:54:52,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 17:54:52,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:54:52,184 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 17:54:52,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:54:52,184 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-14 17:54:52,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:54:52,185 INFO L85 PathProgramCache]: Analyzing trace with hash 5010882, now seen corresponding path program 1 times [2024-10-14 17:54:52,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:54:52,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83073857] [2024-10-14 17:54:52,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:54:52,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:54:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:54:52,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:54:52,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:54:52,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83073857] [2024-10-14 17:54:52,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83073857] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:54:52,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:54:52,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:54:52,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3106968] [2024-10-14 17:54:52,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:54:52,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:54:52,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:54:52,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:54:52,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:54:52,254 INFO L87 Difference]: Start difference. First operand 76 states and 82 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:52,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:54:52,306 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2024-10-14 17:54:52,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:54:52,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-14 17:54:52,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:54:52,307 INFO L225 Difference]: With dead ends: 72 [2024-10-14 17:54:52,308 INFO L226 Difference]: Without dead ends: 72 [2024-10-14 17:54:52,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:54:52,308 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 8 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:54:52,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 79 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:54:52,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-14 17:54:52,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-14 17:54:52,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 71 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:52,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2024-10-14 17:54:52,313 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 4 [2024-10-14 17:54:52,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:54:52,313 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2024-10-14 17:54:52,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:52,314 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2024-10-14 17:54:52,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 17:54:52,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:54:52,314 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 17:54:52,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:54:52,314 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-14 17:54:52,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:54:52,315 INFO L85 PathProgramCache]: Analyzing trace with hash 5010883, now seen corresponding path program 1 times [2024-10-14 17:54:52,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:54:52,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493561452] [2024-10-14 17:54:52,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:54:52,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:54:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:54:52,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:54:52,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:54:52,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493561452] [2024-10-14 17:54:52,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493561452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:54:52,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:54:52,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:54:52,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255314984] [2024-10-14 17:54:52,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:54:52,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:54:52,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:54:52,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:54:52,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:54:52,365 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:52,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:54:52,412 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2024-10-14 17:54:52,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:54:52,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-14 17:54:52,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:54:52,413 INFO L225 Difference]: With dead ends: 68 [2024-10-14 17:54:52,413 INFO L226 Difference]: Without dead ends: 68 [2024-10-14 17:54:52,414 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:54:52,414 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 8 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:54:52,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 84 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:54:52,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-14 17:54:52,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-14 17:54:52,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 41 states have (on average 1.8048780487804879) internal successors, (74), 67 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:52,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2024-10-14 17:54:52,419 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 4 [2024-10-14 17:54:52,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:54:52,419 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2024-10-14 17:54:52,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:52,420 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2024-10-14 17:54:52,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 17:54:52,420 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:54:52,420 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:54:52,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:54:52,421 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-14 17:54:52,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:54:52,421 INFO L85 PathProgramCache]: Analyzing trace with hash 2084389185, now seen corresponding path program 1 times [2024-10-14 17:54:52,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:54:52,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543248922] [2024-10-14 17:54:52,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:54:52,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:54:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:54:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:54:52,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:54:52,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543248922] [2024-10-14 17:54:52,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543248922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:54:52,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:54:52,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:54:52,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900798089] [2024-10-14 17:54:52,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:54:52,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 17:54:52,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:54:52,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 17:54:52,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:54:52,579 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:52,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:54:52,702 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2024-10-14 17:54:52,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:54:52,702 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2024-10-14 17:54:52,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:54:52,703 INFO L225 Difference]: With dead ends: 75 [2024-10-14 17:54:52,703 INFO L226 Difference]: Without dead ends: 75 [2024-10-14 17:54:52,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-14 17:54:52,704 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 13 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:54:52,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 296 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:54:52,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-14 17:54:52,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2024-10-14 17:54:52,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.7173913043478262) internal successors, (79), 72 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:52,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 79 transitions. [2024-10-14 17:54:52,710 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 79 transitions. Word has length 8 [2024-10-14 17:54:52,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:54:52,710 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 79 transitions. [2024-10-14 17:54:52,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:52,710 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 79 transitions. [2024-10-14 17:54:52,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 17:54:52,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:54:52,710 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:54:52,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:54:52,711 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-14 17:54:52,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:54:52,711 INFO L85 PathProgramCache]: Analyzing trace with hash -2024679669, now seen corresponding path program 1 times [2024-10-14 17:54:52,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:54:52,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477200555] [2024-10-14 17:54:52,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:54:52,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:54:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:54:52,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:54:52,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:54:52,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477200555] [2024-10-14 17:54:52,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477200555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:54:52,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:54:52,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:54:52,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961220905] [2024-10-14 17:54:52,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:54:52,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:54:52,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:54:52,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:54:52,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:54:52,859 INFO L87 Difference]: Start difference. First operand 73 states and 79 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:52,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:54:52,975 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2024-10-14 17:54:52,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:54:52,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 17:54:52,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:54:52,976 INFO L225 Difference]: With dead ends: 83 [2024-10-14 17:54:52,976 INFO L226 Difference]: Without dead ends: 83 [2024-10-14 17:54:52,977 INFO L431 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 [2024-10-14 17:54:52,977 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 49 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:54:52,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 98 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:54:52,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-14 17:54:52,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 72. [2024-10-14 17:54:52,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 46 states have (on average 1.6956521739130435) internal successors, (78), 71 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2024-10-14 17:54:52,981 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 13 [2024-10-14 17:54:52,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:54:52,982 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2024-10-14 17:54:52,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:52,982 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2024-10-14 17:54:52,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 17:54:52,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:54:52,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:54:52,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:54:52,983 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-14 17:54:52,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:54:52,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2024679668, now seen corresponding path program 1 times [2024-10-14 17:54:52,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:54:52,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274168189] [2024-10-14 17:54:52,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:54:52,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:54:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:54:53,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:54:53,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:54:53,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274168189] [2024-10-14 17:54:53,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274168189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:54:53,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:54:53,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:54:53,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628186006] [2024-10-14 17:54:53,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:54:53,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:54:53,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:54:53,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:54:53,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:54:53,202 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:53,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:54:53,321 INFO L93 Difference]: Finished difference Result 83 states and 89 transitions. [2024-10-14 17:54:53,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:54:53,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 17:54:53,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:54:53,322 INFO L225 Difference]: With dead ends: 83 [2024-10-14 17:54:53,322 INFO L226 Difference]: Without dead ends: 83 [2024-10-14 17:54:53,322 INFO L431 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 [2024-10-14 17:54:53,323 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 57 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:54:53,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 99 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:54:53,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-14 17:54:53,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 71. [2024-10-14 17:54:53,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.673913043478261) internal successors, (77), 70 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:53,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 77 transitions. [2024-10-14 17:54:53,327 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 77 transitions. Word has length 13 [2024-10-14 17:54:53,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:54:53,327 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 77 transitions. [2024-10-14 17:54:53,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:53,328 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 77 transitions. [2024-10-14 17:54:53,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 17:54:53,328 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:54:53,328 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:54:53,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:54:53,329 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-14 17:54:53,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:54:53,329 INFO L85 PathProgramCache]: Analyzing trace with hash -96898914, now seen corresponding path program 1 times [2024-10-14 17:54:53,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:54:53,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744406158] [2024-10-14 17:54:53,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:54:53,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:54:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:54:53,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:54:53,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:54:53,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744406158] [2024-10-14 17:54:53,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744406158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:54:53,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:54:53,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:54:53,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737889431] [2024-10-14 17:54:53,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:54:53,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:54:53,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:54:53,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:54:53,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:54:53,383 INFO L87 Difference]: Start difference. First operand 71 states and 77 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:53,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:54:53,468 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2024-10-14 17:54:53,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:54:53,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 17:54:53,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:54:53,469 INFO L225 Difference]: With dead ends: 70 [2024-10-14 17:54:53,469 INFO L226 Difference]: Without dead ends: 70 [2024-10-14 17:54:53,469 INFO L431 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 [2024-10-14 17:54:53,470 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 8 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:54:53,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 124 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:54:53,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-14 17:54:53,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-14 17:54:53,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.6521739130434783) internal successors, (76), 69 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2024-10-14 17:54:53,473 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 15 [2024-10-14 17:54:53,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:54:53,474 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2024-10-14 17:54:53,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:53,474 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2024-10-14 17:54:53,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 17:54:53,474 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:54:53,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:54:53,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:54:53,475 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-14 17:54:53,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:54:53,475 INFO L85 PathProgramCache]: Analyzing trace with hash -96898913, now seen corresponding path program 1 times [2024-10-14 17:54:53,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:54:53,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864191380] [2024-10-14 17:54:53,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:54:53,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:54:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:54:53,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:54:53,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:54:53,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864191380] [2024-10-14 17:54:53,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864191380] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:54:53,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:54:53,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 17:54:53,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4151357] [2024-10-14 17:54:53,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:54:53,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:54:53,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:54:53,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:54:53,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:54:53,687 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:53,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:54:53,852 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2024-10-14 17:54:53,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:54:53,853 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 17:54:53,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:54:53,854 INFO L225 Difference]: With dead ends: 81 [2024-10-14 17:54:53,854 INFO L226 Difference]: Without dead ends: 81 [2024-10-14 17:54:53,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-14 17:54:53,855 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 54 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:54:53,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 132 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:54:53,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-14 17:54:53,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2024-10-14 17:54:53,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.6304347826086956) internal successors, (75), 68 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:53,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2024-10-14 17:54:53,859 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 15 [2024-10-14 17:54:53,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:54:53,860 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2024-10-14 17:54:53,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:53,860 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2024-10-14 17:54:53,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 17:54:53,861 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:54:53,861 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:54:53,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:54:53,861 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-14 17:54:53,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:54:53,862 INFO L85 PathProgramCache]: Analyzing trace with hash -64403600, now seen corresponding path program 1 times [2024-10-14 17:54:53,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:54:53,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052759750] [2024-10-14 17:54:53,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:54:53,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:54:53,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:54:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:54:53,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:54:53,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052759750] [2024-10-14 17:54:53,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052759750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:54:53,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:54:53,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:54:53,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818873776] [2024-10-14 17:54:53,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:54:53,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:54:53,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:54:53,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:54:53,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:54:53,963 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:54,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:54:54,054 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2024-10-14 17:54:54,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:54:54,055 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 17:54:54,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:54:54,055 INFO L225 Difference]: With dead ends: 66 [2024-10-14 17:54:54,055 INFO L226 Difference]: Without dead ends: 66 [2024-10-14 17:54:54,056 INFO L431 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 [2024-10-14 17:54:54,056 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:54:54,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 120 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:54:54,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-14 17:54:54,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-10-14 17:54:54,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.6097560975609757) internal successors, (66), 63 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:54,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2024-10-14 17:54:54,064 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 15 [2024-10-14 17:54:54,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:54:54,064 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2024-10-14 17:54:54,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:54,064 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2024-10-14 17:54:54,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 17:54:54,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:54:54,065 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:54:54,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:54:54,065 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-14 17:54:54,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:54:54,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1291100999, now seen corresponding path program 1 times [2024-10-14 17:54:54,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:54:54,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644419427] [2024-10-14 17:54:54,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:54:54,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:54:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:54:54,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:54:54,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:54:54,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644419427] [2024-10-14 17:54:54,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644419427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:54:54,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:54:54,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 17:54:54,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331119293] [2024-10-14 17:54:54,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:54:54,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:54:54,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:54:54,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:54:54,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:54:54,443 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:54,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:54:54,635 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2024-10-14 17:54:54,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 17:54:54,636 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2024-10-14 17:54:54,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:54:54,636 INFO L225 Difference]: With dead ends: 98 [2024-10-14 17:54:54,636 INFO L226 Difference]: Without dead ends: 98 [2024-10-14 17:54:54,637 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-14 17:54:54,637 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 36 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:54:54,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 205 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:54:54,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-14 17:54:54,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 74. [2024-10-14 17:54:54,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.5098039215686274) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:54,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2024-10-14 17:54:54,640 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 16 [2024-10-14 17:54:54,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:54:54,640 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2024-10-14 17:54:54,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:54,640 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2024-10-14 17:54:54,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 17:54:54,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:54:54,641 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:54:54,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:54:54,641 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-14 17:54:54,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:54:54,641 INFO L85 PathProgramCache]: Analyzing trace with hash -307164635, now seen corresponding path program 1 times [2024-10-14 17:54:54,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:54:54,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86618045] [2024-10-14 17:54:54,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:54:54,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:54:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:54:54,853 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:54:54,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:54:54,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86618045] [2024-10-14 17:54:54,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86618045] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:54:54,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113608409] [2024-10-14 17:54:54,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:54:54,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:54:54,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:54:54,856 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:54:54,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 17:54:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:54:54,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-14 17:54:54,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:54:55,022 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 [2024-10-14 17:54:55,055 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-10-14 17:54:55,055 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 [2024-10-14 17:54:55,074 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 25 treesize of output 13 [2024-10-14 17:54:55,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 17:54:55,123 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 25 treesize of output 13 [2024-10-14 17:54:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:54:55,129 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:54:55,219 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 [2024-10-14 17:54:55,476 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:54:55,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 135 treesize of output 339 [2024-10-14 17:54:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:54:55,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113608409] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:54:55,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:54:55,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-10-14 17:54:55,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533213622] [2024-10-14 17:54:55,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:54:55,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 17:54:55,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:54:55,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 17:54:55,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-14 17:54:55,888 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 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) [2024-10-14 17:54:56,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:54:56,140 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2024-10-14 17:54:56,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 17:54:56,140 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 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 16 [2024-10-14 17:54:56,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:54:56,141 INFO L225 Difference]: With dead ends: 75 [2024-10-14 17:54:56,141 INFO L226 Difference]: Without dead ends: 75 [2024-10-14 17:54:56,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2024-10-14 17:54:56,142 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 60 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:54:56,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 226 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:54:56,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-10-14 17:54:56,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2024-10-14 17:54:56,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 72 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:56,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2024-10-14 17:54:56,145 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 16 [2024-10-14 17:54:56,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:54:56,145 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2024-10-14 17:54:56,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 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) [2024-10-14 17:54:56,145 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2024-10-14 17:54:56,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 17:54:56,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:54:56,145 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:54:56,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 17:54:56,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-14 17:54:56,350 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-14 17:54:56,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:54:56,350 INFO L85 PathProgramCache]: Analyzing trace with hash -307164634, now seen corresponding path program 1 times [2024-10-14 17:54:56,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:54:56,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739471216] [2024-10-14 17:54:56,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:54:56,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:54:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:54:56,647 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:54:56,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:54:56,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739471216] [2024-10-14 17:54:56,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739471216] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:54:56,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134447574] [2024-10-14 17:54:56,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:54:56,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:54:56,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:54:56,649 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:54:56,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 17:54:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:54:56,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-14 17:54:56,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:54:56,776 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 [2024-10-14 17:54:56,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 17:54:56,794 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 17:54:56,795 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 [2024-10-14 17:54:56,799 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 18 treesize of output 13 [2024-10-14 17:54:56,819 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 25 treesize of output 13 [2024-10-14 17:54:56,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-14 17:54:56,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 17:54:56,870 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 25 treesize of output 13 [2024-10-14 17:54:56,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 7 treesize of output 3 [2024-10-14 17:54:56,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:54:56,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:54:56,998 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 [2024-10-14 17:54:57,010 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 [2024-10-14 17:54:57,012 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 [2024-10-14 17:54:57,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:54:57,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 134 [2024-10-14 17:54:57,122 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 68 treesize of output 64 [2024-10-14 17:54:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:54:57,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134447574] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:54:57,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:54:57,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-10-14 17:54:57,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759370207] [2024-10-14 17:54:57,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:54:57,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-14 17:54:57,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:54:57,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-14 17:54:57,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-10-14 17:54:57,206 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 19 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) [2024-10-14 17:54:57,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:54:57,601 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2024-10-14 17:54:57,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 17:54:57,601 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 19 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 16 [2024-10-14 17:54:57,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:54:57,603 INFO L225 Difference]: With dead ends: 74 [2024-10-14 17:54:57,603 INFO L226 Difference]: Without dead ends: 74 [2024-10-14 17:54:57,604 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2024-10-14 17:54:57,604 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 56 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:54:57,604 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 334 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:54:57,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-14 17:54:57,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2024-10-14 17:54:57,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 71 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:57,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2024-10-14 17:54:57,610 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 16 [2024-10-14 17:54:57,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:54:57,610 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2024-10-14 17:54:57,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 19 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) [2024-10-14 17:54:57,610 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2024-10-14 17:54:57,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 17:54:57,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:54:57,611 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:54:57,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 17:54:57,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-14 17:54:57,811 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-14 17:54:57,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:54:57,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1369425406, now seen corresponding path program 1 times [2024-10-14 17:54:57,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:54:57,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264940287] [2024-10-14 17:54:57,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:54:57,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:54:57,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:54:58,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:54:58,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:54:58,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264940287] [2024-10-14 17:54:58,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264940287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:54:58,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:54:58,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 17:54:58,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387662103] [2024-10-14 17:54:58,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:54:58,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:54:58,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:54:58,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:54:58,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:54:58,008 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:58,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:54:58,172 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2024-10-14 17:54:58,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 17:54:58,173 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-14 17:54:58,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:54:58,173 INFO L225 Difference]: With dead ends: 93 [2024-10-14 17:54:58,173 INFO L226 Difference]: Without dead ends: 93 [2024-10-14 17:54:58,173 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-14 17:54:58,174 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 30 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:54:58,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 131 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:54:58,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-14 17:54:58,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 73. [2024-10-14 17:54:58,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 72 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2024-10-14 17:54:58,177 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 17 [2024-10-14 17:54:58,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:54:58,177 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2024-10-14 17:54:58,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:58,177 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2024-10-14 17:54:58,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 17:54:58,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:54:58,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:54:58,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 17:54:58,179 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-14 17:54:58,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:54:58,180 INFO L85 PathProgramCache]: Analyzing trace with hash -497485271, now seen corresponding path program 1 times [2024-10-14 17:54:58,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:54:58,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466654055] [2024-10-14 17:54:58,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:54:58,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:54:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:54:58,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:54:58,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:54:58,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466654055] [2024-10-14 17:54:58,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466654055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:54:58,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:54:58,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 17:54:58,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578007997] [2024-10-14 17:54:58,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:54:58,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:54:58,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:54:58,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:54:58,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:54:58,372 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:58,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:54:58,554 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2024-10-14 17:54:58,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 17:54:58,554 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2024-10-14 17:54:58,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:54:58,554 INFO L225 Difference]: With dead ends: 84 [2024-10-14 17:54:58,554 INFO L226 Difference]: Without dead ends: 84 [2024-10-14 17:54:58,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-14 17:54:58,555 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 18 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:54:58,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 133 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:54:58,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-14 17:54:58,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 74. [2024-10-14 17:54:58,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 73 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:58,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2024-10-14 17:54:58,557 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 18 [2024-10-14 17:54:58,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:54:58,557 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2024-10-14 17:54:58,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:58,557 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2024-10-14 17:54:58,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 17:54:58,561 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:54:58,561 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:54:58,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 17:54:58,561 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-14 17:54:58,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:54:58,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1757825889, now seen corresponding path program 1 times [2024-10-14 17:54:58,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:54:58,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674696814] [2024-10-14 17:54:58,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:54:58,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:54:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:54:58,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:54:58,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:54:58,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674696814] [2024-10-14 17:54:58,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674696814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:54:58,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:54:58,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:54:58,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260965128] [2024-10-14 17:54:58,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:54:58,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:54:58,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:54:58,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:54:58,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:54:58,670 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:58,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:54:58,761 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2024-10-14 17:54:58,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:54:58,762 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-14 17:54:58,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:54:58,762 INFO L225 Difference]: With dead ends: 73 [2024-10-14 17:54:58,762 INFO L226 Difference]: Without dead ends: 73 [2024-10-14 17:54:58,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 17:54:58,763 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 38 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 40 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 [2024-10-14 17:54:58,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 40 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:54:58,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-14 17:54:58,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-10-14 17:54:58,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 72 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2024-10-14 17:54:58,765 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 19 [2024-10-14 17:54:58,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:54:58,765 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2024-10-14 17:54:58,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:58,765 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2024-10-14 17:54:58,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 17:54:58,767 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:54:58,767 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:54:58,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 17:54:58,768 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-14 17:54:58,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:54:58,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1757825890, now seen corresponding path program 1 times [2024-10-14 17:54:58,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:54:58,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445603907] [2024-10-14 17:54:58,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:54:58,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:54:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:54:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:54:58,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:54:58,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445603907] [2024-10-14 17:54:58,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445603907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:54:58,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:54:58,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:54:58,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584282771] [2024-10-14 17:54:58,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:54:58,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:54:58,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:54:58,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:54:58,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:54:58,810 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:58,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:54:58,841 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2024-10-14 17:54:58,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:54:58,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-14 17:54:58,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:54:58,841 INFO L225 Difference]: With dead ends: 67 [2024-10-14 17:54:58,842 INFO L226 Difference]: Without dead ends: 67 [2024-10-14 17:54:58,842 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:54:58,842 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 38 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:54:58,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 28 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:54:58,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-14 17:54:58,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-14 17:54:58,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.320754716981132) internal successors, (70), 66 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:58,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2024-10-14 17:54:58,844 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 19 [2024-10-14 17:54:58,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:54:58,844 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2024-10-14 17:54:58,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:58,844 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2024-10-14 17:54:58,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 17:54:58,844 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:54:58,844 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:54:58,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 17:54:58,844 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-14 17:54:58,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:54:58,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1341972243, now seen corresponding path program 1 times [2024-10-14 17:54:58,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:54:58,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556165260] [2024-10-14 17:54:58,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:54:58,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:54:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:54:58,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:54:58,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:54:58,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556165260] [2024-10-14 17:54:58,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556165260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:54:58,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:54:58,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:54:58,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931062444] [2024-10-14 17:54:58,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:54:58,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:54:58,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:54:58,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:54:58,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:54:58,908 INFO L87 Difference]: Start difference. First operand 67 states and 70 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) [2024-10-14 17:54:58,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:54:58,953 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2024-10-14 17:54:58,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:54:58,954 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 [2024-10-14 17:54:58,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:54:58,954 INFO L225 Difference]: With dead ends: 66 [2024-10-14 17:54:58,954 INFO L226 Difference]: Without dead ends: 66 [2024-10-14 17:54:58,954 INFO L431 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 [2024-10-14 17:54:58,955 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 22 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:54:58,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 99 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:54:58,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-14 17:54:58,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-10-14 17:54:58,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:58,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2024-10-14 17:54:58,956 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 20 [2024-10-14 17:54:58,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:54:58,956 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2024-10-14 17:54:58,957 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) [2024-10-14 17:54:58,957 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2024-10-14 17:54:58,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 17:54:58,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:54:58,957 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:54:58,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 17:54:58,957 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-14 17:54:58,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:54:58,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1348533537, now seen corresponding path program 1 times [2024-10-14 17:54:58,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:54:58,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139218313] [2024-10-14 17:54:58,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:54:58,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:54:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:54:59,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:54:59,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:54:59,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139218313] [2024-10-14 17:54:59,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139218313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:54:59,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:54:59,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:54:59,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059990324] [2024-10-14 17:54:59,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:54:59,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:54:59,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:54:59,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:54:59,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:54:59,074 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:59,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:54:59,194 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2024-10-14 17:54:59,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:54:59,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-14 17:54:59,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:54:59,195 INFO L225 Difference]: With dead ends: 65 [2024-10-14 17:54:59,195 INFO L226 Difference]: Without dead ends: 65 [2024-10-14 17:54:59,196 INFO L431 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 [2024-10-14 17:54:59,196 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 22 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:54:59,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 76 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:54:59,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-14 17:54:59,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-10-14 17:54:59,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 64 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:59,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2024-10-14 17:54:59,198 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 21 [2024-10-14 17:54:59,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:54:59,198 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2024-10-14 17:54:59,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:54:59,198 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2024-10-14 17:54:59,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-14 17:54:59,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:54:59,198 INFO L215 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] [2024-10-14 17:54:59,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 17:54:59,198 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-14 17:54:59,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:54:59,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1145133201, now seen corresponding path program 1 times [2024-10-14 17:54:59,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:54:59,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147256196] [2024-10-14 17:54:59,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:54:59,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:54:59,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:54:59,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:54:59,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:54:59,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147256196] [2024-10-14 17:54:59,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147256196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:54:59,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:54:59,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 17:54:59,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666204469] [2024-10-14 17:54:59,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:54:59,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 17:54:59,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:54:59,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 17:54:59,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-14 17:54:59,628 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:00,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:55:00,022 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2024-10-14 17:55:00,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 17:55:00,023 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2024-10-14 17:55:00,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:55:00,023 INFO L225 Difference]: With dead ends: 81 [2024-10-14 17:55:00,023 INFO L226 Difference]: Without dead ends: 81 [2024-10-14 17:55:00,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-14 17:55:00,025 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 63 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:55:00,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 114 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:55:00,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-14 17:55:00,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2024-10-14 17:55:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 57 states have (on average 1.263157894736842) internal successors, (72), 68 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:00,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 72 transitions. [2024-10-14 17:55:00,030 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 72 transitions. Word has length 22 [2024-10-14 17:55:00,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:55:00,030 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 72 transitions. [2024-10-14 17:55:00,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:00,031 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 72 transitions. [2024-10-14 17:55:00,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 17:55:00,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:55:00,031 INFO L215 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] [2024-10-14 17:55:00,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 17:55:00,031 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-14 17:55:00,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:55:00,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1139390748, now seen corresponding path program 1 times [2024-10-14 17:55:00,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:55:00,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329313119] [2024-10-14 17:55:00,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:00,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:55:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:00,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:00,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:55:00,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329313119] [2024-10-14 17:55:00,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329313119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:55:00,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:55:00,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:55:00,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688120874] [2024-10-14 17:55:00,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:55:00,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:55:00,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:55:00,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:55:00,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:55:00,133 INFO L87 Difference]: Start difference. First operand 69 states and 72 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:00,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:55:00,223 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2024-10-14 17:55:00,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:55:00,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-14 17:55:00,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:55:00,223 INFO L225 Difference]: With dead ends: 68 [2024-10-14 17:55:00,224 INFO L226 Difference]: Without dead ends: 68 [2024-10-14 17:55:00,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-14 17:55:00,227 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 57 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:55:00,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 57 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:55:00,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-14 17:55:00,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-14 17:55:00,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:00,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2024-10-14 17:55:00,230 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 23 [2024-10-14 17:55:00,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:55:00,230 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2024-10-14 17:55:00,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:55:00,230 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2024-10-14 17:55:00,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 17:55:00,230 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:55:00,230 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:55:00,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 17:55:00,231 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 45 more)] === [2024-10-14 17:55:00,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:55:00,231 INFO L85 PathProgramCache]: Analyzing trace with hash 908043475, now seen corresponding path program 1 times [2024-10-14 17:55:00,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:55:00,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488045443] [2024-10-14 17:55:00,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:00,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:55:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:00,790 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 17:55:00,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:55:00,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488045443] [2024-10-14 17:55:00,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488045443] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:55:00,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517245832] [2024-10-14 17:55:00,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:55:00,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:55:00,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:55:00,792 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:55:00,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 17:55:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:55:00,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-10-14 17:55:00,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:55:00,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 17:55:01,001 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 [2024-10-14 17:55:01,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 17:55:01,041 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-14 17:55:01,042 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 [2024-10-14 17:55:01,142 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 [2024-10-14 17:55:01,151 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 26 [2024-10-14 17:55:01,259 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 19 treesize of output 11 [2024-10-14 17:55:01,385 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:55:01,389 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 17:55:01,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2024-10-14 17:55:01,458 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:55:01,459 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 64 treesize of output 37 [2024-10-14 17:55:01,463 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:55:01,463 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 55 treesize of output 39 [2024-10-14 17:55:01,620 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:55:01,620 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 38 treesize of output 22 [2024-10-14 17:55:01,623 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:55:01,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:55:01,625 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 15 treesize of output 10 [2024-10-14 17:55:01,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:55:01,664 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:55:02,087 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-10-14 17:55:02,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 182 treesize of output 180 [2024-10-14 17:55:02,132 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-10-14 17:55:02,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 286 treesize of output 272 [2024-10-14 17:55:02,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:55:02,150 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 196 treesize of output 194 [2024-10-14 17:55:02,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:55:02,167 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 190 treesize of output 188 [2024-10-14 17:55:02,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-14 17:55:02,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-14 17:55:02,248 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:55:02,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 306 treesize of output 320 [2024-10-14 17:55:02,896 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:55:02,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1817 treesize of output 1789 [2024-10-14 17:55:12,243 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse133 (< |c_ULTIMATE.start_main_~#list~0#1.offset| (+ 2 |c_ULTIMATE.start_append_~plist#1.offset|))) (.cse219 (< |c_ULTIMATE.start_append_~plist#1.offset| 1)) (.cse1 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 1)) (.cse2 (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_append_~plist#1.base|))) (let ((.cse48 (< |c_ULTIMATE.start_append_~plist#1.offset| 0)) (.cse73 (< |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|)) (.cse74 (not .cse2)) (.cse292 (or .cse219 .cse1)) (.cse293 (or .cse1 .cse133)) (.cse4 (+ 4 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse7 (or (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_13 Int)) (let ((.cse318 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (let ((.cse314 (store .cse318 0 v_arrayElimCell_41))) (let ((.cse316 (+ 4 v_arrayElimCell_52)) (.cse315 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse314) v_prenex_13) (+ 4 v_arrayElimCell_41)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (store .cse314 4 .cse315) .cse316) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse317 (store .cse318 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse317 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse317) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13) .cse316) 0) (= .cse315 0)))))) .cse1)) (.cse8 (or (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_13 Int)) (let ((.cse311 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse312 (+ 4 v_arrayElimCell_52))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (let ((.cse310 (store .cse311 0 v_arrayElimCell_41))) (store .cse310 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse310) v_prenex_13) (+ 4 v_arrayElimCell_41)))) .cse312) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse313 (store .cse311 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse313 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse313) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13) .cse312) 0)))) .cse1)) (.cse30 (or .cse1 (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_14 Int) (v_prenex_21 Int)) (let ((.cse307 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse308 (+ 4 v_arrayElimCell_52))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse306 (store .cse307 0 v_arrayElimCell_41))) (store .cse306 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse306) v_prenex_21) (+ 4 v_arrayElimCell_41))))) v_prenex_14) .cse308) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse309 (store .cse307 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse309 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse309) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_14) .cse308) 0)))))) (.cse89 (or (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse303 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse304 (+ 4 v_arrayElimCell_52))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse302 (store .cse303 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse302 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse302) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_arrayElimCell_50) .cse304) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse305 (store .cse303 0 v_arrayElimCell_41))) (store .cse305 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse305) v_arrayElimCell_50) (+ 4 v_arrayElimCell_41))))) v_arrayElimCell_50) .cse304) 0)))) .cse1)) (.cse115 (or .cse1 (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_13 Int)) (let ((.cse298 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (let ((.cse299 (+ 4 v_arrayElimCell_52)) (.cse297 (+ 4 v_arrayElimCell_41)) (.cse300 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse301 (store .cse298 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse301 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse301) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (let ((.cse296 (store .cse298 0 v_arrayElimCell_41))) (store .cse296 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse296) v_prenex_13) .cse297))) .cse299) 0) (= (select .cse300 .cse299) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_13) .cse297) 0) (= (select .cse300 4) 0))))))) (.cse132 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_42 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse295 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse295 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse295) v_arrayElimCell_42) .cse4)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) 0)))) (.cse75 (and (or .cse1 .cse2) .cse292 .cse293)) (.cse231 (or (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse294 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse294 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse294) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_12) .cse4) 0))) .cse48 .cse73 .cse74)) (.cse78 (and .cse292 .cse293)) (.cse6 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) (.cse120 (= |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|))) (and (or (let ((.cse5 (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (= (let ((.cse119 (+ 4 v_arrayElimCell_52))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse118 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52))) (store .cse118 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse118) |c_ULTIMATE.start_append_~item~0#1.base|) .cse119)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse119)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0))))) (.cse0 (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_42 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (let ((.cse117 (+ 4 v_arrayElimCell_52))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse116 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52))) (store .cse116 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse116) v_arrayElimCell_42) .cse117)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse117)) 0))))) (and (or .cse0 .cse1 .cse2) (or .cse1 (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_14 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse3 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse3 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse3) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_14) (+ 4 v_arrayElimCell_52)) 0)))) (or .cse5 .cse6) .cse7 .cse8 (or (forall ((v_arrayElimCell_52 Int) (v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse12 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52)) (.cse11 (+ 4 v_arrayElimCell_52))) (let ((.cse9 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse12) v_prenex_18) .cse11))) (let ((.cse10 (store .cse12 4 .cse9))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse9 0) (= (select .cse10 .cse11) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse10) v_prenex_18) 4) 0)))))) .cse6) (or (and (or (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse16 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52)) (.cse14 (+ 4 v_arrayElimCell_52))) (let ((.cse15 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse16) v_prenex_24) .cse14))) (let ((.cse13 (store .cse16 4 .cse15))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse13 .cse14) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse13) v_prenex_24) 4) 0) (= .cse15 0)))))) .cse6) (or (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_25 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52)) v_prenex_25) (+ 4 v_arrayElimCell_52)) 0))) .cse6) (or .cse1 (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse18 (+ 4 v_arrayElimCell_52))) (let ((.cse17 (let ((.cse19 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52))) (store .cse19 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse19) v_prenex_24) .cse18))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse17 .cse18) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse17) v_prenex_24) .cse18) 0)))))) (or (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse20 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52))) (let ((.cse21 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse20) v_prenex_24) (+ 4 v_arrayElimCell_52)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse20 4 .cse21)) v_prenex_24) 4) 0) (= .cse21 0))))) .cse6) (or .cse1 (forall ((v_prenex_26 Int) (v_arrayElimCell_52 Int) (v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (= (let ((.cse23 (+ 4 v_arrayElimCell_52))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse22 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52))) (store .cse22 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse22) v_prenex_26) .cse23)))) v_prenex_22) .cse23)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0))))) (or (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse25 (+ 4 v_arrayElimCell_52))) (let ((.cse24 (let ((.cse27 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52))) (store .cse27 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse27) v_prenex_24) .cse25))))) (let ((.cse26 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse24) v_prenex_24))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse24 .cse25) 0) (= (select .cse26 4) 0) (= (select .cse26 .cse25) 0)))))) .cse6) (or (forall ((v_arrayElimCell_52 Int) (v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (let ((.cse29 (+ 4 v_arrayElimCell_52))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse28 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52))) (store .cse28 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse28) v_prenex_23) .cse29)))) v_prenex_23) .cse29)) 0))) .cse1)) .cse2) .cse30 (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_23 Int)) (= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse31 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse31 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse31) v_prenex_23) (+ 4 v_arrayElimCell_41))))) v_prenex_23) (+ 4 v_arrayElimCell_52)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_24 Int)) (let ((.cse32 (let ((.cse34 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse34 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse34) v_prenex_24) (+ 4 v_arrayElimCell_41))))) (.cse33 (+ 4 v_arrayElimCell_52))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse32) v_prenex_24) .cse33) 0) (= (select .cse32 .cse33) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_24 Int)) (let ((.cse39 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse37 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse39) v_prenex_24) (+ 4 v_arrayElimCell_41)))) (let ((.cse38 (store .cse39 4 .cse37))) (let ((.cse36 (+ 4 v_arrayElimCell_52)) (.cse35 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse38) v_prenex_24))) (or (= (select .cse35 .cse36) 0) (= .cse37 0) (= (select .cse38 .cse36) 0) (= (select .cse35 4) 0))))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_24 Int)) (let ((.cse43 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse42 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse43) v_prenex_24) (+ 4 v_arrayElimCell_41)))) (let ((.cse40 (store .cse43 4 .cse42)) (.cse41 (+ 4 v_arrayElimCell_52))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse40) v_prenex_24) .cse41) 0) (= .cse42 0) (= (select .cse40 .cse41) 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_26 Int) (v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_22 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse44 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse44 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse44) v_prenex_26) (+ 4 v_arrayElimCell_41))))) v_prenex_22) (+ 4 v_arrayElimCell_52)) 0))))) .cse1 .cse2) (or (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse45 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse45 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse45) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_52)) 0))) .cse6) (or (forall ((v_arrayElimCell_52 Int) (v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse47 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52))) (let ((.cse46 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse47) v_prenex_18) (+ 4 v_arrayElimCell_52)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse46 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse47 4 .cse46)) v_prenex_18) 4) 0))))) .cse6) (or .cse48 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_13 Int)) (let ((.cse50 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse51 (+ 4 v_arrayElimCell_52))) (or (= (select (let ((.cse49 (store .cse50 0 v_arrayElimCell_41))) (store .cse49 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse49) v_prenex_13) (+ 4 v_arrayElimCell_41)))) .cse51) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse52 (store .cse50 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse52 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse52) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13) .cse51) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (forall ((v_arrayElimCell_52 Int) (v_prenex_12 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse53 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse53 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse53) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_12) (+ 4 v_arrayElimCell_52)) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int)) (let ((.cse55 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse56 (+ 4 v_arrayElimCell_52))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse54 (store .cse55 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse54 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse54) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_arrayElimCell_50) .cse56) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse57 (store .cse55 0 v_arrayElimCell_41))) (store .cse57 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse57) v_arrayElimCell_50) (+ 4 v_arrayElimCell_41))))) v_arrayElimCell_50) .cse56) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_14 Int) (v_prenex_21 Int)) (let ((.cse59 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse60 (+ 4 v_arrayElimCell_52))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse58 (store .cse59 0 v_arrayElimCell_41))) (store .cse58 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse58) v_prenex_21) (+ 4 v_arrayElimCell_41))))) v_prenex_14) .cse60) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse61 (store .cse59 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse61 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse61) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_14) .cse60) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_13 Int)) (let ((.cse66 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (let ((.cse62 (store .cse66 0 v_arrayElimCell_41))) (let ((.cse64 (+ 4 v_arrayElimCell_52)) (.cse63 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse62) v_prenex_13) (+ 4 v_arrayElimCell_41)))) (or (= (select (store .cse62 4 .cse63) .cse64) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse65 (store .cse66 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse65 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse65) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13) .cse64) 0) (= .cse63 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_13 Int)) (let ((.cse69 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (let ((.cse70 (+ 4 v_arrayElimCell_52)) (.cse68 (+ 4 v_arrayElimCell_41)) (.cse71 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse72 (store .cse69 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse72 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse72) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13))) (or (= (select (let ((.cse67 (store .cse69 0 v_arrayElimCell_41))) (store .cse67 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse67) v_prenex_13) .cse68))) .cse70) 0) (= (select .cse71 .cse70) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_13) .cse68) 0) (= (select .cse71 4) 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0))))) .cse73 .cse74) (or .cse75 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_arrayElimCell_42 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse76 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse76 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse76) v_arrayElimCell_42) (+ 4 v_arrayElimCell_41))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_52)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse77 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse77 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse77) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_41))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_52)) 0)))))) (or .cse78 (forall ((v_arrayElimCell_52 Int) (v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse80 (+ 4 v_arrayElimCell_52))) (let ((.cse79 (let ((.cse81 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52))) (store .cse81 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse81) v_prenex_18) .cse80))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse79 .cse80) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse79) v_prenex_18) .cse80) 0)))))) (or .cse78 (forall ((v_prenex_16 Int) (v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_20 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (let ((.cse83 (+ 4 v_arrayElimCell_52))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse82 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52))) (store .cse82 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse82) v_prenex_20) .cse83)))) v_prenex_16) .cse83)) 0)))) (or (forall ((v_arrayElimCell_52 Int) (v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52)) v_prenex_17) (+ 4 v_arrayElimCell_52)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)))) .cse6) (or (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_13 Int)) (let ((.cse86 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse85 (+ 4 v_arrayElimCell_52))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (let ((.cse84 (store .cse86 0 v_arrayElimCell_52))) (store .cse84 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse84) v_prenex_13) .cse85))) .cse85) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse87 (store .cse86 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse87 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse87) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13) .cse85) 0)))) .cse1) (or (forall ((v_arrayElimCell_52 Int) (v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse88 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse88 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse88) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_12) (+ 4 v_arrayElimCell_52)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)))) .cse48 .cse73 .cse74) .cse89 (or .cse78 (forall ((v_arrayElimCell_52 Int) (v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse91 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52)) (.cse92 (+ 4 v_arrayElimCell_52))) (let ((.cse90 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse91) v_prenex_18) .cse92))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse90 0) (= (select (store .cse91 4 .cse90) .cse92) 0)))))) (or .cse1 (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse93 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse93 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse93) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_arrayElimCell_50) (+ 4 v_arrayElimCell_52)) 0)))) (or .cse5 .cse6 .cse2) (or .cse78 (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_19 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (let ((.cse95 (+ 4 v_arrayElimCell_52))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse94 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_52))) (store .cse94 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse94) v_prenex_19) .cse95)))) v_prenex_19) .cse95)) 0)))) (or .cse78 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_16 Int) (v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_20 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse96 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse96 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse96) v_prenex_20) (+ 4 v_arrayElimCell_41))))) v_prenex_16) (+ 4 v_arrayElimCell_52)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_18 Int)) (let ((.cse100 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse99 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse100) v_prenex_18) (+ 4 v_arrayElimCell_41)))) (let ((.cse97 (store .cse100 4 .cse99)) (.cse98 (+ 4 v_arrayElimCell_52))) (or (= (select .cse97 .cse98) 0) (= .cse99 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse97) v_prenex_18) .cse98) 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_19 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse101 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse101 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse101) v_prenex_19) (+ 4 v_arrayElimCell_41))))) v_prenex_19) (+ 4 v_arrayElimCell_52)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_18 Int)) (let ((.cse106 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse104 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse106) v_prenex_18) (+ 4 v_arrayElimCell_41)))) (let ((.cse102 (store .cse106 4 .cse104))) (let ((.cse103 (+ 4 v_arrayElimCell_52)) (.cse105 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse102) v_prenex_18))) (or (= (select .cse102 .cse103) 0) (= .cse104 0) (= (select .cse105 .cse103) 0) (= (select .cse105 4) 0))))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_52 Int) (v_arrayElimCell_41 Int) (v_prenex_18 Int)) (let ((.cse107 (let ((.cse109 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse109 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse109) v_prenex_18) (+ 4 v_arrayElimCell_41))))) (.cse108 (+ 4 v_arrayElimCell_52))) (or (= (select .cse107 .cse108) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse107) v_prenex_18) .cse108) 0)))))))) (or (forall ((v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_13 Int)) (let ((.cse112 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (let ((.cse111 (+ 4 v_arrayElimCell_52)) (.cse113 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse114 (store .cse112 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse114 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse114) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (let ((.cse110 (store .cse112 0 v_arrayElimCell_52))) (store .cse110 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse110) v_prenex_13) .cse111))) .cse111) 0) (= (select .cse113 .cse111) 0) (= (select .cse113 4) 0))))) .cse1) (or .cse0 .cse78) .cse115)) .cse120) (or .cse1 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_26 Int) (v_arrayElimCell_41 Int) (v_prenex_22 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse121 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse121 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse121) v_prenex_26) (+ 4 v_arrayElimCell_41))))) v_prenex_22) .cse4) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_23 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse122 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse122 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse122) v_prenex_23) (+ 4 v_arrayElimCell_41))))) v_prenex_23) .cse4) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_24 Int)) (let ((.cse123 (let ((.cse124 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse124 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse124) v_prenex_24) (+ 4 v_arrayElimCell_41)))))) (or (= (select .cse123 .cse4) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse123) v_prenex_24) .cse4) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_24 Int)) (let ((.cse127 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse126 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse127) v_prenex_24) (+ 4 v_arrayElimCell_41)))) (let ((.cse125 (store .cse127 4 .cse126))) (or (= (select .cse125 .cse4) 0) (= .cse126 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse125) v_prenex_24) .cse4) 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_24 Int)) (let ((.cse131 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse129 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse131) v_prenex_24) (+ 4 v_arrayElimCell_41)))) (let ((.cse128 (store .cse131 4 .cse129))) (let ((.cse130 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse128) v_prenex_24))) (or (= (select .cse128 .cse4) 0) (= .cse129 0) (= (select .cse130 4) 0) (= (select .cse130 .cse4) 0)))))))))) .cse2) (or .cse1 .cse132 .cse133) (or (and (or (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (= (let ((.cse135 (+ 4 v_arrayElimCell_41))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse134 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse134 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse134) |c_ULTIMATE.start_append_~item~0#1.base|) .cse135)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse135)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)))) .cse6) (or (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_25 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41)) v_prenex_25) (+ 4 v_arrayElimCell_41)) 0))) .cse6) (or .cse1 (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse136 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse136 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse136) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_41))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_52)) 0)))) (or (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse140 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41)) (.cse139 (+ 4 v_arrayElimCell_41))) (let ((.cse137 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse140) v_prenex_24) .cse139))) (let ((.cse138 (store .cse140 4 .cse137))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse137 0) (= (select .cse138 .cse139) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse138) v_prenex_24) 4) 0)))))) .cse6) (or .cse1 (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse141 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse141 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse141) v_prenex_23) (+ 4 v_arrayElimCell_41))))) v_prenex_23) (+ 4 v_arrayElimCell_52)))))) (or (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse145 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse144 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse145) v_prenex_24) (+ 4 v_arrayElimCell_41)))) (let ((.cse142 (store .cse145 4 .cse144)) (.cse143 (+ 4 v_arrayElimCell_52))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse142) v_prenex_24) .cse143) 0) (= .cse144 0) (= (select .cse142 .cse143) 0)))))) .cse1) (or (forall ((v_prenex_26 Int) (v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse146 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse146 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse146) v_prenex_26) (+ 4 v_arrayElimCell_41))))) v_prenex_22) (+ 4 v_arrayElimCell_52)) 0))) .cse1) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (let ((.cse148 (+ 4 v_arrayElimCell_41))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse147 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse147 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse147) v_prenex_23) .cse148)))) v_prenex_23) .cse148)) 0))) .cse1) (or .cse6 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse150 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse149 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse150) v_prenex_24) (+ 4 v_arrayElimCell_41)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse149 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse150 4 .cse149)) v_prenex_24) 4) 0)))))) (or .cse1 (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse155 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse153 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse155) v_prenex_24) (+ 4 v_arrayElimCell_41)))) (let ((.cse154 (store .cse155 4 .cse153))) (let ((.cse152 (+ 4 v_arrayElimCell_52)) (.cse151 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse154) v_prenex_24))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse151 .cse152) 0) (= .cse153 0) (= (select .cse154 .cse152) 0) (= (select .cse151 4) 0)))))))) (or .cse1 (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_42 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse156 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse156 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse156) v_arrayElimCell_42) (+ 4 v_arrayElimCell_41))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_52)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0))))) (or (forall ((v_prenex_26 Int) (v_arrayElimCell_41 Int) (v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (let ((.cse158 (+ 4 v_arrayElimCell_41))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse157 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse157 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse157) v_prenex_26) .cse158)))) v_prenex_22) .cse158)) 0))) .cse1) (or .cse120 (and .cse7 (or .cse78 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (v_prenex_18 Int)) (let ((.cse159 (let ((.cse161 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse161 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse161) v_prenex_18) (+ 4 v_arrayElimCell_41))))) (.cse160 (+ 4 v_arrayElimCell_52))) (or (= (select .cse159 .cse160) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse159) v_prenex_18) .cse160) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (v_prenex_19 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse162 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse162 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse162) v_prenex_19) (+ 4 v_arrayElimCell_41))))) v_prenex_19) (+ 4 v_arrayElimCell_52)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (v_prenex_18 Int)) (let ((.cse166 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse165 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse166) v_prenex_18) (+ 4 v_arrayElimCell_41)))) (let ((.cse163 (store .cse166 4 .cse165)) (.cse164 (+ 4 v_arrayElimCell_52))) (or (= (select .cse163 .cse164) 0) (= .cse165 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse163) v_prenex_18) .cse164) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (v_prenex_18 Int)) (let ((.cse171 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse169 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse171) v_prenex_18) (+ 4 v_arrayElimCell_41)))) (let ((.cse167 (store .cse171 4 .cse169))) (let ((.cse168 (+ 4 v_arrayElimCell_52)) (.cse170 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse167) v_prenex_18))) (or (= (select .cse167 .cse168) 0) (= .cse169 0) (= (select .cse170 .cse168) 0) (= (select .cse170 4) 0))))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_16 Int) (v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (v_prenex_20 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse172 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse172 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse172) v_prenex_20) (+ 4 v_arrayElimCell_41))))) v_prenex_16) (+ 4 v_arrayElimCell_52)) 0)))))) .cse8 .cse30 .cse89 .cse115)) (or .cse1 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse174 (+ 4 v_arrayElimCell_41))) (let ((.cse173 (let ((.cse175 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse175 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse175) v_prenex_24) .cse174))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse173 .cse174) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse173) v_prenex_24) .cse174) 0)))))) (or .cse1 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse177 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41)) (.cse178 (+ 4 v_arrayElimCell_41))) (let ((.cse176 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse177) v_prenex_24) .cse178))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse176 0) (= (select (store .cse177 4 .cse176) .cse178) 0)))))) (or .cse120 (and (or (forall ((v_arrayElimCell_41 Int) (v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41)) v_prenex_17) (+ 4 v_arrayElimCell_41)) 0))) .cse6) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_13 Int)) (let ((.cse180 (+ 4 v_arrayElimCell_41)) (.cse181 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (or (= (select (let ((.cse179 (store .cse181 0 v_arrayElimCell_41))) (store .cse179 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse179) v_prenex_13) .cse180))) .cse180) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_13) .cse180) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse182 (store .cse181 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse182 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse182) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13) 4) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_41 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse183 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse183 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse183) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_arrayElimCell_50) (+ 4 v_arrayElimCell_41)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_14 Int)) (= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse184 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse184 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse184) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_14) (+ 4 v_arrayElimCell_41)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_13 Int)) (let ((.cse187 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse186 (+ 4 v_arrayElimCell_41))) (or (= (select (let ((.cse185 (store .cse187 0 v_arrayElimCell_41))) (store .cse185 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse185) v_prenex_13) .cse186))) .cse186) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse188 (store .cse187 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse188 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse188) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13) .cse186) 0))))))) .cse1) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse190 (+ 4 v_arrayElimCell_41))) (let ((.cse189 (let ((.cse191 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse191 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse191) v_prenex_18) .cse190))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse189) v_prenex_18) .cse190) 0) (= (select .cse189 .cse190) 0))))) .cse78) (or .cse78 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_19 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (let ((.cse193 (+ 4 v_arrayElimCell_41))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse192 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse192 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse192) v_prenex_19) .cse193)))) v_prenex_19) .cse193)) 0)))) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse195 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse194 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse195) v_prenex_18) (+ 4 v_arrayElimCell_41)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse194 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse195 4 .cse194)) v_prenex_18) 4) 0))))) .cse6) (or .cse78 (forall ((v_prenex_16 Int) (v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_20 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (let ((.cse197 (+ 4 v_arrayElimCell_41))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse196 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse196 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse196) v_prenex_20) .cse197)))) v_prenex_16) .cse197)) 0)))) (or .cse6 (forall ((v_arrayElimCell_41 Int) (v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse199 (+ 4 v_arrayElimCell_41))) (let ((.cse200 (let ((.cse201 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse201 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse201) v_prenex_18) .cse199))))) (let ((.cse198 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse200) v_prenex_18))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse198 .cse199) 0) (= (select .cse200 .cse199) 0) (= (select .cse198 4) 0))))))))) (or (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_52 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse202 (let ((.cse204 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse204 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse204) v_prenex_24) (+ 4 v_arrayElimCell_41))))) (.cse203 (+ 4 v_arrayElimCell_52))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse202) v_prenex_24) .cse203) 0) (= (select .cse202 .cse203) 0)))) .cse1) (or .cse1 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_42 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (let ((.cse206 (+ 4 v_arrayElimCell_41))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse205 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse205 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse205) v_arrayElimCell_42) .cse206)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse206)) 0))))) .cse2) (or (and (or (forall ((v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse207 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse207 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse207) v_prenex_23) .cse4)))) v_prenex_23) .cse4) 0))) .cse1) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse208 (let ((.cse209 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse209 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse209) v_prenex_24) .cse4))))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse208) v_prenex_24) .cse4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse208 .cse4) 0)))) .cse1) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse212 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse211 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse212) v_prenex_24) .cse4))) (let ((.cse210 (store .cse212 4 .cse211))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse210) v_prenex_24) 4) 0) (= (select .cse210 .cse4) 0) (= .cse211 0)))))) .cse6) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_25 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|)) v_prenex_25) .cse4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)))) .cse6) (or .cse1 (forall ((v_prenex_26 Int) (v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse213 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse213 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse213) v_prenex_26) .cse4)))) v_prenex_22) .cse4) 0)))) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse215 (let ((.cse216 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse216 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse216) v_prenex_24) .cse4))))) (let ((.cse214 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse215) v_prenex_24))) (or (= (select .cse214 .cse4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse214 4) 0) (= (select .cse215 .cse4) 0))))) .cse6) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int)) (let ((.cse217 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse218 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse217) v_prenex_24) .cse4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse217 4 .cse218)) v_prenex_24) 4) 0) (= .cse218 0))))) .cse6)) .cse2) (or .cse219 .cse1 .cse132) (or (and (or (forall ((v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse220 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse221 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse220) v_prenex_18) .cse4))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse220 4 .cse221)) v_prenex_18) 4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse221 0))))) .cse6) (or .cse1 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_13 Int)) (let ((.cse222 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse223 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse222))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse222 4 (select (select .cse223 |c_ULTIMATE.start_append_~item~0#1.base|) .cse4))) v_prenex_13) .cse4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (store .cse222 4 (select (select .cse223 v_prenex_13) .cse4)) .cse4) 0)))))) (or (forall ((v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse224 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse225 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse224) v_prenex_18) .cse4))) (or (= 0 (select (store .cse224 4 .cse225) .cse4)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse225 0))))) .cse78) (or .cse1 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_13 Int)) (let ((.cse227 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse228 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse227))) (let ((.cse226 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse227 4 (select (select .cse228 |c_ULTIMATE.start_append_~item~0#1.base|) .cse4))) v_prenex_13))) (or (= (select .cse226 .cse4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (store .cse227 4 (select (select .cse228 v_prenex_13) .cse4)) .cse4) 0) (= (select .cse226 4) 0))))))) (or (forall ((v_arrayElimCell_50 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse229 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse229 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse229) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_arrayElimCell_50) .cse4) 0))) .cse1) (or .cse78 (forall ((v_prenex_16 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_20 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse230 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse230 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse230) v_prenex_20) .cse4)))) v_prenex_16) .cse4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0))))) .cse231 (or .cse78 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_19 Int)) (or (= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse232 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse232 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse232) v_prenex_19) .cse4)))) v_prenex_19) .cse4)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0))))) (or (forall ((v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|)) v_prenex_17) .cse4) 0))) .cse6) (or .cse78 (forall ((v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse233 (let ((.cse234 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse234 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse234) v_prenex_18) .cse4))))) (or (= 0 (select .cse233 .cse4)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse233) v_prenex_18) .cse4) 0))))) (or .cse1 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_14 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse235 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse235 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse235) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_14) .cse4) 0)))) (or (forall ((v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse238 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse237 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse238) v_prenex_18) .cse4))) (let ((.cse236 (store .cse238 4 .cse237))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse236) v_prenex_18) 4) 0) (= 0 (select .cse236 .cse4)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse237 0)))))) .cse6)) .cse120) (or .cse1 .cse132 .cse2) (or .cse75 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse239 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse239 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse239) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_41))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_arrayElimCell_42 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse240 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse240 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse240) v_arrayElimCell_42) (+ 4 v_arrayElimCell_41))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) 0)))))) (or (and (or .cse1 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_14 Int) (v_prenex_21 Int)) (let ((.cse242 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse241 (store .cse242 0 v_arrayElimCell_41))) (store .cse241 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse241) v_prenex_21) (+ 4 v_arrayElimCell_41))))) v_prenex_14) .cse4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse243 (store .cse242 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse243 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse243) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_14) .cse4) 0))))) (or .cse1 (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse245 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse244 (store .cse245 0 v_arrayElimCell_41))) (store .cse244 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse244) v_arrayElimCell_50) (+ 4 v_arrayElimCell_41))))) v_arrayElimCell_50) .cse4) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse246 (store .cse245 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse246 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse246) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_arrayElimCell_50) .cse4) 0))))) (or .cse1 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_13 Int)) (let ((.cse248 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (let ((.cse249 (store .cse248 0 v_arrayElimCell_41))) (let ((.cse250 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse249) v_prenex_13) (+ 4 v_arrayElimCell_41)))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse247 (store .cse248 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse247 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse247) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13) .cse4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (store .cse249 4 .cse250) .cse4) 0) (= .cse250 0))))))) (or .cse1 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_13 Int)) (let ((.cse252 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse251 (store .cse252 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse251 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse251) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13) .cse4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (let ((.cse253 (store .cse252 0 v_arrayElimCell_41))) (store .cse253 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse253) v_prenex_13) (+ 4 v_arrayElimCell_41)))) .cse4) 0))))) .cse231 (or .cse78 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_18 Int)) (let ((.cse256 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse255 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse256) v_prenex_18) (+ 4 v_arrayElimCell_41)))) (let ((.cse254 (store .cse256 4 .cse255))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse254) v_prenex_18) .cse4) 0) (= (select .cse254 .cse4) 0) (= .cse255 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (forall ((v_arrayElimCell_41 Int) (v_prenex_19 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse257 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse257 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse257) v_prenex_19) (+ 4 v_arrayElimCell_41))))) v_prenex_19) .cse4) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_18 Int)) (let ((.cse258 (let ((.cse259 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse259 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse259) v_prenex_18) (+ 4 v_arrayElimCell_41)))))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse258) v_prenex_18) .cse4) 0) (= (select .cse258 .cse4) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (forall ((v_prenex_16 Int) (v_arrayElimCell_41 Int) (v_prenex_20 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse260 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (store .cse260 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse260) v_prenex_20) (+ 4 v_arrayElimCell_41))))) v_prenex_16) .cse4) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_18 Int)) (let ((.cse264 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_41))) (let ((.cse263 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse264) v_prenex_18) (+ 4 v_arrayElimCell_41)))) (let ((.cse262 (store .cse264 4 .cse263))) (let ((.cse261 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse262) v_prenex_18))) (or (= (select .cse261 .cse4) 0) (= (select .cse262 .cse4) 0) (= .cse263 0) (= (select .cse261 4) 0))))))))))) (or .cse1 (forall ((v_arrayElimCell_41 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_13 Int)) (let ((.cse268 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (let ((.cse267 (+ 4 v_arrayElimCell_41)) (.cse265 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse269 (store .cse268 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse269 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse269) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13))) (or (= (select .cse265 .cse4) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (let ((.cse266 (store .cse268 0 v_arrayElimCell_41))) (store .cse266 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse266) v_prenex_13) .cse267))) .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_13) .cse267) 0) (= (select .cse265 4) 0))))))) .cse120) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_42 Int)) (let ((.cse270 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (let ((.cse271 (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse270))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse270 4 (select (select .cse271 v_arrayElimCell_42) .cse4))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse270 4 (select (select .cse271 |c_ULTIMATE.start_append_~item~0#1.base|) .cse4))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) 0))))) .cse1) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse272 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse272 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse272) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4) 0))) .cse6) (or .cse48 .cse73 .cse120 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_50 Int) (v_arrayElimCell_41 Int)) (let ((.cse274 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse273 (store .cse274 0 v_arrayElimCell_41))) (store .cse273 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse273) v_arrayElimCell_50) (+ 4 v_arrayElimCell_41))))) v_arrayElimCell_50) .cse4) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse275 (store .cse274 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse275 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse275) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_arrayElimCell_50) .cse4) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_13 Int)) (let ((.cse279 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (let ((.cse278 (+ 4 v_arrayElimCell_41)) (.cse276 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse280 (store .cse279 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse280 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse280) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13))) (or (= (select .cse276 .cse4) 0) (= (select (let ((.cse277 (store .cse279 0 v_arrayElimCell_41))) (store .cse277 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse277) v_prenex_13) .cse278))) .cse4) 0) (= (select (select |c_#memory_$Pointer$#1.offset| v_prenex_13) .cse278) 0) (= (select .cse276 4) 0))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_13 Int)) (let ((.cse282 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse281 (store .cse282 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse281 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse281) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13) .cse4) 0) (= (select (let ((.cse283 (store .cse282 0 v_arrayElimCell_41))) (store .cse283 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse283) v_prenex_13) (+ 4 v_arrayElimCell_41)))) .cse4) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_12 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse284 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse284 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse284) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_12) .cse4) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_13 Int)) (let ((.cse286 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (let ((.cse287 (store .cse286 0 v_arrayElimCell_41))) (let ((.cse288 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse287) v_prenex_13) (+ 4 v_arrayElimCell_41)))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse285 (store .cse286 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse285 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse285) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_13) .cse4) 0) (= (select (store .cse287 4 .cse288) .cse4) 0) (= .cse288 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_41 Int) (v_prenex_14 Int) (v_prenex_21 Int)) (let ((.cse290 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse289 (store .cse290 0 v_arrayElimCell_41))) (store .cse289 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse289) v_prenex_21) (+ 4 v_arrayElimCell_41))))) v_prenex_14) .cse4) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse291 (store .cse290 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse291 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse291) |c_ULTIMATE.start_append_~item~0#1.base|) .cse4)))) v_prenex_14) .cse4) 0))))))) .cse74))))) is different from true