./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/list-ext-properties/test-0232_1-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 f7b1141c3157e34a4974729c197a93a4b99ad75fc020122df5d99d43bcc85e27 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:25:18,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:25:18,593 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 00:25:18,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:25:18,599 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:25:18,632 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:25:18,632 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:25:18,633 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:25:18,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:25:18,634 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:25:18,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:25:18,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:25:18,635 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:25:18,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:25:18,635 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:25:18,636 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:25:18,639 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:25:18,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:25:18,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:25:18,642 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:25:18,642 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:25:18,642 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:25:18,643 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 00:25:18,644 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:25:18,644 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:25:18,644 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:25:18,644 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:25:18,645 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:25:18,645 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:25:18,645 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:25:18,646 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:25:18,646 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:25:18,646 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:25:18,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:25:18,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:25:18,648 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:25:18,648 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:25:18,648 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:25:18,648 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:25:18,648 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:25:18,649 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:25:18,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:25:18,649 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 -> f7b1141c3157e34a4974729c197a93a4b99ad75fc020122df5d99d43bcc85e27 [2024-11-17 00:25:18,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:25:18,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:25:18,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:25:18,953 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:25:18,954 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:25:18,955 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2024-11-17 00:25:20,428 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:25:20,677 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:25:20,678 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0232_1-2.i [2024-11-17 00:25:20,692 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/305bb7058/7f33630b3601438ebbb3544bdf840e81/FLAG78ba5dc8f [2024-11-17 00:25:21,006 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/305bb7058/7f33630b3601438ebbb3544bdf840e81 [2024-11-17 00:25:21,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:25:21,010 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:25:21,011 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:25:21,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:25:21,018 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:25:21,019 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:25:21" (1/1) ... [2024-11-17 00:25:21,020 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cd35ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:21, skipping insertion in model container [2024-11-17 00:25:21,020 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:25:21" (1/1) ... [2024-11-17 00:25:21,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:25:21,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:25:21,435 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:25:21,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:25:21,510 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:25:21,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:21 WrapperNode [2024-11-17 00:25:21,511 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:25:21,512 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:25:21,512 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:25:21,512 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:25:21,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:21" (1/1) ... [2024-11-17 00:25:21,536 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:21" (1/1) ... [2024-11-17 00:25:21,560 INFO L138 Inliner]: procedures = 126, calls = 33, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 97 [2024-11-17 00:25:21,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:25:21,562 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:25:21,562 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:25:21,562 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:25:21,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:21" (1/1) ... [2024-11-17 00:25:21,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:21" (1/1) ... [2024-11-17 00:25:21,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:21" (1/1) ... [2024-11-17 00:25:21,598 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 10, 8]. 50 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 5 writes are split as follows [0, 3, 2]. [2024-11-17 00:25:21,599 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:21" (1/1) ... [2024-11-17 00:25:21,599 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:21" (1/1) ... [2024-11-17 00:25:21,608 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:21" (1/1) ... [2024-11-17 00:25:21,609 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:21" (1/1) ... [2024-11-17 00:25:21,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:21" (1/1) ... [2024-11-17 00:25:21,611 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:21" (1/1) ... [2024-11-17 00:25:21,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:25:21,616 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:25:21,616 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:25:21,616 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:25:21,617 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:21" (1/1) ... [2024-11-17 00:25:21,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:25:21,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:25:21,655 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-11-17 00:25:21,660 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-11-17 00:25:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:25:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:25:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 00:25:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:25:21,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:25:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 00:25:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:25:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:25:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 00:25:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:25:21,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-17 00:25:21,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-17 00:25:21,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-17 00:25:21,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 00:25:21,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 00:25:21,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 00:25:21,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:25:21,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:25:21,887 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:25:21,889 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:25:22,178 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L541: call ULTIMATE.dealloc(main_~#list~0#1.base, main_~#list~0#1.offset);havoc main_~#list~0#1.base, main_~#list~0#1.offset; [2024-11-17 00:25:22,202 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2024-11-17 00:25:22,203 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:25:22,225 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:25:22,225 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:25:22,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:25:22 BoogieIcfgContainer [2024-11-17 00:25:22,226 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:25:22,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:25:22,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:25:22,231 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:25:22,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:25:21" (1/3) ... [2024-11-17 00:25:22,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce64f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:25:22, skipping insertion in model container [2024-11-17 00:25:22,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:25:21" (2/3) ... [2024-11-17 00:25:22,232 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ce64f22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:25:22, skipping insertion in model container [2024-11-17 00:25:22,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:25:22" (3/3) ... [2024-11-17 00:25:22,233 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232_1-2.i [2024-11-17 00:25:22,246 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:25:22,247 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-11-17 00:25:22,288 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:25:22,294 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;@26e2c534, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:25:22,295 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-11-17 00:25:22,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 50 states have (on average 2.0) internal successors, (100), 94 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:22,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-17 00:25:22,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:22,304 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-17 00:25:22,304 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-17 00:25:22,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:22,310 INFO L85 PathProgramCache]: Analyzing trace with hash 4000863, now seen corresponding path program 1 times [2024-11-17 00:25:22,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:22,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128874791] [2024-11-17 00:25:22,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:22,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:22,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:22,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:22,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:22,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128874791] [2024-11-17 00:25:22,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128874791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:22,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:22,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:25:22,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852873232] [2024-11-17 00:25:22,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:22,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:25:22,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:22,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:25:22,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:25:22,836 INFO L87 Difference]: Start difference. First operand has 95 states, 50 states have (on average 2.0) internal successors, (100), 94 states have internal predecessors, (100), 0 states have call successors, (0), 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.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:23,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:23,107 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2024-11-17 00:25:23,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:25:23,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-17 00:25:23,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:23,118 INFO L225 Difference]: With dead ends: 111 [2024-11-17 00:25:23,118 INFO L226 Difference]: Without dead ends: 108 [2024-11-17 00:25:23,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:25:23,124 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 79 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:23,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 105 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:25:23,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-17 00:25:23,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2024-11-17 00:25:23,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 95 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:23,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2024-11-17 00:25:23,160 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 4 [2024-11-17 00:25:23,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:23,161 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2024-11-17 00:25:23,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:23,161 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2024-11-17 00:25:23,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-17 00:25:23,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:23,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-17 00:25:23,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 00:25:23,162 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-17 00:25:23,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:23,163 INFO L85 PathProgramCache]: Analyzing trace with hash 4000862, now seen corresponding path program 1 times [2024-11-17 00:25:23,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:23,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544501913] [2024-11-17 00:25:23,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:23,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:23,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:23,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:23,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:23,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544501913] [2024-11-17 00:25:23,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544501913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:23,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:23,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:25:23,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016266082] [2024-11-17 00:25:23,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:23,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:25:23,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:23,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:25:23,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:25:23,271 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:23,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:23,374 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2024-11-17 00:25:23,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:25:23,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-17 00:25:23,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:23,376 INFO L225 Difference]: With dead ends: 92 [2024-11-17 00:25:23,376 INFO L226 Difference]: Without dead ends: 92 [2024-11-17 00:25:23,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:25:23,378 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 85 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:23,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 80 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:25:23,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-17 00:25:23,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-17 00:25:23,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 57 states have (on average 1.7543859649122806) internal successors, (100), 91 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:23,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 100 transitions. [2024-11-17 00:25:23,388 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 100 transitions. Word has length 4 [2024-11-17 00:25:23,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:23,388 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 100 transitions. [2024-11-17 00:25:23,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:23,389 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 100 transitions. [2024-11-17 00:25:23,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-17 00:25:23,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:23,389 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-17 00:25:23,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 00:25:23,390 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-17 00:25:23,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:23,390 INFO L85 PathProgramCache]: Analyzing trace with hash 124026783, now seen corresponding path program 1 times [2024-11-17 00:25:23,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:23,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851823251] [2024-11-17 00:25:23,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:23,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:23,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:23,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851823251] [2024-11-17 00:25:23,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851823251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:23,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:23,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:25:23,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364661741] [2024-11-17 00:25:23,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:23,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:25:23,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:23,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:25:23,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:25:23,452 INFO L87 Difference]: Start difference. First operand 92 states and 100 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:23,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:23,529 INFO L93 Difference]: Finished difference Result 88 states and 95 transitions. [2024-11-17 00:25:23,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:25:23,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-17 00:25:23,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:23,530 INFO L225 Difference]: With dead ends: 88 [2024-11-17 00:25:23,531 INFO L226 Difference]: Without dead ends: 88 [2024-11-17 00:25:23,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:25:23,532 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 12 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:23,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 101 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:25:23,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-17 00:25:23,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-17 00:25:23,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 57 states have (on average 1.6666666666666667) internal successors, (95), 87 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:23,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 95 transitions. [2024-11-17 00:25:23,541 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 95 transitions. Word has length 5 [2024-11-17 00:25:23,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:23,542 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 95 transitions. [2024-11-17 00:25:23,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:23,542 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 95 transitions. [2024-11-17 00:25:23,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-17 00:25:23,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:23,543 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-17 00:25:23,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 00:25:23,543 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-17 00:25:23,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:23,544 INFO L85 PathProgramCache]: Analyzing trace with hash 124026784, now seen corresponding path program 1 times [2024-11-17 00:25:23,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:23,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679634060] [2024-11-17 00:25:23,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:23,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:23,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:23,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:23,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:23,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679634060] [2024-11-17 00:25:23,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679634060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:23,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:23,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:25:23,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35709605] [2024-11-17 00:25:23,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:23,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:25:23,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:23,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:25:23,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:25:23,631 INFO L87 Difference]: Start difference. First operand 88 states and 95 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:23,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:23,687 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2024-11-17 00:25:23,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:25:23,688 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-17 00:25:23,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:23,689 INFO L225 Difference]: With dead ends: 84 [2024-11-17 00:25:23,689 INFO L226 Difference]: Without dead ends: 84 [2024-11-17 00:25:23,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:25:23,690 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 12 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:23,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 109 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:25:23,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-17 00:25:23,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-17 00:25:23,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 57 states have (on average 1.5789473684210527) internal successors, (90), 83 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:23,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2024-11-17 00:25:23,695 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 5 [2024-11-17 00:25:23,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:23,696 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2024-11-17 00:25:23,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:23,696 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2024-11-17 00:25:23,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 00:25:23,696 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:23,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:23,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 00:25:23,697 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-17 00:25:23,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:23,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1051873319, now seen corresponding path program 1 times [2024-11-17 00:25:23,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:23,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282173178] [2024-11-17 00:25:23,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:23,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:23,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:23,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:23,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282173178] [2024-11-17 00:25:23,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282173178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:23,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:23,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:25:23,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705436791] [2024-11-17 00:25:23,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:23,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 00:25:23,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:23,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 00:25:23,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 00:25:23,967 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:24,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:24,168 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2024-11-17 00:25:24,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:25:24,169 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-17 00:25:24,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:24,170 INFO L225 Difference]: With dead ends: 94 [2024-11-17 00:25:24,170 INFO L226 Difference]: Without dead ends: 94 [2024-11-17 00:25:24,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-17 00:25:24,171 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 20 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:24,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 394 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:25:24,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-17 00:25:24,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2024-11-17 00:25:24,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.5238095238095237) internal successors, (96), 89 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:24,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2024-11-17 00:25:24,185 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 10 [2024-11-17 00:25:24,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:24,185 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2024-11-17 00:25:24,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:24,185 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2024-11-17 00:25:24,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:25:24,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:24,186 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:24,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 00:25:24,187 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-17 00:25:24,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:24,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1751628848, now seen corresponding path program 1 times [2024-11-17 00:25:24,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:24,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578554387] [2024-11-17 00:25:24,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:24,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:24,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:24,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:24,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578554387] [2024-11-17 00:25:24,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578554387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:24,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:24,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:25:24,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255851537] [2024-11-17 00:25:24,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:24,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:25:24,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:24,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:25:24,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:25:24,332 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:24,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:24,398 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2024-11-17 00:25:24,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:25:24,401 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-17 00:25:24,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:24,401 INFO L225 Difference]: With dead ends: 89 [2024-11-17 00:25:24,402 INFO L226 Difference]: Without dead ends: 89 [2024-11-17 00:25:24,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:25:24,403 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 87 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:24,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 106 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:25:24,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-17 00:25:24,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2024-11-17 00:25:24,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 60 states have (on average 1.5333333333333334) internal successors, (92), 85 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:24,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2024-11-17 00:25:24,408 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 11 [2024-11-17 00:25:24,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:24,408 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2024-11-17 00:25:24,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:24,408 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2024-11-17 00:25:24,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:25:24,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:24,409 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:24,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 00:25:24,411 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-17 00:25:24,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:24,412 INFO L85 PathProgramCache]: Analyzing trace with hash -511244620, now seen corresponding path program 1 times [2024-11-17 00:25:24,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:24,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707324198] [2024-11-17 00:25:24,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:24,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:24,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:24,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:24,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707324198] [2024-11-17 00:25:24,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707324198] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:24,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:24,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:25:24,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755950995] [2024-11-17 00:25:24,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:24,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:25:24,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:24,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:25:24,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:25:24,607 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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-11-17 00:25:24,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:24,761 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2024-11-17 00:25:24,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:25:24,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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-11-17 00:25:24,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:24,762 INFO L225 Difference]: With dead ends: 98 [2024-11-17 00:25:24,762 INFO L226 Difference]: Without dead ends: 98 [2024-11-17 00:25:24,763 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-11-17 00:25:24,763 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 59 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:24,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 139 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:25:24,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-17 00:25:24,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2024-11-17 00:25:24,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 84 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:24,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2024-11-17 00:25:24,774 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 16 [2024-11-17 00:25:24,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:24,776 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2024-11-17 00:25:24,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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-11-17 00:25:24,776 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2024-11-17 00:25:24,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 00:25:24,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:24,777 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:24,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 00:25:24,777 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-17 00:25:24,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:24,777 INFO L85 PathProgramCache]: Analyzing trace with hash -511244619, now seen corresponding path program 1 times [2024-11-17 00:25:24,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:24,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074136280] [2024-11-17 00:25:24,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:24,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:24,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:25,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:25,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074136280] [2024-11-17 00:25:25,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074136280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:25,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:25,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:25:25,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305488027] [2024-11-17 00:25:25,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:25,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:25:25,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:25,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:25:25,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:25:25,029 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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-11-17 00:25:25,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:25,178 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2024-11-17 00:25:25,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:25:25,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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-11-17 00:25:25,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:25,179 INFO L225 Difference]: With dead ends: 98 [2024-11-17 00:25:25,180 INFO L226 Difference]: Without dead ends: 98 [2024-11-17 00:25:25,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:25:25,180 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 62 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:25,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 183 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:25:25,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-17 00:25:25,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 84. [2024-11-17 00:25:25,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.5) internal successors, (90), 83 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:25,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2024-11-17 00:25:25,185 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 16 [2024-11-17 00:25:25,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:25,185 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2024-11-17 00:25:25,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 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-11-17 00:25:25,185 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2024-11-17 00:25:25,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-17 00:25:25,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:25,186 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:25,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 00:25:25,187 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-17 00:25:25,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:25,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1679897612, now seen corresponding path program 1 times [2024-11-17 00:25:25,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:25,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459413490] [2024-11-17 00:25:25,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:25,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:25,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:25,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:25,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459413490] [2024-11-17 00:25:25,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459413490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:25,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:25,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:25:25,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504158894] [2024-11-17 00:25:25,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:25,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:25:25,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:25,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:25:25,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:25:25,262 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-11-17 00:25:25,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:25,278 INFO L93 Difference]: Finished difference Result 82 states and 84 transitions. [2024-11-17 00:25:25,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:25:25,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-11-17 00:25:25,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:25,279 INFO L225 Difference]: With dead ends: 82 [2024-11-17 00:25:25,280 INFO L226 Difference]: Without dead ends: 82 [2024-11-17 00:25:25,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:25:25,280 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 62 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:25,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 160 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:25:25,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-17 00:25:25,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 78. [2024-11-17 00:25:25,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 77 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:25,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2024-11-17 00:25:25,284 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 18 [2024-11-17 00:25:25,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:25,284 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2024-11-17 00:25:25,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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-11-17 00:25:25,285 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2024-11-17 00:25:25,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 00:25:25,285 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:25,285 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-11-17 00:25:25,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 00:25:25,285 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-17 00:25:25,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:25,286 INFO L85 PathProgramCache]: Analyzing trace with hash -534414106, now seen corresponding path program 1 times [2024-11-17 00:25:25,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:25,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32526225] [2024-11-17 00:25:25,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:25,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:25,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:25,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:25,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:25,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32526225] [2024-11-17 00:25:25,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32526225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:25,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:25,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:25:25,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690006485] [2024-11-17 00:25:25,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:25,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:25:25,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:25,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:25:25,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:25:25,368 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-11-17 00:25:25,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:25,453 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2024-11-17 00:25:25,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:25:25,454 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-11-17 00:25:25,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:25,454 INFO L225 Difference]: With dead ends: 77 [2024-11-17 00:25:25,454 INFO L226 Difference]: Without dead ends: 77 [2024-11-17 00:25:25,455 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-11-17 00:25:25,455 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 9 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:25,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 172 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:25:25,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-17 00:25:25,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-17 00:25:25,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 54 states have (on average 1.462962962962963) internal successors, (79), 76 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:25,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2024-11-17 00:25:25,459 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 19 [2024-11-17 00:25:25,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:25,459 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2024-11-17 00:25:25,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-11-17 00:25:25,460 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2024-11-17 00:25:25,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 00:25:25,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:25,460 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-11-17 00:25:25,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 00:25:25,461 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-17 00:25:25,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:25,461 INFO L85 PathProgramCache]: Analyzing trace with hash -534414105, now seen corresponding path program 1 times [2024-11-17 00:25:25,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:25,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007843924] [2024-11-17 00:25:25,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:25,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:25,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:25,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:25,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007843924] [2024-11-17 00:25:25,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007843924] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:25,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:25,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:25:25,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978692421] [2024-11-17 00:25:25,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:25,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:25:25,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:25,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:25:25,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:25:25,742 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 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-11-17 00:25:25,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:25,888 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2024-11-17 00:25:25,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:25:25,889 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 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-11-17 00:25:25,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:25,889 INFO L225 Difference]: With dead ends: 79 [2024-11-17 00:25:25,890 INFO L226 Difference]: Without dead ends: 79 [2024-11-17 00:25:25,890 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-11-17 00:25:25,891 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 72 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:25,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 210 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:25:25,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-17 00:25:25,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2024-11-17 00:25:25,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 75 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:25,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2024-11-17 00:25:25,899 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 19 [2024-11-17 00:25:25,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:25,899 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2024-11-17 00:25:25,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 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-11-17 00:25:25,899 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2024-11-17 00:25:25,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-17 00:25:25,900 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:25,900 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-11-17 00:25:25,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 00:25:25,900 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-17 00:25:25,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:25,900 INFO L85 PathProgramCache]: Analyzing trace with hash 613031919, now seen corresponding path program 1 times [2024-11-17 00:25:25,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:25,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158280279] [2024-11-17 00:25:25,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:25,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:26,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:26,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:26,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158280279] [2024-11-17 00:25:26,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158280279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:26,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:26,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:25:26,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834912582] [2024-11-17 00:25:26,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:26,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:25:26,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:26,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:25:26,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:25:26,333 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-11-17 00:25:26,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:26,520 INFO L93 Difference]: Finished difference Result 117 states and 125 transitions. [2024-11-17 00:25:26,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:25:26,520 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-11-17 00:25:26,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:26,530 INFO L225 Difference]: With dead ends: 117 [2024-11-17 00:25:26,531 INFO L226 Difference]: Without dead ends: 117 [2024-11-17 00:25:26,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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-11-17 00:25:26,533 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 44 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:26,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 259 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:25:26,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-17 00:25:26,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 88. [2024-11-17 00:25:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.378787878787879) internal successors, (91), 87 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:26,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2024-11-17 00:25:26,537 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 20 [2024-11-17 00:25:26,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:26,537 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2024-11-17 00:25:26,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 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-11-17 00:25:26,538 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2024-11-17 00:25:26,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 00:25:26,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:26,538 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-11-17 00:25:26,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 00:25:26,539 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-17 00:25:26,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:26,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1824120324, now seen corresponding path program 1 times [2024-11-17 00:25:26,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:26,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601397063] [2024-11-17 00:25:26,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:26,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:26,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:26,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:26,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601397063] [2024-11-17 00:25:26,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601397063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:26,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:26,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:25:26,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814251589] [2024-11-17 00:25:26,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:26,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:25:26,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:26,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:25:26,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:25:26,944 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:27,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:27,181 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2024-11-17 00:25:27,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 00:25:27,181 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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-11-17 00:25:27,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:27,182 INFO L225 Difference]: With dead ends: 116 [2024-11-17 00:25:27,182 INFO L226 Difference]: Without dead ends: 116 [2024-11-17 00:25:27,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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-11-17 00:25:27,182 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 46 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:27,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 214 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:25:27,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-17 00:25:27,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 89. [2024-11-17 00:25:27,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 67 states have (on average 1.373134328358209) internal successors, (92), 88 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:27,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 92 transitions. [2024-11-17 00:25:27,185 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 92 transitions. Word has length 21 [2024-11-17 00:25:27,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:27,185 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 92 transitions. [2024-11-17 00:25:27,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:27,186 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 92 transitions. [2024-11-17 00:25:27,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 00:25:27,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:27,188 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:27,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 00:25:27,189 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-17 00:25:27,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:27,189 INFO L85 PathProgramCache]: Analyzing trace with hash 869110790, now seen corresponding path program 1 times [2024-11-17 00:25:27,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:27,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285517146] [2024-11-17 00:25:27,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:27,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:27,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:27,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:27,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285517146] [2024-11-17 00:25:27,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285517146] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:25:27,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824341363] [2024-11-17 00:25:27,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:27,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:25:27,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:25:27,460 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-11-17 00:25:27,462 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-11-17 00:25:27,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:27,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-17 00:25:27,606 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:25:27,719 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-11-17 00:25:27,756 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-17 00:25:27,757 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-11-17 00:25:27,783 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-11-17 00:25:27,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:25:27,869 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-11-17 00:25:27,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:27,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:25:28,011 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-11-17 00:25:28,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:25:28,431 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-11-17 00:25:29,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:29,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824341363] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:25:29,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:25:29,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-17 00:25:29,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453116929] [2024-11-17 00:25:29,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:25:29,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-17 00:25:29,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:29,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 00:25:29,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-17 00:25:29,123 INFO L87 Difference]: Start difference. First operand 89 states and 92 transitions. Second operand has 16 states, 15 states have (on average 2.4) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:29,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:29,448 INFO L93 Difference]: Finished difference Result 91 states and 94 transitions. [2024-11-17 00:25:29,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:25:29,449 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-17 00:25:29,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:29,449 INFO L225 Difference]: With dead ends: 91 [2024-11-17 00:25:29,450 INFO L226 Difference]: Without dead ends: 91 [2024-11-17 00:25:29,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2024-11-17 00:25:29,450 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 98 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:29,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 323 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:25:29,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-17 00:25:29,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2024-11-17 00:25:29,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 87 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:29,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2024-11-17 00:25:29,454 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 21 [2024-11-17 00:25:29,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:29,454 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2024-11-17 00:25:29,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 16 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:29,454 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2024-11-17 00:25:29,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 00:25:29,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:29,455 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:29,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-17 00:25:29,659 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,SelfDestructingSolverStorable13 [2024-11-17 00:25:29,660 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-17 00:25:29,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:29,660 INFO L85 PathProgramCache]: Analyzing trace with hash 869110791, now seen corresponding path program 1 times [2024-11-17 00:25:29,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:29,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52917141] [2024-11-17 00:25:29,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:29,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:29,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:30,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:30,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:30,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52917141] [2024-11-17 00:25:30,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52917141] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:25:30,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431101957] [2024-11-17 00:25:30,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:30,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:25:30,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:25:30,055 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-11-17 00:25:30,056 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-11-17 00:25:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:30,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-17 00:25:30,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:25:30,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-17 00:25:30,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 00:25:30,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:25:30,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 00:25:30,285 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 00:25:30,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-17 00:25:30,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:25:30,354 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-11-17 00:25:30,390 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-17 00:25:30,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-17 00:25:30,405 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-17 00:25:30,405 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-11-17 00:25:30,432 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-11-17 00:25:30,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:25:30,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-17 00:25:30,519 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-11-17 00:25:30,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-17 00:25:30,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:30,528 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:25:30,708 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-11-17 00:25:30,711 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-11-17 00:25:30,738 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-11-17 00:25:30,876 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:25:30,876 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-11-17 00:25:31,199 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:31,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431101957] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:25:31,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-17 00:25:31,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-11-17 00:25:31,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777810601] [2024-11-17 00:25:31,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-17 00:25:31,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-17 00:25:31,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:31,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-17 00:25:31,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2024-11-17 00:25:31,201 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:31,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:31,667 INFO L93 Difference]: Finished difference Result 90 states and 93 transitions. [2024-11-17 00:25:31,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 00:25:31,668 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 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-11-17 00:25:31,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:31,668 INFO L225 Difference]: With dead ends: 90 [2024-11-17 00:25:31,669 INFO L226 Difference]: Without dead ends: 90 [2024-11-17 00:25:31,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=435, Unknown=0, NotChecked=0, Total=552 [2024-11-17 00:25:31,669 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 63 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:31,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 436 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 00:25:31,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-17 00:25:31,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2024-11-17 00:25:31,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 86 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:31,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2024-11-17 00:25:31,672 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 21 [2024-11-17 00:25:31,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:31,672 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2024-11-17 00:25:31,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:31,673 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2024-11-17 00:25:31,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 00:25:31,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:31,673 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-11-17 00:25:31,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-17 00:25:31,877 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,SelfDestructingSolverStorable14 [2024-11-17 00:25:31,878 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-17 00:25:31,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:31,878 INFO L85 PathProgramCache]: Analyzing trace with hash 713155213, now seen corresponding path program 1 times [2024-11-17 00:25:31,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:31,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125296730] [2024-11-17 00:25:31,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:31,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:32,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-11-17 00:25:32,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:32,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125296730] [2024-11-17 00:25:32,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125296730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:32,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:32,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:25:32,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749131925] [2024-11-17 00:25:32,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:32,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:25:32,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:32,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:25:32,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:25:32,133 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 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-11-17 00:25:32,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:32,385 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2024-11-17 00:25:32,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 00:25:32,385 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 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-11-17 00:25:32,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:32,386 INFO L225 Difference]: With dead ends: 102 [2024-11-17 00:25:32,386 INFO L226 Difference]: Without dead ends: 102 [2024-11-17 00:25:32,387 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-11-17 00:25:32,387 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 26 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:32,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 244 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:25:32,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-17 00:25:32,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 88. [2024-11-17 00:25:32,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.338235294117647) internal successors, (91), 87 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:32,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 91 transitions. [2024-11-17 00:25:32,390 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 91 transitions. Word has length 22 [2024-11-17 00:25:32,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:32,390 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 91 transitions. [2024-11-17 00:25:32,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 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-11-17 00:25:32,390 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 91 transitions. [2024-11-17 00:25:32,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-17 00:25:32,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:32,391 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, 1] [2024-11-17 00:25:32,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 00:25:32,391 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-17 00:25:32,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:32,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1852607158, now seen corresponding path program 1 times [2024-11-17 00:25:32,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:32,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447075252] [2024-11-17 00:25:32,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:32,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:32,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:32,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:32,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447075252] [2024-11-17 00:25:32,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447075252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:32,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:32,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 00:25:32,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784257401] [2024-11-17 00:25:32,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:32,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:25:32,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:32,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:25:32,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:25:32,565 INFO L87 Difference]: Start difference. First operand 88 states and 91 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:32,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:32,680 INFO L93 Difference]: Finished difference Result 87 states and 90 transitions. [2024-11-17 00:25:32,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:25:32,680 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-17 00:25:32,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:32,681 INFO L225 Difference]: With dead ends: 87 [2024-11-17 00:25:32,682 INFO L226 Difference]: Without dead ends: 87 [2024-11-17 00:25:32,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-17 00:25:32,683 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 124 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:32,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 69 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:25:32,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-17 00:25:32,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-11-17 00:25:32,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 86 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:32,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 90 transitions. [2024-11-17 00:25:32,686 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 90 transitions. Word has length 24 [2024-11-17 00:25:32,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:32,686 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 90 transitions. [2024-11-17 00:25:32,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:32,687 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 90 transitions. [2024-11-17 00:25:32,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-17 00:25:32,687 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:32,687 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, 1] [2024-11-17 00:25:32,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 00:25:32,689 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-17 00:25:32,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:32,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1852607157, now seen corresponding path program 1 times [2024-11-17 00:25:32,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:32,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619558318] [2024-11-17 00:25:32,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:32,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:32,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:32,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:32,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:32,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619558318] [2024-11-17 00:25:32,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619558318] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:32,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:32,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:25:32,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293831159] [2024-11-17 00:25:32,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:32,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:25:32,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:32,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:25:32,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:25:32,771 INFO L87 Difference]: Start difference. First operand 87 states and 90 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:32,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:32,806 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2024-11-17 00:25:32,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:25:32,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-17 00:25:32,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:32,807 INFO L225 Difference]: With dead ends: 82 [2024-11-17 00:25:32,807 INFO L226 Difference]: Without dead ends: 82 [2024-11-17 00:25:32,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:25:32,808 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 84 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:32,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 44 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:25:32,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-17 00:25:32,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-17 00:25:32,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 68 states have (on average 1.25) internal successors, (85), 81 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:32,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 85 transitions. [2024-11-17 00:25:32,811 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 85 transitions. Word has length 24 [2024-11-17 00:25:32,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:32,811 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 85 transitions. [2024-11-17 00:25:32,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:32,811 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 85 transitions. [2024-11-17 00:25:32,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-17 00:25:32,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:32,811 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, 1, 1] [2024-11-17 00:25:32,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 00:25:32,812 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-17 00:25:32,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:32,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1596247039, now seen corresponding path program 1 times [2024-11-17 00:25:32,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:32,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164514145] [2024-11-17 00:25:32,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:32,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:32,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:32,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:32,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164514145] [2024-11-17 00:25:32,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164514145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:32,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:32,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:25:32,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250645074] [2024-11-17 00:25:32,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:32,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:25:32,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:32,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:25:32,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:25:32,903 INFO L87 Difference]: Start difference. First operand 82 states and 85 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:32,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:32,954 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2024-11-17 00:25:32,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:25:32,955 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-17 00:25:32,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:32,956 INFO L225 Difference]: With dead ends: 81 [2024-11-17 00:25:32,956 INFO L226 Difference]: Without dead ends: 81 [2024-11-17 00:25:32,956 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-11-17 00:25:32,956 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 27 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:32,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 154 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:25:32,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-17 00:25:32,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-17 00:25:32,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 80 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:32,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 84 transitions. [2024-11-17 00:25:32,959 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 84 transitions. Word has length 25 [2024-11-17 00:25:32,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:32,959 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 84 transitions. [2024-11-17 00:25:32,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:32,960 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 84 transitions. [2024-11-17 00:25:32,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-17 00:25:32,960 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:32,960 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, 1, 1, 1] [2024-11-17 00:25:32,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-17 00:25:32,961 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-17 00:25:32,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:32,961 INFO L85 PathProgramCache]: Analyzing trace with hash 2055949352, now seen corresponding path program 1 times [2024-11-17 00:25:32,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:32,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511182653] [2024-11-17 00:25:32,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:32,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:33,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:33,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:33,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511182653] [2024-11-17 00:25:33,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511182653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:33,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:33,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:25:33,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062807397] [2024-11-17 00:25:33,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:33,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:25:33,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:33,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:25:33,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:25:33,082 INFO L87 Difference]: Start difference. First operand 81 states and 84 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:33,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:33,169 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2024-11-17 00:25:33,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 00:25:33,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-17 00:25:33,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:33,170 INFO L225 Difference]: With dead ends: 83 [2024-11-17 00:25:33,170 INFO L226 Difference]: Without dead ends: 83 [2024-11-17 00:25:33,170 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-11-17 00:25:33,170 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 28 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:33,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 132 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:25:33,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-17 00:25:33,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2024-11-17 00:25:33,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 79 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:33,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2024-11-17 00:25:33,173 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 26 [2024-11-17 00:25:33,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:33,173 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2024-11-17 00:25:33,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:33,173 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2024-11-17 00:25:33,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-17 00:25:33,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:33,174 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, 1, 1, 1, 1] [2024-11-17 00:25:33,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-17 00:25:33,174 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-17 00:25:33,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:33,175 INFO L85 PathProgramCache]: Analyzing trace with hash -690079521, now seen corresponding path program 1 times [2024-11-17 00:25:33,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:33,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713919149] [2024-11-17 00:25:33,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:33,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:33,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:33,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:33,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:33,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713919149] [2024-11-17 00:25:33,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713919149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:33,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:33,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-17 00:25:33,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232369719] [2024-11-17 00:25:33,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:33,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 00:25:33,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:33,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 00:25:33,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:25:33,664 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:34,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:34,126 INFO L93 Difference]: Finished difference Result 102 states and 106 transitions. [2024-11-17 00:25:34,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-17 00:25:34,126 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-17 00:25:34,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:34,127 INFO L225 Difference]: With dead ends: 102 [2024-11-17 00:25:34,127 INFO L226 Difference]: Without dead ends: 102 [2024-11-17 00:25:34,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2024-11-17 00:25:34,129 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 72 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:34,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 267 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:25:34,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-17 00:25:34,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 85. [2024-11-17 00:25:34,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 84 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:34,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 88 transitions. [2024-11-17 00:25:34,132 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 88 transitions. Word has length 27 [2024-11-17 00:25:34,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:34,132 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 88 transitions. [2024-11-17 00:25:34,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:34,133 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 88 transitions. [2024-11-17 00:25:34,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-17 00:25:34,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:34,133 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, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:34,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-17 00:25:34,134 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-17 00:25:34,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:34,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1741455908, now seen corresponding path program 1 times [2024-11-17 00:25:34,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:34,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313682977] [2024-11-17 00:25:34,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:34,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:34,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:34,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313682977] [2024-11-17 00:25:34,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313682977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:34,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:34,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:25:34,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005004955] [2024-11-17 00:25:34,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:34,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 00:25:34,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:34,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 00:25:34,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 00:25:34,319 INFO L87 Difference]: Start difference. First operand 85 states and 88 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:34,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:34,416 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2024-11-17 00:25:34,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 00:25:34,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-17 00:25:34,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:34,417 INFO L225 Difference]: With dead ends: 84 [2024-11-17 00:25:34,417 INFO L226 Difference]: Without dead ends: 84 [2024-11-17 00:25:34,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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-11-17 00:25:34,418 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 71 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:34,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 94 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:25:34,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-17 00:25:34,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-17 00:25:34,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 83 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:34,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2024-11-17 00:25:34,420 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 29 [2024-11-17 00:25:34,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:34,420 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2024-11-17 00:25:34,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:34,420 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2024-11-17 00:25:34,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-17 00:25:34,421 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:34,421 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:34,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-17 00:25:34,421 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-17 00:25:34,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:34,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1425602114, now seen corresponding path program 1 times [2024-11-17 00:25:34,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:34,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228565413] [2024-11-17 00:25:34,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:34,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:34,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:34,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:34,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228565413] [2024-11-17 00:25:34,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228565413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:25:34,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:25:34,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 00:25:34,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150741449] [2024-11-17 00:25:34,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:25:34,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 00:25:34,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 00:25:34,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 00:25:34,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:25:34,482 INFO L87 Difference]: Start difference. First operand 84 states and 87 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:34,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:25:34,499 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2024-11-17 00:25:34,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:25:34,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-17 00:25:34,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:25:34,500 INFO L225 Difference]: With dead ends: 125 [2024-11-17 00:25:34,500 INFO L226 Difference]: Without dead ends: 125 [2024-11-17 00:25:34,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:25:34,501 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 14 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:25:34,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 219 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:25:34,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-17 00:25:34,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 108. [2024-11-17 00:25:34,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 97 states have (on average 1.1546391752577319) internal successors, (112), 107 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:34,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2024-11-17 00:25:34,504 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 34 [2024-11-17 00:25:34,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:25:34,504 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2024-11-17 00:25:34,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:25:34,504 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2024-11-17 00:25:34,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-17 00:25:34,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:25:34,505 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:25:34,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-17 00:25:34,505 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2024-11-17 00:25:34,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:25:34,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1351262722, now seen corresponding path program 1 times [2024-11-17 00:25:34,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 00:25:34,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630637446] [2024-11-17 00:25:34,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:34,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 00:25:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:35,349 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-17 00:25:35,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 00:25:35,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630637446] [2024-11-17 00:25:35,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630637446] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:25:35,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639048386] [2024-11-17 00:25:35,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:25:35,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 00:25:35,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:25:35,352 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-11-17 00:25:35,353 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-11-17 00:25:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:25:35,489 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-17 00:25:35,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:25:35,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:25:35,670 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-11-17 00:25:35,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-17 00:25:35,731 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-17 00:25:35,731 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-11-17 00:25:35,864 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-11-17 00:25:35,884 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-11-17 00:25:36,026 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-11-17 00:25:36,217 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:25:36,223 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-17 00:25:36,224 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 50 treesize of output 54 [2024-11-17 00:25:36,347 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:25:36,348 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 66 treesize of output 39 [2024-11-17 00:25:36,354 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:25:36,355 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 61 treesize of output 34 [2024-11-17 00:25:36,793 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:25:36,794 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 40 treesize of output 24 [2024-11-17 00:25:36,800 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:25:36,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:25:36,803 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 22 treesize of output 13 [2024-11-17 00:25:36,885 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:25:36,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 00:25:36,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2024-11-17 00:25:36,891 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:25:36,892 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:25:37,861 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-17 00:25:37,861 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 204 treesize of output 194 [2024-11-17 00:25:37,936 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-17 00:25:37,937 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 294 treesize of output 280 [2024-11-17 00:25:37,956 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:25:37,956 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 202 treesize of output 200 [2024-11-17 00:25:37,978 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:25:37,978 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 206 treesize of output 202 [2024-11-17 00:25:37,994 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-17 00:25:38,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-17 00:25:38,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:25:38,080 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 318 treesize of output 332 [2024-11-17 00:25:38,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:25:38,864 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 1673 treesize of output 1653 [2024-11-17 00:25:56,803 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse128 (< |c_ULTIMATE.start_main_~#list~0#1.offset| (+ 2 |c_ULTIMATE.start_append_~plist#1.offset|))) (.cse124 (< |c_ULTIMATE.start_append_~plist#1.offset| 1)) (.cse5 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 1))) (let ((.cse145 (or .cse124 .cse5)) (.cse146 (or .cse5 .cse128))) (let ((.cse4 (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_append_~plist#1.base|)) (.cse3 (forall ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= 0 (let ((.cse276 (+ 4 v_arrayElimCell_58))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse275 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_58))) (store .cse275 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse275) |c_ULTIMATE.start_append_~item~0#1.base|) .cse276)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse276))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0)))) (.cse240 (forall ((v_ArrVal_664 Int) (v_prenex_22 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse271 (+ 4 v_arrayElimCell_58))) (let ((.cse273 (let ((.cse274 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse274 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse274) v_prenex_22) .cse271))))) (let ((.cse270 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse273) v_prenex_22)) (.cse272 (+ v_ArrVal_664 4))) (or (= (select .cse270 .cse271) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse270 .cse272) 0) (= (select .cse273 .cse272) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select .cse273 .cse271) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664))))))) (.cse2 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) (.cse11 (+ 4 |c_ULTIMATE.start_append_~item~0#1.offset|)) (.cse29 (and .cse145 .cse146))) (let ((.cse24 (or .cse29 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_ArrVal_664 Int)) (or (forall ((v_arrayElimCell_58 Int)) (or (forall ((v_prenex_22 Int) (v_arrayElimCell_46 Int)) (let ((.cse259 (let ((.cse260 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse260 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse260) v_prenex_22) (+ 4 v_arrayElimCell_46)))))) (let ((.cse257 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse259) v_prenex_22)) (.cse258 (+ 4 v_arrayElimCell_58))) (or (= (select .cse257 .cse258) 0) (= (select .cse257 (+ v_ArrVal_664 4)) 0) (= (select .cse259 .cse258) 0))))) (< v_arrayElimCell_58 0))) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664))))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_664 Int)) (or (forall ((v_arrayElimCell_58 Int)) (or (forall ((v_prenex_22 Int) (v_arrayElimCell_46 Int)) (let ((.cse261 (let ((.cse265 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse265 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse265) v_prenex_22) (+ 4 v_arrayElimCell_46)))))) (let ((.cse263 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse261) v_prenex_22)) (.cse262 (+ v_ArrVal_664 4)) (.cse264 (+ 4 v_arrayElimCell_58))) (or (= (select .cse261 .cse262) 0) (= (select .cse263 .cse264) 0) (= (select .cse263 .cse262) 0) (= (select .cse261 .cse264) 0))))) (< v_arrayElimCell_58 0))) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_22 Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int)) (let ((.cse266 (let ((.cse268 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse268 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse268) v_prenex_22) (+ 4 v_arrayElimCell_46))))) (.cse267 (+ 4 v_arrayElimCell_58))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse266) v_prenex_22) .cse267) 0) (< v_arrayElimCell_58 0) (= (select .cse266 .cse267) 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_16 Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int) (v_prenex_21 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse269 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse269 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse269) v_prenex_21) (+ 4 v_arrayElimCell_46))))) v_prenex_16) (+ 4 v_arrayElimCell_58)) 0) (< v_arrayElimCell_58 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|)))))) (.cse31 (or .cse5 (forall ((v_prenex_18 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse256 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse256 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse256) |c_ULTIMATE.start_append_~item~0#1.base|) .cse11)))) v_prenex_18) (+ 4 v_arrayElimCell_58)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0))))) (.cse72 (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_19 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse255 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse255 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse255) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46))))) v_prenex_19) (+ 4 v_arrayElimCell_58)) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0)))) (.cse46 (or .cse29 (forall ((v_prenex_17 Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse254 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse254 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse254) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46))))) v_prenex_17) (+ 4 v_arrayElimCell_58)) 0))))) (.cse70 (or .cse29 (forall ((v_prenex_23 Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse253 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse253 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse253) v_prenex_23) (+ 4 v_arrayElimCell_46))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_58)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0))))) (.cse14 (or (forall ((v_ArrVal_664 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (let ((.cse251 (+ 4 v_arrayElimCell_58))) (let ((.cse250 (let ((.cse252 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse252 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse252) v_arrayElimCell_55) .cse251))))) (let ((.cse249 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse250) v_arrayElimCell_55))) (or (= (select .cse249 (+ v_ArrVal_664 4)) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select .cse250 .cse251) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664) (= (select .cse249 .cse251) 0)))))) .cse5)) (.cse1 (or .cse2 (forall ((v_ArrVal_664 Int) (v_prenex_22 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse246 (let ((.cse248 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse248 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse248) v_prenex_22) (+ 4 v_arrayElimCell_58))))) (.cse247 (+ v_ArrVal_664 4))) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse246) v_prenex_22) .cse247) 0) (= (select .cse246 .cse247) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (< v_ArrVal_664 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664)))))) (.cse23 (forall ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_19 Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (let ((.cse245 (+ 4 v_arrayElimCell_58))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse244 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse244 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse244) |c_ULTIMATE.start_append_~item~0#1.base|) .cse245)))) v_prenex_19) .cse245)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0)))) (.cse13 (or (forall ((v_prenex_16 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (let ((.cse243 (+ 4 v_arrayElimCell_58))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse242 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse242 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse242) v_prenex_21) .cse243)))) v_prenex_16) .cse243)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0))) .cse29)) (.cse37 (or .cse2 (forall ((v_ArrVal_664 Int) (v_prenex_15 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (< v_ArrVal_664 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664) (= (select (let ((.cse241 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse241 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse241) v_prenex_15) (+ 4 v_arrayElimCell_58)))) (+ v_ArrVal_664 4)) 0))))) (.cse40 (or .cse124 .cse240 .cse5)) (.cse41 (or .cse240 .cse5 .cse128)) (.cse42 (or (forall ((v_ArrVal_664 Int) (v_prenex_22 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse237 (+ 4 v_arrayElimCell_58))) (let ((.cse238 (let ((.cse239 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse239 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse239) v_prenex_22) .cse237))))) (let ((.cse236 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse238) v_prenex_22))) (or (= (select .cse236 .cse237) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse236 (+ v_ArrVal_664 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select .cse238 .cse237) 0) (< v_ArrVal_664 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664)))))) .cse2)) (.cse43 (or .cse29 (forall ((v_prenex_17 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (let ((.cse235 (+ 4 v_arrayElimCell_58))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse234 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse234 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse234) |c_ULTIMATE.start_append_~item~0#1.base|) .cse235)))) v_prenex_17) .cse235)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0))))) (.cse45 (or .cse29 (forall ((v_ArrVal_664 Int) (v_prenex_22 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse231 (+ 4 v_arrayElimCell_58))) (let ((.cse232 (let ((.cse233 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse233 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse233) v_prenex_22) .cse231))))) (let ((.cse230 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse232) v_prenex_22))) (or (= (select .cse230 .cse231) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse230 (+ v_ArrVal_664 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select .cse232 .cse231) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664)))))))) (.cse55 (or .cse29 (forall ((v_prenex_22 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse228 (+ 4 v_arrayElimCell_58))) (let ((.cse227 (let ((.cse229 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse229 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse229) v_prenex_22) .cse228))))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse227) v_prenex_22) .cse228) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select .cse227 .cse228) 0))))))) (.cse12 (or .cse2 .cse3)) (.cse15 (or .cse5 (forall ((v_ArrVal_664 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (let ((.cse225 (+ 4 v_arrayElimCell_58))) (let ((.cse224 (let ((.cse226 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse226 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse226) v_arrayElimCell_55) .cse225))))) (let ((.cse222 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse224) v_arrayElimCell_55)) (.cse223 (+ v_ArrVal_664 4))) (or (= (select .cse222 .cse223) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select .cse224 .cse225) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664) (= (select .cse222 .cse225) 0) (= (select .cse224 .cse223) 0)))))))) (.cse71 (or (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse221 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse221 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse221) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_58)) 0))) .cse5)) (.cse22 (or .cse29 (forall ((v_prenex_23 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (let ((.cse220 (+ 4 v_arrayElimCell_58))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse219 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse219 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse219) v_prenex_23) .cse220)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse220)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0))))) (.cse16 (or (forall ((v_ArrVal_664 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (let ((.cse217 (+ 4 v_arrayElimCell_58))) (let ((.cse216 (let ((.cse218 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse218 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse218) v_arrayElimCell_55) .cse217))))) (let ((.cse215 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse216) v_arrayElimCell_55))) (or (= (select .cse215 (+ v_ArrVal_664 4)) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (< v_ArrVal_664 0) (= (select .cse216 .cse217) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664) (= (select .cse215 .cse217) 0)))))) .cse2)) (.cse48 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_664 Int)) (or (forall ((v_prenex_22 Int) (v_arrayElimCell_58 Int)) (let ((.cse212 (let ((.cse214 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse214 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse214) v_prenex_22) (+ 4 v_arrayElimCell_58))))) (.cse213 (+ v_ArrVal_664 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse212) v_prenex_22) .cse213) 0) (= (select .cse212 .cse213) 0)))) (< v_ArrVal_664 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|)))) (.cse49 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_ArrVal_664 Int)) (or (< v_ArrVal_664 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664) (forall ((v_prenex_22 Int) (v_arrayElimCell_58 Int)) (let ((.cse210 (+ 4 v_arrayElimCell_58))) (let ((.cse209 (+ v_ArrVal_664 4)) (.cse208 (let ((.cse211 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse211 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse211) v_prenex_22) .cse210))))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse208) v_prenex_22) .cse209) 0) (= (select .cse208 .cse209) 0) (= (select .cse208 .cse210) 0)))))))))))) (.cse54 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_ArrVal_664 Int)) (or (forall ((v_prenex_15 Int) (v_arrayElimCell_58 Int)) (= (select (let ((.cse207 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse207 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse207) v_prenex_15) (+ 4 v_arrayElimCell_58)))) (+ v_ArrVal_664 4)) 0)) (< v_ArrVal_664 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664)))))))) (.cse51 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_ArrVal_664 Int)) (or (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_55 Int)) (let ((.cse205 (+ 4 v_arrayElimCell_58))) (let ((.cse203 (let ((.cse206 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse206 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse206) v_arrayElimCell_55) .cse205)))) (.cse204 (+ v_ArrVal_664 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse203) v_arrayElimCell_55) .cse204) 0) (= (select .cse203 .cse205) 0) (= (select .cse203 .cse204) 0))))) (< v_ArrVal_664 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664)))))))) (.cse50 (forall ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= 0 (let ((.cse202 (+ 4 v_arrayElimCell_58))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse201 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 v_arrayElimCell_58))) (store .cse201 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse201) |c_ULTIMATE.start_append_~item~0#1.base|) .cse202)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse202))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (.cse52 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_664 Int)) (or (< v_ArrVal_664 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664) (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_55 Int)) (let ((.cse198 (let ((.cse200 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse200 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse200) v_arrayElimCell_55) (+ 4 v_arrayElimCell_58))))) (.cse199 (+ v_ArrVal_664 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse198) v_arrayElimCell_55) .cse199) 0) (= (select .cse198 .cse199) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (.cse53 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_ArrVal_664 Int)) (or (forall ((v_prenex_12 Int) (v_arrayElimCell_58 Int)) (= (select (let ((.cse197 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse197 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse197) v_prenex_12) (+ 4 v_arrayElimCell_58)))) (+ v_ArrVal_664 4)) 0)) (< v_ArrVal_664 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664)))))))) (.cse17 (or .cse5 (forall ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (let ((.cse195 (+ 4 v_arrayElimCell_58))) (let ((.cse194 (let ((.cse196 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse196 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse196) v_arrayElimCell_55) .cse195))))) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select .cse194 .cse195) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse194) v_arrayElimCell_55) .cse195) 0))))))) (.cse18 (or .cse5 (forall ((v_prenex_13 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (let ((.cse193 (+ 4 v_arrayElimCell_58))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse192 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse192 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse192) v_prenex_13) .cse193)))) v_prenex_13) .cse193)) 0))))) (.cse19 (or (forall ((v_ArrVal_664 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (let ((.cse189 (let ((.cse191 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse191 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse191) v_arrayElimCell_55) (+ 4 v_arrayElimCell_58))))) (.cse190 (+ v_ArrVal_664 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse189) v_arrayElimCell_55) .cse190) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (< v_ArrVal_664 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664) (= (select .cse189 .cse190) 0)))) .cse2)) (.cse20 (or (forall ((v_ArrVal_664 Int) (v_prenex_12 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (< v_ArrVal_664 0) (= (select (let ((.cse188 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse188 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse188) v_prenex_12) (+ 4 v_arrayElimCell_58)))) (+ v_ArrVal_664 4)) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664))) .cse2)) (.cse21 (or (forall ((v_prenex_14 Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_47 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (let ((.cse187 (+ 4 v_arrayElimCell_58))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse186 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse186 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse186) v_arrayElimCell_47) .cse187)))) v_prenex_14) .cse187)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0))) .cse5)) (.cse0 (= |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|)) (.cse32 (< |c_ULTIMATE.start_append_~plist#1.offset| 0)) (.cse33 (< |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|)) (.cse34 (not .cse4))) (and (or .cse0 (let ((.cse35 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_664 Int)) (or (forall ((v_arrayElimCell_58 Int)) (or (< v_arrayElimCell_58 0) (forall ((v_prenex_20 Int)) (let ((.cse75 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse76 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse76 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse76) |c_ULTIMATE.start_append_~item~0#1.base|) .cse11)))) v_prenex_20))) (or (= (select .cse75 (+ v_ArrVal_664 4)) 0) (= (select .cse75 (+ 4 v_arrayElimCell_58)) 0)))))) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) (.cse36 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_58 Int) (v_prenex_20 Int)) (or (< v_arrayElimCell_58 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse74 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse74 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse74) |c_ULTIMATE.start_append_~item~0#1.base|) .cse11)))) v_prenex_20) (+ 4 v_arrayElimCell_58)) 0)))))))) (.cse30 (forall ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse73 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse73 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse73) |c_ULTIMATE.start_append_~item~0#1.base|) .cse11)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_58)) 0))))) (and .cse1 (or .cse2 .cse3 .cse4) (or .cse5 (forall ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4)) (.cse9 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse8 (+ 4 v_arrayElimCell_58))) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse6 (store .cse9 |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse6 .cse7 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse6) |c_ULTIMATE.start_append_~item~0#1.base|) .cse8)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse8) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse10 (store .cse9 |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse10 .cse7 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse10) |c_ULTIMATE.start_append_~item~0#1.base|) .cse11)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse8) 0))))) .cse12 .cse13 (or (and .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21) .cse4) .cse22 (or .cse23 .cse5 .cse4) .cse24 (or (forall ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (let ((.cse27 (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|)) (.cse26 (+ 4 v_arrayElimCell_58))) (or (= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse25 (store .cse27 0 v_arrayElimCell_58))) (store .cse25 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse25) |c_ULTIMATE.start_append_~item~0#1.base|) .cse26)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse26)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse28 (store .cse27 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse28 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse28) |c_ULTIMATE.start_append_~item~0#1.base|) .cse11)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse26) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0)))) .cse2) (or .cse29 .cse30) (or .cse5 .cse30) .cse31 (or .cse32 .cse33 .cse34 (and .cse35 .cse36)) .cse37 (or .cse29 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_arrayElimCell_58 Int)) (or (< v_arrayElimCell_58 0) (forall ((v_prenex_23 Int) (v_arrayElimCell_46 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse38 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse38 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse38) v_prenex_23) (+ 4 v_arrayElimCell_46))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_58)) 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_58 Int)) (or (forall ((v_arrayElimCell_46 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse39 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse39 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse39) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_58)) 0)) (< v_arrayElimCell_58 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))))) .cse40 .cse41 .cse42 .cse43 (or (and .cse35 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_18 Int) (v_arrayElimCell_58 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse44 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse44 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse44) |c_ULTIMATE.start_append_~item~0#1.base|) .cse11)))) v_prenex_18) (+ 4 v_arrayElimCell_58)) 0) (< v_arrayElimCell_58 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) .cse36) .cse32 .cse33 .cse34) (or .cse32 .cse33 .cse34 .cse30) .cse45 .cse46 (or .cse2 (and (forall ((v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse47 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse47 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse47) |c_ULTIMATE.start_append_~item~0#1.base|) .cse11)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_58)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse48 .cse49 .cse50 (or (and .cse51 .cse52 .cse53) .cse4) .cse54)) .cse55 (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_13 Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse56 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse56 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse56) v_prenex_13) (+ 4 v_arrayElimCell_46))))) v_prenex_13) (+ 4 v_arrayElimCell_58)) 0) (< v_arrayElimCell_58 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_664 Int)) (or (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664) (forall ((v_arrayElimCell_58 Int)) (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_55 Int)) (let ((.cse59 (let ((.cse61 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse61 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse61) v_arrayElimCell_55) (+ 4 v_arrayElimCell_46)))))) (let ((.cse58 (+ v_ArrVal_664 4)) (.cse57 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse59) v_arrayElimCell_55)) (.cse60 (+ 4 v_arrayElimCell_58))) (or (= (select .cse57 .cse58) 0) (= (select .cse59 .cse58) 0) (= (select .cse57 .cse60) 0) (= (select .cse59 .cse60) 0))))) (< v_arrayElimCell_58 0))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_14 Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_46 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse62 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse62 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse62) v_arrayElimCell_47) (+ 4 v_arrayElimCell_46))))) v_prenex_14) (+ 4 v_arrayElimCell_58)) 0) (< v_arrayElimCell_58 0))))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_664 Int)) (or (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664) (forall ((v_arrayElimCell_58 Int)) (or (< v_arrayElimCell_58 0) (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_55 Int)) (let ((.cse65 (let ((.cse66 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse66 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse66) v_arrayElimCell_55) (+ 4 v_arrayElimCell_46)))))) (let ((.cse63 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse65) v_arrayElimCell_55)) (.cse64 (+ 4 v_arrayElimCell_58))) (or (= (select .cse63 (+ v_ArrVal_664 4)) 0) (= (select .cse63 .cse64) 0) (= (select .cse65 .cse64) 0))))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int) (v_arrayElimCell_55 Int)) (let ((.cse67 (let ((.cse69 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse69 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse69) v_arrayElimCell_55) (+ 4 v_arrayElimCell_46))))) (.cse68 (+ 4 v_arrayElimCell_58))) (or (< v_arrayElimCell_58 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse67) v_arrayElimCell_55) .cse68) 0) (= (select .cse67 .cse68) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|)))) .cse5 .cse4) (or .cse4 (and .cse70 .cse71)) (or .cse5 .cse72 .cse4)))) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse77 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse77 4 (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse77) |c_ULTIMATE.start_append_~item~0#1.base|) .cse11)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse11) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (or .cse0 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_664 Int)) (or (< v_ArrVal_664 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664) (forall ((v_prenex_22 Int)) (let ((.cse78 (let ((.cse80 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse80 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse80) v_prenex_22) .cse11)))) (.cse79 (+ v_ArrVal_664 4))) (or (= 0 (select .cse78 .cse79)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse78) v_prenex_22) .cse79) 0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_664 Int)) (or (forall ((v_prenex_22 Int)) (let ((.cse81 (let ((.cse83 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse83 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse83) v_prenex_22) .cse11)))) (.cse82 (+ v_ArrVal_664 4))) (or (= (select .cse81 .cse11) 0) (= 0 (select .cse81 .cse82)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse81) v_prenex_22) .cse82) 0)))) (< v_ArrVal_664 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_664 Int)) (or (forall ((v_prenex_15 Int)) (= (select (let ((.cse84 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse84 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse84) v_prenex_15) .cse11))) (+ v_ArrVal_664 4)) 0)) (< v_ArrVal_664 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))))) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_664 Int)) (or (< v_ArrVal_664 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664) (forall ((v_prenex_12 Int)) (= (select (let ((.cse85 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse85 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse85) v_prenex_12) .cse11))) (+ v_ArrVal_664 4)) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_664 Int)) (or (forall ((v_arrayElimCell_55 Int)) (let ((.cse87 (+ v_ArrVal_664 4)) (.cse86 (let ((.cse88 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse88 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse88) v_arrayElimCell_55) .cse11))))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse86) v_arrayElimCell_55) .cse87) 0) (= (select .cse86 .cse87) 0) (= (select .cse86 .cse11) 0)))) (< v_ArrVal_664 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_ArrVal_664 Int)) (or (forall ((v_arrayElimCell_55 Int)) (let ((.cse89 (let ((.cse91 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse91 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse91) v_arrayElimCell_55) .cse11)))) (.cse90 (+ v_ArrVal_664 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse89) v_arrayElimCell_55) .cse90) 0) (= (select .cse89 .cse90) 0)))) (< v_ArrVal_664 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664)))))))) .cse4)) .cse2) (or (and (or (forall ((v_ArrVal_664 Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (let ((.cse94 (let ((.cse96 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse96 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse96) v_arrayElimCell_55) (+ 4 v_arrayElimCell_46)))))) (let ((.cse93 (+ v_ArrVal_664 4)) (.cse92 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse94) v_arrayElimCell_55)) (.cse95 (+ 4 v_arrayElimCell_58))) (or (= (select .cse92 .cse93) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse94 .cse93) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select .cse92 .cse95) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664) (= (select .cse94 .cse95) 0))))) .cse5) (or .cse0 (and .cse24 .cse31 (or .cse5 .cse72) .cse46)) .cse70 .cse14 (or (and .cse1 (or .cse23 .cse5) .cse13 .cse37 .cse40 .cse41 .cse42 .cse43 .cse45 .cse55 (or (forall ((v_prenex_18 Int) (v_arrayElimCell_58 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (= 0 (let ((.cse98 (+ 4 v_arrayElimCell_58))) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse97 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_58))) (store .cse97 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse97) |c_ULTIMATE.start_append_~item~0#1.base|) .cse98)))) v_prenex_18) .cse98))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0))) .cse5)) .cse0) (or (forall ((v_prenex_13 Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse99 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse99 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse99) v_prenex_13) (+ 4 v_arrayElimCell_46))))) v_prenex_13) (+ 4 v_arrayElimCell_58)) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0))) .cse5) .cse12 .cse15 .cse71 .cse22 (or .cse5 (forall ((v_prenex_14 Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse100 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse100 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse100) v_arrayElimCell_47) (+ 4 v_arrayElimCell_46))))) v_prenex_14) (+ 4 v_arrayElimCell_58)) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0)))) .cse16 (or (and (or (and .cse48 .cse49 .cse54) .cse0) .cse51 .cse50 .cse52 .cse53) .cse2) (or .cse5 (forall ((v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (let ((.cse101 (let ((.cse103 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse103 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse103) v_arrayElimCell_55) (+ 4 v_arrayElimCell_46))))) (.cse102 (+ 4 v_arrayElimCell_58))) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse101) v_arrayElimCell_55) .cse102) 0) (= (select .cse101 .cse102) 0))))) .cse17 .cse18 .cse19 (or (forall ((v_ArrVal_664 Int) (v_arrayElimCell_58 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (let ((.cse106 (let ((.cse107 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse107 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse107) v_arrayElimCell_55) (+ 4 v_arrayElimCell_46)))))) (let ((.cse104 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse106) v_arrayElimCell_55)) (.cse105 (+ 4 v_arrayElimCell_58))) (or (= (select .cse104 (+ v_ArrVal_664 4)) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_arrayElimCell_58 0) (= (select .cse104 .cse105) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664) (= (select .cse106 .cse105) 0))))) .cse5) .cse20 .cse21) .cse4) (or (let ((.cse180 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_20 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse185 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse185 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse185) |c_ULTIMATE.start_append_~item~0#1.base|) .cse11)))) v_prenex_20) .cse11) 0))))))) (.cse181 (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_ArrVal_664 Int)) (or (forall ((v_prenex_20 Int)) (let ((.cse183 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse184 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse184 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse184) |c_ULTIMATE.start_append_~item~0#1.base|) .cse11)))) v_prenex_20))) (or (= (select .cse183 (+ v_ArrVal_664 4)) 0) (= (select .cse183 .cse11) 0)))) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664))))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))))) (let ((.cse119 (or .cse5 (forall ((v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse182 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse182 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse182) |c_ULTIMATE.start_append_~item~0#1.base|) .cse11)))) v_prenex_18) .cse11) 0))))) (.cse120 (or .cse32 .cse33 (and .cse180 .cse181) .cse34))) (and (or .cse0 (and (or (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_19 Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse108 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse108 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse108) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46))))) v_prenex_19) .cse11) 0))) .cse5 .cse4) (or .cse29 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_22 Int) (v_arrayElimCell_46 Int)) (let ((.cse109 (let ((.cse110 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse110 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse110) v_prenex_22) (+ 4 v_arrayElimCell_46)))))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse109) v_prenex_22) .cse11) 0) (= (select .cse109 .cse11) 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_16 Int) (v_arrayElimCell_46 Int) (v_prenex_21 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse111 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse111 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse111) v_prenex_21) (+ 4 v_arrayElimCell_46))))) v_prenex_16) .cse11) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_ArrVal_664 Int)) (or (forall ((v_prenex_22 Int) (v_arrayElimCell_46 Int)) (let ((.cse112 (let ((.cse115 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse115 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse115) v_prenex_22) (+ 4 v_arrayElimCell_46)))))) (let ((.cse114 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse112) v_prenex_22)) (.cse113 (+ v_ArrVal_664 4))) (or (= (select .cse112 .cse113) 0) (= (select .cse114 .cse11) 0) (= (select .cse114 .cse113) 0) (= (select .cse112 .cse11) 0))))) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_ArrVal_664 Int)) (or (forall ((v_prenex_22 Int) (v_arrayElimCell_46 Int)) (let ((.cse117 (let ((.cse118 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse118 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse118) v_prenex_22) (+ 4 v_arrayElimCell_46)))))) (let ((.cse116 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse117) v_prenex_22))) (or (= (select .cse116 .cse11) 0) (= (select .cse116 (+ v_ArrVal_664 4)) 0) (= (select .cse117 .cse11) 0))))) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664))))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))))) .cse119 .cse120 (or .cse29 (forall ((v_prenex_17 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse121 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse121 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse121) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46))))) v_prenex_17) .cse11) 0)))))) (or .cse5 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse122 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse122 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse122) |c_ULTIMATE.start_append_~item~0#1.base|) .cse11)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse11) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or .cse0 (let ((.cse125 (forall ((v_ArrVal_664 Int) (v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse141 (let ((.cse144 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse144 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse144) v_prenex_22) .cse11))))) (let ((.cse142 (+ v_ArrVal_664 4)) (.cse143 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse141) v_prenex_22))) (or (= (select .cse141 .cse11) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= 0 (select .cse141 .cse142)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse143 .cse142) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664) (= (select .cse143 .cse11) 0))))))) (and (or (forall ((v_ArrVal_664 Int) (v_prenex_15 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (let ((.cse123 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse123 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse123) v_prenex_15) .cse11))) (+ v_ArrVal_664 4)) 0) (< v_ArrVal_664 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664))) .cse2) (or .cse124 .cse5 .cse125) (or .cse29 (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse126 (let ((.cse127 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse127 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse127) v_prenex_22) .cse11))))) (or (= (select .cse126 .cse11) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse126) v_prenex_22) .cse11) 0))))) (or .cse5 .cse128 .cse125) (or .cse29 (forall ((v_ArrVal_664 Int) (v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse129 (let ((.cse131 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse131 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse131) v_prenex_22) .cse11))))) (let ((.cse130 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse129) v_prenex_22))) (or (= (select .cse129 .cse11) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select .cse130 (+ v_ArrVal_664 4)) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664) (= (select .cse130 .cse11) 0)))))) (or (forall ((v_ArrVal_664 Int) (v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse132 (let ((.cse134 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse134 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse134) v_prenex_22) .cse11))))) (let ((.cse133 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse132) v_prenex_22))) (or (= (select .cse132 .cse11) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_ArrVal_664 0) (= (select .cse133 (+ v_ArrVal_664 4)) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664) (= (select .cse133 .cse11) 0))))) .cse2) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_prenex_19 Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse135 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse135 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse135) |c_ULTIMATE.start_append_~item~0#1.base|) .cse11)))) v_prenex_19) .cse11) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse5 .cse4) .cse119 (or .cse29 (forall ((v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse136 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse136 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse136) |c_ULTIMATE.start_append_~item~0#1.base|) .cse11)))) v_prenex_17) .cse11) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or (forall ((v_ArrVal_664 Int) (v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (let ((.cse137 (let ((.cse139 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse139 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse139) v_prenex_22) .cse11)))) (.cse138 (+ v_ArrVal_664 4))) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= 0 (select .cse137 .cse138)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_ArrVal_664 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse137) v_prenex_22) .cse138) 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664)))) .cse2) (or (forall ((v_prenex_16 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (v_prenex_21 Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse140 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse140 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse140) v_prenex_21) .cse11)))) v_prenex_16) .cse11) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse29) .cse120))) (or (and (or .cse5 .cse4) .cse145 .cse146) (forall ((v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse147 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse147 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse147) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_46))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse11) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) (or .cse29 (forall ((v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse148 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse148 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse148) v_prenex_23) .cse11)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse11) 0)))) (or .cse5 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_55 Int)) (let ((.cse149 (let ((.cse150 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse150 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse150) v_arrayElimCell_55) (+ 4 v_arrayElimCell_46)))))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse149) v_arrayElimCell_55) .cse11) 0) (= (select .cse149 .cse11) 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_prenex_13 Int) (v_arrayElimCell_46 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse151 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse151 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse151) v_prenex_13) (+ 4 v_arrayElimCell_46))))) v_prenex_13) .cse11) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_14 Int) (v_arrayElimCell_47 Int) (v_arrayElimCell_46 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse152 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse152 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse152) v_arrayElimCell_47) (+ 4 v_arrayElimCell_46))))) v_prenex_14) .cse11) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (forall ((v_ArrVal_664 Int)) (or (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664) (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_55 Int)) (let ((.cse154 (let ((.cse155 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse155 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse155) v_arrayElimCell_55) (+ 4 v_arrayElimCell_46)))))) (let ((.cse153 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse154) v_arrayElimCell_55))) (or (= (select .cse153 (+ v_ArrVal_664 4)) 0) (= (select .cse153 .cse11) 0) (= (select .cse154 .cse11) 0))))))))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_ArrVal_664 Int)) (or (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664) (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_55 Int)) (let ((.cse158 (let ((.cse159 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse159 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse159) v_arrayElimCell_55) (+ 4 v_arrayElimCell_46)))))) (let ((.cse157 (+ v_ArrVal_664 4)) (.cse156 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse158) v_arrayElimCell_55))) (or (= (select .cse156 .cse157) 0) (= (select .cse158 .cse157) 0) (= (select .cse156 .cse11) 0) (= (select .cse158 .cse11) 0))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))))) .cse4) (or (and (or (forall ((v_prenex_13 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse160 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse160 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse160) v_prenex_13) .cse11)))) v_prenex_13) .cse11) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse5) (or .cse5 (forall ((v_ArrVal_664 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (let ((.cse163 (let ((.cse164 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse164 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse164) v_arrayElimCell_55) .cse11))))) (let ((.cse162 (+ v_ArrVal_664 4)) (.cse161 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse163) v_arrayElimCell_55))) (or (= (select .cse161 .cse162) 0) (= (select .cse163 .cse162) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse163 .cse11) 0) (= (select .cse161 .cse11) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664)))))) (or (forall ((v_ArrVal_664 Int) (v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_ArrVal_664 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664) (= (select (let ((.cse165 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse165 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse165) v_prenex_12) .cse11))) (+ v_ArrVal_664 4)) 0))) .cse2) (or (forall ((v_ArrVal_664 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (let ((.cse167 (let ((.cse168 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse168 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse168) v_arrayElimCell_55) .cse11))))) (let ((.cse166 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse167) v_arrayElimCell_55))) (or (= (select .cse166 (+ v_ArrVal_664 4)) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse167 .cse11) 0) (= (select .cse166 .cse11) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_ArrVal_664 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664))))) .cse2) (or (forall ((v_ArrVal_664 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (let ((.cse169 (let ((.cse171 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse171 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse171) v_arrayElimCell_55) .cse11)))) (.cse170 (+ v_ArrVal_664 4))) (or (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse169) v_arrayElimCell_55) .cse170) 0) (= (select .cse169 .cse170) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< v_ArrVal_664 0) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664)))) .cse2) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (let ((.cse172 (let ((.cse173 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse173 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse173) v_arrayElimCell_55) .cse11))))) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse172 .cse11) 0) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse172) v_arrayElimCell_55) .cse11) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0))))) .cse5) (or (forall ((v_prenex_14 Int) (v_arrayElimCell_47 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse174 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse174 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse174) v_arrayElimCell_47) .cse11)))) v_prenex_14) .cse11) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) .cse5) (or (forall ((v_ArrVal_664 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int) (v_arrayElimCell_55 Int)) (let ((.cse176 (let ((.cse177 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse177 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse177) v_arrayElimCell_55) .cse11))))) (let ((.cse175 (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse176) v_arrayElimCell_55))) (or (= (select .cse175 (+ v_ArrVal_664 4)) 0) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (= (select .cse176 .cse11) 0) (= (select .cse175 .cse11) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (< |v_ULTIMATE.start_append_~item~0#1.offset_23| v_ArrVal_664))))) .cse5)) .cse4) (or .cse29 (forall ((v_prenex_23 Int) (v_arrayElimCell_46 Int) (|v_ULTIMATE.start_append_~item~0#1.base_28| Int) (|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse178 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| v_arrayElimCell_46))) (store .cse178 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse178) v_prenex_23) (+ 4 v_arrayElimCell_46))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse11) 0)))) (or .cse32 .cse33 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.offset_23| Int)) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_28| Int)) (or (forall ((v_prenex_18 Int)) (= (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| (let ((.cse179 (store (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28|) |v_ULTIMATE.start_append_~item~0#1.offset_23| |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse179 (+ |v_ULTIMATE.start_append_~item~0#1.offset_23| 4) (select (select (store |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_append_~item~0#1.base_28| .cse179) |c_ULTIMATE.start_append_~item~0#1.base|) .cse11)))) v_prenex_18) .cse11) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_28|) 0)))) (< 0 |v_ULTIMATE.start_append_~item~0#1.offset_23|))) .cse180 .cse181) .cse0 .cse34)))) (< |c_ULTIMATE.start_append_~item~0#1.offset| 0))))))) is different from true