./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-3.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 01db24b1589b54f78ea9acc56548e9023dc94ca9b67a9629bccf00110df292f7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:57:24,390 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:57:24,450 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 17:57:24,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:57:24,455 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:57:24,476 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:57:24,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:57:24,477 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:57:24,477 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:57:24,478 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:57:24,478 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:57:24,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:57:24,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:57:24,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:57:24,480 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:57:24,480 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:57:24,481 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:57:24,481 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:57:24,481 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:57:24,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:57:24,482 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:57:24,486 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:57:24,487 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:57:24,487 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:57:24,487 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:57:24,487 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:57:24,488 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:57:24,488 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:57:24,488 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:57:24,488 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:57:24,489 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:57:24,489 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:57:24,489 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:57:24,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:57:24,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:57:24,490 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:57:24,490 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:57:24,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:57:24,491 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:57:24,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:57:24,491 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:57:24,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:57:24,492 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-clean/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-clean/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 -> 01db24b1589b54f78ea9acc56548e9023dc94ca9b67a9629bccf00110df292f7 [2024-10-11 17:57:24,797 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:57:24,822 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:57:24,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:57:24,827 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:57:24,827 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:57:24,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-3.i [2024-10-11 17:57:26,286 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:57:26,528 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:57:26,529 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-3.i [2024-10-11 17:57:26,545 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9e87a0081/b47d5e079ce042fb9defacda9d8d30b8/FLAG875ff907b [2024-10-11 17:57:26,558 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/9e87a0081/b47d5e079ce042fb9defacda9d8d30b8 [2024-10-11 17:57:26,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:57:26,562 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:57:26,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:57:26,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:57:26,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:57:26,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:57:26" (1/1) ... [2024-10-11 17:57:26,572 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d4ac65b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:26, skipping insertion in model container [2024-10-11 17:57:26,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:57:26" (1/1) ... [2024-10-11 17:57:26,606 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:57:26,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:57:26,964 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:57:27,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:57:27,043 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:57:27,043 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:27 WrapperNode [2024-10-11 17:57:27,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:57:27,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:57:27,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:57:27,046 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:57:27,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:27" (1/1) ... [2024-10-11 17:57:27,071 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:27" (1/1) ... [2024-10-11 17:57:27,101 INFO L138 Inliner]: procedures = 126, calls = 38, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2024-10-11 17:57:27,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:57:27,102 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:57:27,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:57:27,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:57:27,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:27" (1/1) ... [2024-10-11 17:57:27,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:27" (1/1) ... [2024-10-11 17:57:27,117 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:27" (1/1) ... [2024-10-11 17:57:27,147 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 9, 13]. 54 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 2, 3]. [2024-10-11 17:57:27,148 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:27" (1/1) ... [2024-10-11 17:57:27,148 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:27" (1/1) ... [2024-10-11 17:57:27,160 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:27" (1/1) ... [2024-10-11 17:57:27,163 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:27" (1/1) ... [2024-10-11 17:57:27,165 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:27" (1/1) ... [2024-10-11 17:57:27,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:27" (1/1) ... [2024-10-11 17:57:27,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:57:27,170 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:57:27,170 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:57:27,170 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:57:27,171 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:27" (1/1) ... [2024-10-11 17:57:27,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:57:27,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:57:27,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:57:27,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:57:27,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:57:27,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:57:27,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:57:27,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 17:57:27,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 17:57:27,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 17:57:27,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 17:57:27,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 17:57:27,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 17:57:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:57:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 17:57:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 17:57:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 17:57:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 17:57:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 17:57:27,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 17:57:27,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:57:27,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:57:27,420 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:57:27,421 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:57:27,727 INFO L? ?]: Removed 116 outVars from TransFormulas that were not future-live. [2024-10-11 17:57:27,727 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:57:27,790 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:57:27,790 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 17:57:27,790 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:57:27 BoogieIcfgContainer [2024-10-11 17:57:27,791 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:57:27,793 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:57:27,794 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:57:27,797 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:57:27,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:57:26" (1/3) ... [2024-10-11 17:57:27,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314412ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:57:27, skipping insertion in model container [2024-10-11 17:57:27,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:57:27" (2/3) ... [2024-10-11 17:57:27,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@314412ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:57:27, skipping insertion in model container [2024-10-11 17:57:27,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:57:27" (3/3) ... [2024-10-11 17:57:27,801 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0232-3.i [2024-10-11 17:57:27,819 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:57:27,820 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2024-10-11 17:57:27,876 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:57:27,886 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;@7d7486c9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:57:27,887 INFO L334 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2024-10-11 17:57:27,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 97 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:27,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 17:57:27,900 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:27,900 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 17:57:27,902 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-11 17:57:27,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:27,909 INFO L85 PathProgramCache]: Analyzing trace with hash 177979, now seen corresponding path program 1 times [2024-10-11 17:57:27,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:27,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886514554] [2024-10-11 17:57:27,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:27,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:28,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:28,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:28,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:28,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886514554] [2024-10-11 17:57:28,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886514554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:28,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:28,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:57:28,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629023641] [2024-10-11 17:57:28,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:28,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:57:28,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:28,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:57:28,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:28,263 INFO L87 Difference]: Start difference. First operand has 98 states, 42 states have (on average 2.4761904761904763) internal successors, (104), 97 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:28,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:28,478 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2024-10-11 17:57:28,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:57:28,480 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 17:57:28,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:28,488 INFO L225 Difference]: With dead ends: 91 [2024-10-11 17:57:28,488 INFO L226 Difference]: Without dead ends: 90 [2024-10-11 17:57:28,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:28,493 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 84 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:28,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 74 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:28,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-11 17:57:28,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-10-11 17:57:28,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 89 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:28,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 95 transitions. [2024-10-11 17:57:28,533 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 95 transitions. Word has length 3 [2024-10-11 17:57:28,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:28,534 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 95 transitions. [2024-10-11 17:57:28,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:28,534 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 95 transitions. [2024-10-11 17:57:28,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 17:57:28,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:28,535 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 17:57:28,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:57:28,535 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-11 17:57:28,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:28,537 INFO L85 PathProgramCache]: Analyzing trace with hash 177980, now seen corresponding path program 1 times [2024-10-11 17:57:28,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:28,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905969513] [2024-10-11 17:57:28,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:28,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:28,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:28,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:28,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905969513] [2024-10-11 17:57:28,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905969513] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:28,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:28,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:57:28,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750395579] [2024-10-11 17:57:28,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:28,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:57:28,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:28,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:57:28,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:28,794 INFO L87 Difference]: Start difference. First operand 90 states and 95 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:29,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:29,032 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2024-10-11 17:57:29,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:57:29,032 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-11 17:57:29,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:29,033 INFO L225 Difference]: With dead ends: 110 [2024-10-11 17:57:29,034 INFO L226 Difference]: Without dead ends: 110 [2024-10-11 17:57:29,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:29,036 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 77 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:29,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 87 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:29,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-11 17:57:29,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 92. [2024-10-11 17:57:29,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 50 states have (on average 2.02) internal successors, (101), 91 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:29,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2024-10-11 17:57:29,050 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 3 [2024-10-11 17:57:29,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:29,051 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2024-10-11 17:57:29,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:29,051 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2024-10-11 17:57:29,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 17:57:29,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:29,053 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 17:57:29,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:57:29,054 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-11 17:57:29,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:29,054 INFO L85 PathProgramCache]: Analyzing trace with hash 5517329, now seen corresponding path program 1 times [2024-10-11 17:57:29,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:29,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272323339] [2024-10-11 17:57:29,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:29,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:29,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:29,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:29,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:29,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272323339] [2024-10-11 17:57:29,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272323339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:29,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:29,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:57:29,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699347536] [2024-10-11 17:57:29,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:29,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:57:29,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:29,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:57:29,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:57:29,130 INFO L87 Difference]: Start difference. First operand 92 states and 101 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:29,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:29,212 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2024-10-11 17:57:29,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:57:29,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 17:57:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:29,214 INFO L225 Difference]: With dead ends: 88 [2024-10-11 17:57:29,215 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 17:57:29,215 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:57:29,216 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 8 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:29,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 101 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:29,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 17:57:29,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-11 17:57:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 50 states have (on average 1.94) internal successors, (97), 87 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2024-10-11 17:57:29,231 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 4 [2024-10-11 17:57:29,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:29,232 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2024-10-11 17:57:29,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:29,232 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2024-10-11 17:57:29,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 17:57:29,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:29,234 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 17:57:29,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:57:29,234 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-11 17:57:29,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:29,235 INFO L85 PathProgramCache]: Analyzing trace with hash 5517330, now seen corresponding path program 1 times [2024-10-11 17:57:29,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:29,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966542639] [2024-10-11 17:57:29,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:29,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:29,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:29,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:29,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966542639] [2024-10-11 17:57:29,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966542639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:29,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:29,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:57:29,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122510637] [2024-10-11 17:57:29,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:29,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:57:29,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:29,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:57:29,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:57:29,309 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:29,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:29,379 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2024-10-11 17:57:29,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:57:29,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-10-11 17:57:29,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:29,381 INFO L225 Difference]: With dead ends: 84 [2024-10-11 17:57:29,381 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 17:57:29,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:57:29,382 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 8 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:29,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 108 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:29,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 17:57:29,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-11 17:57:29,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 50 states have (on average 1.86) internal successors, (93), 83 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:29,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2024-10-11 17:57:29,393 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 4 [2024-10-11 17:57:29,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:29,394 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2024-10-11 17:57:29,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:29,394 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2024-10-11 17:57:29,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 17:57:29,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:29,394 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:29,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:57:29,395 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-11 17:57:29,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:29,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1664017186, now seen corresponding path program 1 times [2024-10-11 17:57:29,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:29,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873375617] [2024-10-11 17:57:29,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:29,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:29,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-10-11 17:57:29,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:29,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873375617] [2024-10-11 17:57:29,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873375617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:29,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:29,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:57:29,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461158139] [2024-10-11 17:57:29,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:29,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:57:29,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:29,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:57:29,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:57:29,631 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:29,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:29,835 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2024-10-11 17:57:29,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:57:29,835 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-11 17:57:29,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:29,836 INFO L225 Difference]: With dead ends: 91 [2024-10-11 17:57:29,836 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 17:57:29,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:57:29,838 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 13 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:29,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 375 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:29,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 17:57:29,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2024-10-11 17:57:29,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 55 states have (on average 1.7818181818181817) internal successors, (98), 88 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2024-10-11 17:57:29,844 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 8 [2024-10-11 17:57:29,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:29,845 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2024-10-11 17:57:29,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:29,845 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2024-10-11 17:57:29,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 17:57:29,846 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:29,846 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:29,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:57:29,847 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-11 17:57:29,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:29,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1645649802, now seen corresponding path program 1 times [2024-10-11 17:57:29,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:29,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577663558] [2024-10-11 17:57:29,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:29,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:29,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:30,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:30,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:30,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577663558] [2024-10-11 17:57:30,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577663558] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:30,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:30,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:57:30,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254005596] [2024-10-11 17:57:30,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:30,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:57:30,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:30,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:57:30,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:30,040 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:30,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:30,219 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2024-10-11 17:57:30,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:57:30,223 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 17:57:30,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:30,225 INFO L225 Difference]: With dead ends: 108 [2024-10-11 17:57:30,225 INFO L226 Difference]: Without dead ends: 108 [2024-10-11 17:57:30,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:57:30,227 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 55 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:30,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 156 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:30,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-11 17:57:30,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 88. [2024-10-11 17:57:30,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 55 states have (on average 1.7636363636363637) internal successors, (97), 87 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:30,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2024-10-11 17:57:30,232 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 13 [2024-10-11 17:57:30,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:30,233 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2024-10-11 17:57:30,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:30,236 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2024-10-11 17:57:30,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 17:57:30,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:30,236 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:30,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:57:30,237 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-11 17:57:30,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:30,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1645649803, now seen corresponding path program 1 times [2024-10-11 17:57:30,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:30,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807926253] [2024-10-11 17:57:30,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:30,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:30,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:30,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:30,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807926253] [2024-10-11 17:57:30,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807926253] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:30,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:30,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:57:30,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551941484] [2024-10-11 17:57:30,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:30,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:57:30,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:30,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:57:30,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:30,512 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:30,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:30,664 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2024-10-11 17:57:30,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:57:30,664 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-11 17:57:30,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:30,665 INFO L225 Difference]: With dead ends: 109 [2024-10-11 17:57:30,665 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 17:57:30,666 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-10-11 17:57:30,667 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 69 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:30,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 135 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:30,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 17:57:30,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2024-10-11 17:57:30,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 86 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-10-11 17:57:30,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2024-10-11 17:57:30,677 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 13 [2024-10-11 17:57:30,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:30,678 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2024-10-11 17:57:30,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:30,678 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2024-10-11 17:57:30,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:57:30,678 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:30,679 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:30,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:57:30,679 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-11 17:57:30,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:30,680 INFO L85 PathProgramCache]: Analyzing trace with hash 921589038, now seen corresponding path program 1 times [2024-10-11 17:57:30,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:30,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214959357] [2024-10-11 17:57:30,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:30,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:30,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:30,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:30,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214959357] [2024-10-11 17:57:30,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214959357] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:30,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:30,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:57:30,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272418610] [2024-10-11 17:57:30,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:30,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:57:30,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:30,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:57:30,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:30,743 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:30,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:30,846 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2024-10-11 17:57:30,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:57:30,846 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 17:57:30,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:30,847 INFO L225 Difference]: With dead ends: 86 [2024-10-11 17:57:30,847 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 17:57:30,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:30,848 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 8 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:30,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 164 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:30,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 17:57:30,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-11 17:57:30,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 55 states have (on average 1.7272727272727273) internal successors, (95), 85 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-10-11 17:57:30,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 95 transitions. [2024-10-11 17:57:30,857 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 95 transitions. Word has length 15 [2024-10-11 17:57:30,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:30,858 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 95 transitions. [2024-10-11 17:57:30,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:30,858 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 95 transitions. [2024-10-11 17:57:30,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:57:30,859 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:30,859 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:30,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:57:30,859 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-11 17:57:30,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:30,860 INFO L85 PathProgramCache]: Analyzing trace with hash 921589039, now seen corresponding path program 1 times [2024-10-11 17:57:30,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:30,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755493760] [2024-10-11 17:57:30,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:30,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:31,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:31,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:31,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755493760] [2024-10-11 17:57:31,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755493760] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:31,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:31,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:57:31,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096592542] [2024-10-11 17:57:31,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:31,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:57:31,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:31,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:57:31,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:57:31,142 INFO L87 Difference]: Start difference. First operand 86 states and 95 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:31,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:31,359 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2024-10-11 17:57:31,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:57:31,360 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 17:57:31,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:31,361 INFO L225 Difference]: With dead ends: 107 [2024-10-11 17:57:31,361 INFO L226 Difference]: Without dead ends: 107 [2024-10-11 17:57:31,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 17:57:31,362 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 61 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:31,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 221 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:31,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-11 17:57:31,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 85. [2024-10-11 17:57:31,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 55 states have (on average 1.709090909090909) internal successors, (94), 84 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:31,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2024-10-11 17:57:31,371 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 15 [2024-10-11 17:57:31,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:31,371 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2024-10-11 17:57:31,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:31,371 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2024-10-11 17:57:31,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:57:31,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:31,372 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:31,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:57:31,372 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-11 17:57:31,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:31,376 INFO L85 PathProgramCache]: Analyzing trace with hash 954068591, now seen corresponding path program 1 times [2024-10-11 17:57:31,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:31,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839933339] [2024-10-11 17:57:31,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:31,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:31,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:31,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:31,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839933339] [2024-10-11 17:57:31,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839933339] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:31,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:31,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:57:31,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639883567] [2024-10-11 17:57:31,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:31,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:57:31,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:31,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:57:31,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:31,501 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:31,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:31,597 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-10-11 17:57:31,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:57:31,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 17:57:31,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:31,598 INFO L225 Difference]: With dead ends: 80 [2024-10-11 17:57:31,598 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 17:57:31,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:57:31,599 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 36 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:31,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 170 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:31,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 17:57:31,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2024-10-11 17:57:31,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:31,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-10-11 17:57:31,603 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 15 [2024-10-11 17:57:31,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:31,603 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-10-11 17:57:31,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:31,604 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-10-11 17:57:31,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:57:31,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:31,604 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:31,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:57:31,605 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-11 17:57:31,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:31,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1495510857, now seen corresponding path program 1 times [2024-10-11 17:57:31,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:31,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795155550] [2024-10-11 17:57:31,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:31,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:31,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:31,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:31,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795155550] [2024-10-11 17:57:31,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795155550] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:31,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:31,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:57:31,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640524561] [2024-10-11 17:57:31,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:31,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:57:31,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:31,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:57:31,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:57:31,999 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:32,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:32,241 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2024-10-11 17:57:32,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:57:32,242 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 17:57:32,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:32,243 INFO L225 Difference]: With dead ends: 112 [2024-10-11 17:57:32,243 INFO L226 Difference]: Without dead ends: 112 [2024-10-11 17:57:32,243 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-11 17:57:32,244 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 36 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:32,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 313 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:32,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-11 17:57:32,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 88. [2024-10-11 17:57:32,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.603448275862069) internal successors, (93), 87 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:32,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2024-10-11 17:57:32,252 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 16 [2024-10-11 17:57:32,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:32,252 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2024-10-11 17:57:32,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:32,252 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2024-10-11 17:57:32,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:57:32,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:32,253 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:32,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:57:32,254 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-11 17:57:32,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:32,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1217307736, now seen corresponding path program 1 times [2024-10-11 17:57:32,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:32,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801496369] [2024-10-11 17:57:32,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:32,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:32,583 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:32,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:32,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801496369] [2024-10-11 17:57:32,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801496369] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:57:32,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716331305] [2024-10-11 17:57:32,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:32,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:32,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:57:32,587 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:57:32,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:57:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:32,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-11 17:57:32,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:57:32,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 17:57:32,872 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-10-11 17:57:32,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-10-11 17:57:32,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 17:57:32,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 17:57:32,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 17:57:32,979 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:32,979 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:57:33,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-10-11 17:57:33,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:57:33,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 135 treesize of output 339 [2024-10-11 17:57:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:34,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716331305] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:57:34,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:57:34,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-10-11 17:57:34,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166355195] [2024-10-11 17:57:34,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:57:34,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 17:57:34,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:34,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 17:57:34,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-10-11 17:57:34,127 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:34,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:34,498 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2024-10-11 17:57:34,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:57:34,499 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 17:57:34,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:34,500 INFO L225 Difference]: With dead ends: 89 [2024-10-11 17:57:34,500 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 17:57:34,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 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-10-11 17:57:34,501 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 80 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:34,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 294 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 17:57:34,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 17:57:34,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2024-10-11 17:57:34,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 58 states have (on average 1.5862068965517242) internal successors, (92), 86 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:34,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-10-11 17:57:34,503 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 16 [2024-10-11 17:57:34,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:34,504 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-10-11 17:57:34,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 16 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:34,504 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-10-11 17:57:34,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 17:57:34,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:34,504 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:34,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:57:34,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 17:57:34,706 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-11 17:57:34,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:34,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1217307737, now seen corresponding path program 1 times [2024-10-11 17:57:34,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:34,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807182328] [2024-10-11 17:57:34,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:34,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:34,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:35,053 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:35,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:35,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807182328] [2024-10-11 17:57:35,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807182328] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:57:35,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241795986] [2024-10-11 17:57:35,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:35,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:35,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:57:35,056 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:57:35,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:57:35,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:35,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-11 17:57:35,200 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:57:35,222 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-10-11 17:57:35,237 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-10-11 17:57:35,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 17:57:35,283 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-10-11 17:57:35,290 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 17:57:35,290 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-10-11 17:57:35,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:57:35,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 17:57:35,362 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 17:57:35,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-11 17:57:35,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-11 17:57:35,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 17:57:35,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 17:57:35,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:57:35,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-10-11 17:57:35,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-11 17:57:35,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:35,472 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:57:35,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-10-11 17:57:35,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2024-10-11 17:57:35,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2024-10-11 17:57:35,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:57:35,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 134 [2024-10-11 17:57:36,128 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:36,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241795986] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:57:36,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:57:36,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2024-10-11 17:57:36,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77869833] [2024-10-11 17:57:36,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:57:36,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 17:57:36,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:36,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 17:57:36,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2024-10-11 17:57:36,130 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:36,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:36,703 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2024-10-11 17:57:36,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:57:36,704 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 17:57:36,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:36,705 INFO L225 Difference]: With dead ends: 88 [2024-10-11 17:57:36,705 INFO L226 Difference]: Without dead ends: 88 [2024-10-11 17:57:36,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 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-10-11 17:57:36,706 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 52 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:36,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 482 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 17:57:36,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-11 17:57:36,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2024-10-11 17:57:36,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 58 states have (on average 1.5689655172413792) internal successors, (91), 85 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:36,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2024-10-11 17:57:36,708 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 16 [2024-10-11 17:57:36,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:36,709 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2024-10-11 17:57:36,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:36,709 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2024-10-11 17:57:36,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 17:57:36,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:36,710 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:36,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 17:57:36,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:36,914 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-11 17:57:36,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:36,914 INFO L85 PathProgramCache]: Analyzing trace with hash 883803790, now seen corresponding path program 1 times [2024-10-11 17:57:36,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:36,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684572249] [2024-10-11 17:57:36,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:36,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:36,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:37,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:37,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:37,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684572249] [2024-10-11 17:57:37,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684572249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:37,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:37,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:57:37,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455911486] [2024-10-11 17:57:37,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:37,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:57:37,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:37,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:57:37,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:57:37,154 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:37,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:37,410 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2024-10-11 17:57:37,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:57:37,410 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 17:57:37,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:37,411 INFO L225 Difference]: With dead ends: 107 [2024-10-11 17:57:37,411 INFO L226 Difference]: Without dead ends: 107 [2024-10-11 17:57:37,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-11 17:57:37,412 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 30 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:37,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 187 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:37,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-11 17:57:37,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 87. [2024-10-11 17:57:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 86 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:37,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-10-11 17:57:37,415 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 17 [2024-10-11 17:57:37,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:37,415 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-10-11 17:57:37,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:37,415 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-10-11 17:57:37,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 17:57:37,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:37,416 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:37,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:57:37,416 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-11 17:57:37,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:37,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1628113817, now seen corresponding path program 1 times [2024-10-11 17:57:37,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:37,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399685942] [2024-10-11 17:57:37,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:37,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:37,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:37,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:37,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399685942] [2024-10-11 17:57:37,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399685942] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:37,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:37,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:57:37,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523226310] [2024-10-11 17:57:37,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:37,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:57:37,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:37,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:57:37,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:57:37,642 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:37,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:37,911 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2024-10-11 17:57:37,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 17:57:37,912 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-11 17:57:37,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:37,913 INFO L225 Difference]: With dead ends: 98 [2024-10-11 17:57:37,913 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 17:57:37,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-11 17:57:37,914 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 18 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:37,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 229 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:37,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 17:57:37,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 88. [2024-10-11 17:57:37,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.55) internal successors, (93), 87 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:37,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2024-10-11 17:57:37,917 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 18 [2024-10-11 17:57:37,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:37,917 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2024-10-11 17:57:37,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:37,918 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2024-10-11 17:57:37,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 17:57:37,918 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:37,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:37,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:57:37,919 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-11 17:57:37,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:37,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1068079119, now seen corresponding path program 1 times [2024-10-11 17:57:37,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:37,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012941177] [2024-10-11 17:57:37,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:37,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:38,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:38,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:38,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012941177] [2024-10-11 17:57:38,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012941177] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:38,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:38,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 17:57:38,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327897233] [2024-10-11 17:57:38,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:38,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:57:38,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:38,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:57:38,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:57:38,070 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:38,228 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-10-11 17:57:38,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:57:38,229 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 17:57:38,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:38,229 INFO L225 Difference]: With dead ends: 87 [2024-10-11 17:57:38,230 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 17:57:38,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 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-10-11 17:57:38,230 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 131 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:38,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 56 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:38,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 17:57:38,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-11 17:57:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.5333333333333334) internal successors, (92), 86 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2024-10-11 17:57:38,233 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 19 [2024-10-11 17:57:38,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:38,233 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2024-10-11 17:57:38,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:38,234 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2024-10-11 17:57:38,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-11 17:57:38,234 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:38,234 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:38,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:57:38,234 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-11 17:57:38,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:38,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1068079118, now seen corresponding path program 1 times [2024-10-11 17:57:38,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:38,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033508679] [2024-10-11 17:57:38,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:38,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:38,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:38,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:38,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033508679] [2024-10-11 17:57:38,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033508679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:38,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:38,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:57:38,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872187471] [2024-10-11 17:57:38,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:38,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:57:38,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:38,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:57:38,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:38,294 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:38,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:38,341 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2024-10-11 17:57:38,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:57:38,342 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-11 17:57:38,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:38,342 INFO L225 Difference]: With dead ends: 80 [2024-10-11 17:57:38,342 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 17:57:38,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:57:38,343 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 93 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:38,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 36 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:57:38,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 17:57:38,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-11 17:57:38,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 60 states have (on average 1.4) internal successors, (84), 79 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-10-11 17:57:38,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2024-10-11 17:57:38,345 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 19 [2024-10-11 17:57:38,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:38,346 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2024-10-11 17:57:38,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:38,346 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2024-10-11 17:57:38,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 17:57:38,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:38,346 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:38,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:57:38,347 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-11 17:57:38,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:38,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1249285725, now seen corresponding path program 1 times [2024-10-11 17:57:38,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:38,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674490902] [2024-10-11 17:57:38,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:38,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:38,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:38,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674490902] [2024-10-11 17:57:38,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674490902] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:38,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:38,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:57:38,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838058636] [2024-10-11 17:57:38,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:38,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:57:38,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:38,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:57:38,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:38,437 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:38,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:38,505 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2024-10-11 17:57:38,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:57:38,505 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-11 17:57:38,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:38,506 INFO L225 Difference]: With dead ends: 79 [2024-10-11 17:57:38,506 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 17:57:38,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:57:38,507 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 22 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:38,507 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 147 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:38,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 17:57:38,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-10-11 17:57:38,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 60 states have (on average 1.3833333333333333) internal successors, (83), 78 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:38,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 83 transitions. [2024-10-11 17:57:38,509 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 83 transitions. Word has length 20 [2024-10-11 17:57:38,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:38,509 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 83 transitions. [2024-10-11 17:57:38,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:38,510 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 83 transitions. [2024-10-11 17:57:38,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 17:57:38,510 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:38,510 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:38,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:57:38,510 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-11 17:57:38,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:38,511 INFO L85 PathProgramCache]: Analyzing trace with hash 73151921, now seen corresponding path program 1 times [2024-10-11 17:57:38,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:38,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818202345] [2024-10-11 17:57:38,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:38,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:38,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:38,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818202345] [2024-10-11 17:57:38,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818202345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:38,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:38,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:57:38,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315204120] [2024-10-11 17:57:38,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:38,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:57:38,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:38,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:57:38,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:57:38,610 INFO L87 Difference]: Start difference. First operand 79 states and 83 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:38,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:38,694 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2024-10-11 17:57:38,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:57:38,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-11 17:57:38,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:38,695 INFO L225 Difference]: With dead ends: 78 [2024-10-11 17:57:38,695 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 17:57:38,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:57:38,696 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 22 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:38,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 118 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:38,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 17:57:38,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 17:57:38,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 77 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:38,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2024-10-11 17:57:38,698 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 21 [2024-10-11 17:57:38,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:38,699 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2024-10-11 17:57:38,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:38,699 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2024-10-11 17:57:38,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 17:57:38,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:38,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:38,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:57:38,700 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-11 17:57:38,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:38,701 INFO L85 PathProgramCache]: Analyzing trace with hash -2027257633, now seen corresponding path program 1 times [2024-10-11 17:57:38,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:38,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222485469] [2024-10-11 17:57:38,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:38,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:38,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:39,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:39,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:39,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222485469] [2024-10-11 17:57:39,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222485469] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:39,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:39,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 17:57:39,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815624340] [2024-10-11 17:57:39,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:39,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 17:57:39,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:39,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 17:57:39,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-11 17:57:39,118 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:39,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:39,477 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2024-10-11 17:57:39,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 17:57:39,477 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-11 17:57:39,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:39,478 INFO L225 Difference]: With dead ends: 94 [2024-10-11 17:57:39,478 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 17:57:39,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2024-10-11 17:57:39,479 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 44 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:39,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 184 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:57:39,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 17:57:39,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2024-10-11 17:57:39,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 64 states have (on average 1.34375) internal successors, (86), 81 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:39,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2024-10-11 17:57:39,482 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 22 [2024-10-11 17:57:39,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:39,483 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2024-10-11 17:57:39,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.2) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:39,483 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2024-10-11 17:57:39,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 17:57:39,484 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:39,484 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:39,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:57:39,484 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-11 17:57:39,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:39,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1579522932, now seen corresponding path program 1 times [2024-10-11 17:57:39,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:39,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102205446] [2024-10-11 17:57:39,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:39,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:39,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:39,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:39,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102205446] [2024-10-11 17:57:39,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102205446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:57:39,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:57:39,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:57:39,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935971159] [2024-10-11 17:57:39,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:57:39,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:57:39,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:57:39,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:57:39,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:57:39,659 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:39,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:57:39,771 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2024-10-11 17:57:39,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:57:39,772 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-11 17:57:39,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:57:39,772 INFO L225 Difference]: With dead ends: 81 [2024-10-11 17:57:39,772 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 17:57:39,773 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-11 17:57:39,773 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 68 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:57:39,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 86 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:57:39,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 17:57:39,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-11 17:57:39,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 64 states have (on average 1.328125) internal successors, (85), 80 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-10-11 17:57:39,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2024-10-11 17:57:39,777 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 23 [2024-10-11 17:57:39,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:57:39,778 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2024-10-11 17:57:39,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:57:39,778 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2024-10-11 17:57:39,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 17:57:39,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:57:39,779 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:57:39,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:57:39,779 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 52 more)] === [2024-10-11 17:57:39,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:57:39,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1343592089, now seen corresponding path program 1 times [2024-10-11 17:57:39,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:57:39,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957099083] [2024-10-11 17:57:39,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:39,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:57:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:40,563 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:57:40,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:57:40,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957099083] [2024-10-11 17:57:40,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957099083] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:57:40,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688920558] [2024-10-11 17:57:40,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:57:40,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:57:40,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:57:40,566 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:57:40,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:57:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:57:40,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 73 conjuncts are in the unsatisfiable core [2024-10-11 17:57:40,707 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:57:40,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:57:40,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-11 17:57:40,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:57:40,912 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-10-11 17:57:40,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-10-11 17:57:41,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 17:57:41,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2024-10-11 17:57:41,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-11 17:57:41,338 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:57:41,344 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 17:57:41,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2024-10-11 17:57:41,434 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:57:41,435 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 68 treesize of output 41 [2024-10-11 17:57:41,439 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:57:41,440 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 34 treesize of output 22 [2024-10-11 17:57:41,635 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:57:41,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2024-10-11 17:57:41,641 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:57:41,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:57:41,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 10 [2024-10-11 17:57:41,706 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:57:41,706 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:57:45,174 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-10-11 17:57:45,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 182 treesize of output 180 [2024-10-11 17:57:45,215 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-10-11 17:57:45,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 286 treesize of output 272 [2024-10-11 17:57:45,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:57:45,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 194 [2024-10-11 17:57:45,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:57:45,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 190 treesize of output 188 [2024-10-11 17:57:45,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-11 17:57:45,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-11 17:57:45,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:57:45,360 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 315 treesize of output 329 [2024-10-11 17:57:46,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:57:46,923 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 1850 treesize of output 1822 [2024-10-11 17:57:57,772 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse17 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 1))) (let ((.cse236 (or (< |c_ULTIMATE.start_append_~plist#1.offset| 1) .cse17)) (.cse237 (or .cse17 (< |c_ULTIMATE.start_main_~#list~0#1.offset| (+ 2 |c_ULTIMATE.start_append_~plist#1.offset|))))) (let ((.cse24 (< |c_ULTIMATE.start_append_~plist#1.offset| 0)) (.cse25 (< |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|)) (.cse119 (< |c_ULTIMATE.start_main_~#list~0#1.offset| 0)) (.cse14 (and .cse236 .cse237)) (.cse33 (+ 4 |c_ULTIMATE.start_append_~item~0#1.offset|)) (.cse18 (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_append_~plist#1.base|))) (let ((.cse35 (and (or .cse17 .cse18) .cse236 .cse237)) (.cse19 (or .cse17 (forall ((v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_55 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse235 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse235 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse235) |c_ULTIMATE.start_append_~item~0#1.base|) .cse33)))) v_arrayElimCell_55) (+ v_prenex_18 4)) 0))))) (.cse21 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int) (v_prenex_21 Int) (v_arrayElimCell_44 Int) (v_arrayElimCell_55 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse234 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_21))) (store .cse234 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse234) v_arrayElimCell_44) (+ v_prenex_21 4))))) v_arrayElimCell_55) (+ v_prenex_24 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)))) .cse14)) (.cse23 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_20 Int) (v_arrayElimCell_44 Int) (v_arrayElimCell_55 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse233 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse233 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse233) v_arrayElimCell_44) .cse33)))) v_arrayElimCell_55) (+ v_prenex_20 4)) 0))) .cse14)) (.cse22 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_22 Int) (v_arrayElimCell_55 Int) (v_arrayElimCell_44 Int)) (let ((.cse223 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22)) (.cse220 (+ v_prenex_22 4))) (let ((.cse222 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse223) v_arrayElimCell_44) .cse220))) (let ((.cse219 (store .cse223 4 .cse222))) (let ((.cse221 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse219) v_arrayElimCell_55))) (or (= (select .cse219 .cse220) 0) (= (select .cse221 .cse220) 0) (= (select .cse221 4) 0) (= .cse222 0))))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_26 Int) (v_arrayElimCell_55 Int) (v_arrayElimCell_44 Int)) (= (let ((.cse225 (+ v_prenex_26 4))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse224 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_26))) (store .cse224 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse224) v_arrayElimCell_44) .cse225)))) v_arrayElimCell_55) .cse225)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_22 Int) (v_arrayElimCell_55 Int) (v_arrayElimCell_44 Int)) (let ((.cse229 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22)) (.cse227 (+ v_prenex_22 4))) (let ((.cse228 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse229) v_arrayElimCell_44) .cse227))) (let ((.cse226 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse229 4 .cse228)) v_arrayElimCell_55))) (or (= (select .cse226 .cse227) 0) (= (select .cse226 4) 0) (= .cse228 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_22 Int) (v_arrayElimCell_55 Int) (v_arrayElimCell_44 Int)) (let ((.cse231 (+ v_prenex_22 4))) (let ((.cse230 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse232 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22))) (store .cse232 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse232) v_arrayElimCell_44) .cse231)))) v_arrayElimCell_55))) (or (= (select .cse230 .cse231) 0) (= (select .cse230 4) 0))))))))) (.cse28 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_25 Int) (v_arrayElimCell_44 Int) (v_arrayElimCell_55 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse218 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_25))) (store .cse218 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse218) v_arrayElimCell_44) (+ v_prenex_25 4))))) v_arrayElimCell_55) .cse33) 0))) .cse14)) (.cse75 (forall ((v_arrayElimCell_51 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_55 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (let ((.cse217 (+ 4 v_arrayElimCell_51))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse216 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_51))) (store .cse216 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse216) v_arrayElimCell_55) .cse217)))) v_arrayElimCell_55) .cse217)) 0)))) (.cse70 (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_55 Int)) (let ((.cse213 (+ v_prenex_12 4))) (let ((.cse212 (let ((.cse215 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12))) (store .cse215 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse215) v_arrayElimCell_55) .cse213))))) (let ((.cse214 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse212) v_arrayElimCell_55))) (or (= (select .cse212 .cse213) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse214 4) 0) (= (select .cse214 .cse213) 0))))))) (.cse71 (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_55 Int)) (let ((.cse210 (+ v_prenex_12 4))) (let ((.cse209 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse211 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12))) (store .cse211 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse211) v_arrayElimCell_55) .cse210)))) v_arrayElimCell_55))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse209 4) 0) (= (select .cse209 .cse210) 0)))))) (.cse69 (or (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_55 Int)) (let ((.cse206 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12)) (.cse208 (+ v_prenex_12 4))) (let ((.cse207 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse206) v_arrayElimCell_55) .cse208))) (or (= (select (store .cse206 4 .cse207) .cse208) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse207 0))))) .cse119)) (.cse89 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_55 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse205 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse205 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse205) v_arrayElimCell_55) .cse33)))) v_arrayElimCell_55) .cse33) 0))) .cse119)) (.cse68 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_13 Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_55 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse204 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_43))) (store .cse204 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse204) v_arrayElimCell_55) (+ 4 v_arrayElimCell_43))))) v_arrayElimCell_55) (+ v_prenex_13 4)) 0)))) (.cse87 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_19 Int) (v_arrayElimCell_55 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse203 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse203 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse203) v_arrayElimCell_55) .cse33)))) v_arrayElimCell_55) (+ v_prenex_19 4)) 0)))) (.cse72 (or (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_55 Int)) (let ((.cse202 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12)) (.cse200 (+ v_prenex_12 4))) (let ((.cse201 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse202) v_arrayElimCell_55) .cse200))) (let ((.cse199 (store .cse202 4 .cse201))) (or (= (select .cse199 .cse200) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse199) v_arrayElimCell_55) 4) 0) (= .cse201 0)))))) .cse119)) (.cse73 (or (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_55 Int)) (let ((.cse197 (+ v_prenex_12 4))) (let ((.cse196 (let ((.cse198 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12))) (store .cse198 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse198) v_arrayElimCell_55) .cse197))))) (or (= (select .cse196 .cse197) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse196) v_arrayElimCell_55) .cse197) 0))))) .cse119)) (.cse74 (or .cse119 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_14 Int) (v_arrayElimCell_55 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_14)) v_arrayElimCell_55) (+ v_prenex_14 4)) 0))))) (.cse76 (or .cse14 (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_55 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (let ((.cse195 (+ v_prenex_26 4))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse194 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_26))) (store .cse194 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse194) v_arrayElimCell_55) .cse195)))) v_arrayElimCell_55) .cse195)) 0))))) (.cse77 (or (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_55 Int)) (let ((.cse191 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22)) (.cse193 (+ v_prenex_22 4))) (let ((.cse192 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse191) v_arrayElimCell_55) .cse193))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (store .cse191 4 .cse192) .cse193) 0) (= .cse192 0))))) .cse119)) (.cse78 (or .cse14 (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_55 Int)) (let ((.cse189 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22))) (let ((.cse190 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse189) v_arrayElimCell_55) (+ v_prenex_22 4)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse189 4 .cse190)) v_arrayElimCell_55) 4) 0) (= .cse190 0))))))) (.cse79 (or .cse14 (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_55 Int)) (let ((.cse187 (+ v_prenex_22 4))) (let ((.cse186 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse188 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22))) (store .cse188 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse188) v_arrayElimCell_55) .cse187)))) v_arrayElimCell_55))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse186 4) 0) (= 0 (select .cse186 .cse187)))))))) (.cse90 (or .cse119 (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_55 Int)) (let ((.cse185 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22)) (.cse183 (+ v_prenex_22 4))) (let ((.cse184 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse185) v_arrayElimCell_55) .cse183))) (let ((.cse182 (store .cse185 4 .cse184))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse182 .cse183) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse182) v_arrayElimCell_55) 4) 0) (= .cse184 0)))))))) (.cse91 (or (forall ((v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_55 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_23)) v_arrayElimCell_55) (+ v_prenex_23 4)) 0))) .cse119)) (.cse27 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_55 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse181 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse181 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse181) |c_ULTIMATE.start_append_~item~0#1.base|) .cse33)))) v_arrayElimCell_55) .cse33) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0))))) (.cse16 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_19 Int) (v_arrayElimCell_44 Int) (v_arrayElimCell_55 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse180 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse180 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse180) v_arrayElimCell_44) .cse33)))) v_arrayElimCell_55) (+ v_prenex_19 4)) 0)))) (.cse20 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_51 Int) (v_arrayElimCell_55 Int) (v_arrayElimCell_44 Int)) (= (let ((.cse166 (+ 4 v_arrayElimCell_51))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse165 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_51))) (store .cse165 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse165) v_arrayElimCell_44) .cse166)))) v_arrayElimCell_55) .cse166)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_13 Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_55 Int) (v_arrayElimCell_44 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse167 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_43))) (store .cse167 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse167) v_arrayElimCell_44) (+ 4 v_arrayElimCell_43))))) v_arrayElimCell_55) (+ v_prenex_13 4)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_12 Int) (v_arrayElimCell_55 Int) (v_arrayElimCell_44 Int)) (let ((.cse169 (+ v_prenex_12 4))) (let ((.cse168 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse170 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12))) (store .cse170 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse170) v_arrayElimCell_44) .cse169)))) v_arrayElimCell_55))) (or (= (select .cse168 4) 0) (= (select .cse168 .cse169) 0))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_12 Int) (v_arrayElimCell_55 Int) (v_arrayElimCell_44 Int)) (let ((.cse175 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12)) (.cse172 (+ v_prenex_12 4))) (let ((.cse173 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse175) v_arrayElimCell_44) .cse172))) (let ((.cse171 (store .cse175 4 .cse173))) (let ((.cse174 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse171) v_arrayElimCell_55))) (or (= (select .cse171 .cse172) 0) (= .cse173 0) (= (select .cse174 4) 0) (= (select .cse174 .cse172) 0))))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_12 Int) (v_arrayElimCell_55 Int) (v_arrayElimCell_44 Int)) (let ((.cse177 (+ v_prenex_12 4))) (let ((.cse176 (let ((.cse179 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12))) (store .cse179 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse179) v_arrayElimCell_44) .cse177))))) (let ((.cse178 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse176) v_arrayElimCell_55))) (or (= (select .cse176 .cse177) 0) (= (select .cse178 4) 0) (= (select .cse178 .cse177) 0)))))))))) (.cse36 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_44 Int) (v_arrayElimCell_55 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse164 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse164 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse164) v_arrayElimCell_44) .cse33)))) v_arrayElimCell_55) .cse33) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0))))) (.cse53 (or .cse24 .cse25 (forall ((v_prenex_16 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse163 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse163 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse163) |c_ULTIMATE.start_append_~item~0#1.base|) .cse33)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_16 4)) 0))))) (.cse26 (not .cse18)) (.cse60 (or (forall ((v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse162 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse162 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse162) |c_ULTIMATE.start_append_~item~0#1.base|) .cse33)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_18 4))))) .cse17)) (.cse15 (= |c_ULTIMATE.start_main_~#list~0#1.offset| |c_ULTIMATE.start_append_~plist#1.offset|))) (and (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_26 Int) (v_arrayElimCell_44 Int)) (= (let ((.cse1 (+ v_prenex_26 4))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse0 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_26))) (store .cse0 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse0) v_arrayElimCell_44) .cse1)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse1)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_22 Int) (v_arrayElimCell_44 Int)) (let ((.cse3 (+ v_prenex_22 4))) (let ((.cse2 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse4 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22))) (store .cse4 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse4) v_arrayElimCell_44) .cse3)))) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse2 .cse3) 0) (= (select .cse2 4) 0))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_22 Int) (v_arrayElimCell_44 Int)) (let ((.cse8 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22)) (.cse6 (+ v_prenex_22 4))) (let ((.cse7 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse8) v_arrayElimCell_44) .cse6))) (let ((.cse5 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse8 4 .cse7)) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse5 .cse6) 0) (= .cse7 0) (= (select .cse5 4) 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_22 Int) (v_arrayElimCell_44 Int)) (let ((.cse13 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22)) (.cse10 (+ v_prenex_22 4))) (let ((.cse12 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse13) v_arrayElimCell_44) .cse10))) (let ((.cse11 (store .cse13 4 .cse12))) (let ((.cse9 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse11) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse9 .cse10) 0) (= (select .cse11 .cse10) 0) (= .cse12 0) (= (select .cse9 4) 0)))))))))) .cse14 .cse15) (or .cse15 (and (or .cse16 .cse17 .cse18) .cse19 (or .cse17 .cse20 .cse18) .cse21 (or .cse14 .cse22) .cse23 (or .cse24 .cse25 .cse26 .cse27) .cse28 (or (and (or (forall ((v_prenex_15 Int) (v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_44 Int) (v_arrayElimCell_55 Int)) (let ((.cse30 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse31 (+ v_prenex_15 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse29 (store .cse30 0 v_prenex_17))) (store .cse29 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse29) v_arrayElimCell_44) (+ v_prenex_17 4))))) v_arrayElimCell_55) .cse31) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse32 (store .cse30 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse32 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse32) |c_ULTIMATE.start_append_~item~0#1.base|) .cse33)))) v_arrayElimCell_55) .cse31) 0)))) .cse17) (or .cse24 .cse25 (forall ((v_prenex_16 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_55 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse34 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse34 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse34) |c_ULTIMATE.start_append_~item~0#1.base|) .cse33)))) v_arrayElimCell_55) (+ v_prenex_16 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)))))) .cse26) (or .cse35 .cse36))) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_13 Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse37 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_43))) (store .cse37 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse37) v_arrayElimCell_44) (+ 4 v_arrayElimCell_43))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_13 4)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_12 Int) (v_arrayElimCell_44 Int)) (let ((.cse40 (+ v_prenex_12 4))) (let ((.cse39 (let ((.cse41 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12))) (store .cse41 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse41) v_arrayElimCell_44) .cse40))))) (let ((.cse38 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse39) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= 0 (select .cse38 4)) (= (select .cse39 .cse40) 0) (= (select .cse38 .cse40) 0)))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_12 Int) (v_arrayElimCell_44 Int)) (let ((.cse43 (+ v_prenex_12 4))) (let ((.cse42 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse44 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12))) (store .cse44 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse44) v_arrayElimCell_44) .cse43)))) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= 0 (select .cse42 4)) (= (select .cse42 .cse43) 0))))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_arrayElimCell_51 Int) (v_arrayElimCell_44 Int)) (= (let ((.cse46 (+ 4 v_arrayElimCell_51))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse45 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_51))) (store .cse45 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse45) v_arrayElimCell_44) .cse46)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse46)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_12 Int) (v_arrayElimCell_44 Int)) (let ((.cse51 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12)) (.cse49 (+ v_prenex_12 4))) (let ((.cse50 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse51) v_arrayElimCell_44) .cse49))) (let ((.cse48 (store .cse51 4 .cse50))) (let ((.cse47 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse48) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= 0 (select .cse47 4)) (= (select .cse48 .cse49) 0) (= .cse50 0) (= (select .cse47 .cse49) 0)))))))))) .cse17 .cse18) (or .cse35 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_44 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse52 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse52 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse52) v_arrayElimCell_44) .cse33)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse33) 0)))) (or (and (or (and .cse53 (or (forall ((v_prenex_15 Int) (v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_44 Int)) (let ((.cse55 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse56 (+ v_prenex_15 4))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse54 (store .cse55 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse54 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse54) |c_ULTIMATE.start_append_~item~0#1.base|) .cse33)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse56) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse57 (store .cse55 0 v_prenex_17))) (store .cse57 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse57) v_arrayElimCell_44) (+ v_prenex_17 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse56) 0)))) .cse17)) .cse26) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_20 Int) (v_arrayElimCell_44 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse58 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse58 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse58) v_arrayElimCell_44) .cse33)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_20 4)) 0))) .cse14) (or .cse17 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_19 Int) (v_arrayElimCell_44 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse59 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse59 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse59) v_arrayElimCell_44) .cse33)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_19 4)) 0))) .cse18) .cse60 (or .cse14 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int) (v_prenex_21 Int) (v_arrayElimCell_44 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse61 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_21))) (store .cse61 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse61) v_arrayElimCell_44) (+ v_prenex_21 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_24 4)) 0))))) .cse15) (or .cse24 .cse25 (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_18 Int)) (= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse62 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse62 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse62) |c_ULTIMATE.start_append_~item~0#1.base|) .cse33)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_18 4)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_15 Int) (v_prenex_17 Int) (v_arrayElimCell_44 Int)) (let ((.cse64 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse65 (+ v_prenex_15 4))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse63 (store .cse64 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse63 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse63) |c_ULTIMATE.start_append_~item~0#1.base|) .cse33)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse65) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse66 (store .cse64 0 v_prenex_17))) (store .cse66 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse66) v_arrayElimCell_44) (+ v_prenex_17 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse65) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_16 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse67 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse67 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse67) |c_ULTIMATE.start_append_~item~0#1.base|) .cse33)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_16 4)) 0))))) .cse15 .cse26) (or .cse15 (and (or (and (or .cse14 .cse68) .cse69 (or .cse14 .cse70) (or .cse14 .cse71) .cse72 .cse73 .cse74 (or .cse14 .cse75)) .cse18) .cse76 .cse77 .cse78 .cse79 (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_18 Int) (v_arrayElimCell_55 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse80 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse80 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse80) v_arrayElimCell_55) .cse33)))) v_arrayElimCell_55) (+ v_prenex_18 4)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_20 Int) (v_arrayElimCell_55 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse81 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse81 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse81) v_arrayElimCell_55) .cse33)))) v_arrayElimCell_55) (+ v_prenex_20 4)) 0)))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_24 Int) (v_prenex_21 Int) (v_arrayElimCell_55 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse82 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_21))) (store .cse82 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse82) v_arrayElimCell_55) (+ v_prenex_21 4))))) v_arrayElimCell_55) (+ v_prenex_24 4)) 0)))) (or (forall ((v_prenex_15 Int) (v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_55 Int)) (let ((.cse84 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse85 (+ v_prenex_15 4))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse83 (store .cse84 0 v_prenex_17))) (store .cse83 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse83) v_arrayElimCell_55) (+ v_prenex_17 4))))) v_arrayElimCell_55) .cse85) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse86 (store .cse84 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse86 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse86) |c_ULTIMATE.start_append_~item~0#1.base|) .cse33)))) v_arrayElimCell_55) .cse85) 0)))) .cse26) (or .cse87 .cse18) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_25 Int) (v_arrayElimCell_55 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse88 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_25))) (store .cse88 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse88) v_arrayElimCell_55) (+ v_prenex_25 4))))) v_arrayElimCell_55) .cse33) 0))))) .cse14) .cse89 .cse90 .cse91)) (or .cse14 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_25 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse92 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_25))) (store .cse92 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse92) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_25 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse33) 0)))) (or (and (or (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_44 Int) (v_arrayElimCell_55 Int)) (let ((.cse94 (+ v_prenex_12 4))) (let ((.cse93 (let ((.cse96 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12))) (store .cse96 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse96) v_arrayElimCell_44) .cse94))))) (let ((.cse95 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse93) v_arrayElimCell_55))) (or (= (select .cse93 .cse94) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse95 4) 0) (= (select .cse95 .cse94) 0)))))) .cse17) (or .cse36 .cse17) (or (forall ((v_arrayElimCell_51 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_44 Int) (v_arrayElimCell_55 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (let ((.cse98 (+ 4 v_arrayElimCell_51))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse97 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_51))) (store .cse97 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse97) v_arrayElimCell_44) .cse98)))) v_arrayElimCell_55) .cse98)) 0))) .cse17) (or (and .cse19 (or .cse16 .cse17) .cse21 .cse23) .cse15) (or .cse14 .cse15 .cse22) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_13 Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int) (v_arrayElimCell_55 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse99 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_43))) (store .cse99 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse99) v_arrayElimCell_44) (+ 4 v_arrayElimCell_43))))) v_arrayElimCell_55) (+ v_prenex_13 4)) 0))) .cse17) (or (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_44 Int) (v_arrayElimCell_55 Int)) (let ((.cse104 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12)) (.cse101 (+ v_prenex_12 4))) (let ((.cse102 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse104) v_arrayElimCell_44) .cse101))) (let ((.cse100 (store .cse104 4 .cse102))) (let ((.cse103 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse100) v_arrayElimCell_55))) (or (= (select .cse100 .cse101) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse102 0) (= (select .cse103 4) 0) (= (select .cse103 .cse101) 0))))))) .cse17) .cse28 (or (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_44 Int) (v_arrayElimCell_55 Int)) (let ((.cse106 (+ v_prenex_12 4))) (let ((.cse105 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse107 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12))) (store .cse107 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse107) v_arrayElimCell_44) .cse106)))) v_arrayElimCell_55))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse105 4) 0) (= (select .cse105 .cse106) 0))))) .cse17)) .cse18) (or .cse18 (and (or .cse17 .cse75) (or .cse70 .cse17) (or .cse17 .cse71) .cse69 (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_25 Int) (v_arrayElimCell_55 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse108 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_25))) (store .cse108 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse108) v_arrayElimCell_55) (+ v_prenex_25 4))))) v_arrayElimCell_55) .cse33) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)))) .cse14) .cse89 (or .cse17 .cse68) (or (and (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_20 Int) (v_arrayElimCell_55 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse109 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse109 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse109) v_arrayElimCell_55) .cse33)))) v_arrayElimCell_55) (+ v_prenex_20 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)))) .cse14) (or .cse17 .cse87) (or .cse14 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int) (v_prenex_21 Int) (v_arrayElimCell_55 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse110 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_21))) (store .cse110 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse110) v_arrayElimCell_55) (+ v_prenex_21 4))))) v_arrayElimCell_55) (+ v_prenex_24 4)) 0)))) (or .cse17 (forall ((v_prenex_18 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_arrayElimCell_55 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse111 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse111 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse111) v_arrayElimCell_55) .cse33)))) v_arrayElimCell_55) (+ v_prenex_18 4)) 0))))) .cse15) .cse72 .cse73 .cse74 (or .cse15 (and .cse76 .cse77 .cse78 .cse79 .cse90 .cse91)))) (or (and (or .cse26 .cse27) (or .cse16 .cse18) (or .cse20 .cse18) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_18 Int) (v_arrayElimCell_55 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse112 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse112 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse112) |c_ULTIMATE.start_append_~item~0#1.base|) .cse33)))) v_arrayElimCell_55) (+ v_prenex_18 4)) 0)))) (or (and (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_15 Int) (v_prenex_17 Int) (v_arrayElimCell_55 Int) (v_arrayElimCell_44 Int)) (let ((.cse114 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse115 (+ v_prenex_15 4))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse113 (store .cse114 0 v_prenex_17))) (store .cse113 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse113) v_arrayElimCell_44) (+ v_prenex_17 4))))) v_arrayElimCell_55) .cse115) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse116 (store .cse114 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse116 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse116) |c_ULTIMATE.start_append_~item~0#1.base|) .cse33)))) v_arrayElimCell_55) .cse115) 0)))))) (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (forall ((v_prenex_16 Int) (v_arrayElimCell_55 Int)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse117 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse117 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse117) |c_ULTIMATE.start_append_~item~0#1.base|) .cse33)))) v_arrayElimCell_55) (+ v_prenex_16 4)) 0))))) .cse26) (or .cse36 .cse18)) .cse24 .cse25 .cse15) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse118 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse118 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse118) |c_ULTIMATE.start_append_~item~0#1.base|) .cse33)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse33) 0))) .cse119) (or .cse15 (and (or .cse14 (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse120 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22))) (let ((.cse121 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse120) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_22 4)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store .cse120 4 .cse121)) |c_ULTIMATE.start_append_~item~0#1.base|) 4) 0) (= .cse121 0)))))) (or .cse14 (forall ((v_prenex_26 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (let ((.cse123 (+ v_prenex_26 4))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse122 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_26))) (store .cse122 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse122) |c_ULTIMATE.start_append_~item~0#1.base|) .cse123)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse123)) 0)))) (or (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse127 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22)) (.cse125 (+ v_prenex_22 4))) (let ((.cse126 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse127) |c_ULTIMATE.start_append_~item~0#1.base|) .cse125))) (let ((.cse124 (store .cse127 4 .cse126))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse124 .cse125) 0) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse124) |c_ULTIMATE.start_append_~item~0#1.base|) 4) 0) (= .cse126 0)))))) .cse119) (or (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse129 (+ v_prenex_22 4))) (let ((.cse128 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse130 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22))) (store .cse130 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse130) |c_ULTIMATE.start_append_~item~0#1.base|) .cse129)))) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= (select .cse128 .cse129) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse128 4) 0))))) .cse14) (or .cse119 (forall ((v_prenex_22 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse131 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_22)) (.cse133 (+ v_prenex_22 4))) (let ((.cse132 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse131) |c_ULTIMATE.start_append_~item~0#1.base|) .cse133))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (store .cse131 4 .cse132) .cse133) 0) (= .cse132 0)))))) (or (forall ((v_prenex_23 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_23)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_23 4)) 0))) .cse119))) (or (and (or (and .cse53 (or .cse17 (forall ((v_prenex_15 Int) (v_prenex_17 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse135 (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|)) (.cse136 (+ v_prenex_15 4))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse134 (store .cse135 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse134 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse134) |c_ULTIMATE.start_append_~item~0#1.base|) .cse33)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse136) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse137 (store .cse135 0 v_prenex_17))) (store .cse137 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse137) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_17 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse136) 0)))))) .cse26) (or .cse14 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_24 Int) (v_prenex_21 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse138 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_21))) (store .cse138 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse138) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_21 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_24 4)) 0)))) (or .cse17 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_19 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse139 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse139 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse139) |c_ULTIMATE.start_append_~item~0#1.base|) .cse33)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_19 4)) 0))) .cse18) (or .cse14 (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_20 Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse140 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 |c_ULTIMATE.start_append_~item~0#1.offset|))) (store .cse140 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse140) |c_ULTIMATE.start_append_~item~0#1.base|) .cse33)))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_20 4)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0))))) .cse60) .cse15) (or (and (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_13 Int) (v_arrayElimCell_43 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse141 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_43))) (store .cse141 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse141) |c_ULTIMATE.start_append_~item~0#1.base|) (+ 4 v_arrayElimCell_43))))) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_13 4)) 0))) .cse17) (or (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse143 (+ v_prenex_12 4))) (let ((.cse142 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse144 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12))) (store .cse144 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse144) |c_ULTIMATE.start_append_~item~0#1.base|) .cse143)))) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= 0 (select .cse142 4)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse142 .cse143) 0))))) .cse17) (or (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse148 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12)) (.cse147 (+ v_prenex_12 4))) (let ((.cse146 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse148) |c_ULTIMATE.start_append_~item~0#1.base|) .cse147))) (let ((.cse145 (store .cse148 4 .cse146))) (or (= 0 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse145) |c_ULTIMATE.start_append_~item~0#1.base|) 4)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse146 0) (= (select .cse145 .cse147) 0)))))) .cse119) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_14 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_14)) |c_ULTIMATE.start_append_~item~0#1.base|) (+ v_prenex_14 4)) 0))) .cse119) (or (forall ((v_arrayElimCell_51 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (let ((.cse150 (+ 4 v_arrayElimCell_51))) (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse149 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_arrayElimCell_51))) (store .cse149 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse149) |c_ULTIMATE.start_append_~item~0#1.base|) .cse150)))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse150)) 0))) .cse17) (or (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse152 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12)) (.cse153 (+ v_prenex_12 4))) (let ((.cse151 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse152) |c_ULTIMATE.start_append_~item~0#1.base|) .cse153))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= .cse151 0) (= (select (store .cse152 4 .cse151) .cse153) 0))))) .cse119) (or (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse155 (+ v_prenex_12 4))) (let ((.cse154 (let ((.cse156 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12))) (store .cse156 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse156) |c_ULTIMATE.start_append_~item~0#1.base|) .cse155))))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse154) |c_ULTIMATE.start_append_~item~0#1.base|) .cse155) 0) (= (select .cse154 .cse155) 0))))) .cse119) (or (forall ((v_prenex_12 Int) (|v_ULTIMATE.start_append_~item~0#1.base_35| Int)) (let ((.cse158 (+ v_prenex_12 4))) (let ((.cse159 (let ((.cse160 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_12))) (store .cse160 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse160) |c_ULTIMATE.start_append_~item~0#1.base|) .cse158))))) (let ((.cse157 (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse159) |c_ULTIMATE.start_append_~item~0#1.base|))) (or (= 0 (select .cse157 4)) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select .cse157 .cse158) 0) (= (select .cse159 .cse158) 0)))))) .cse17)) .cse18) (or (forall ((|v_ULTIMATE.start_append_~item~0#1.base_35| Int) (v_prenex_25 Int) (v_arrayElimCell_44 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0)) (= (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| (let ((.cse161 (store (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35|) 0 v_prenex_25))) (store .cse161 4 (select (select (store |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_append_~item~0#1.base_35| .cse161) v_arrayElimCell_44) (+ v_prenex_25 4))))) |c_ULTIMATE.start_append_~item~0#1.base|) .cse33) 0))) .cse14)))))) is different from true