./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-token-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:36:55,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:36:55,330 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:36:55,336 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:36:55,337 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:36:55,355 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:36:55,355 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:36:55,355 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:36:55,356 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:36:55,356 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:36:55,356 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:36:55,356 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:36:55,356 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:36:55,356 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:36:55,356 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:36:55,356 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:36:55,356 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:36:55,356 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:36:55,356 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:36:55,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:36:55,358 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:36:55,358 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:36:55,359 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:36:55,359 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:36:55,359 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:36:55,359 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:36:55,359 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:36:55,359 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:36:55,359 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:36:55,359 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:36:55,360 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:36:55,360 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:36:55,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:36:55,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:36:55,360 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:36:55,360 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:36:55,360 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:36:55,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:36:55,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:36:55,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:36:55,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:36:55,361 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:36:55,361 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 [2025-02-08 06:36:55,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:36:55,634 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:36:55,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:36:55,637 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:36:55,638 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:36:55,638 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-token-1.i [2025-02-08 06:36:56,853 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6aa01508a/78185f49901940a597289b9c8f606f3b/FLAG56a6e429b [2025-02-08 06:36:57,176 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:36:57,177 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i [2025-02-08 06:36:57,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6aa01508a/78185f49901940a597289b9c8f606f3b/FLAG56a6e429b [2025-02-08 06:36:57,436 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6aa01508a/78185f49901940a597289b9c8f606f3b [2025-02-08 06:36:57,438 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:36:57,439 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:36:57,440 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:36:57,440 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:36:57,443 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:36:57,443 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:36:57" (1/1) ... [2025-02-08 06:36:57,444 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d515007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:36:57, skipping insertion in model container [2025-02-08 06:36:57,444 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:36:57" (1/1) ... [2025-02-08 06:36:57,462 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:36:57,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:36:57,602 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:36:57,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:36:57,646 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:36:57,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:36:57 WrapperNode [2025-02-08 06:36:57,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:36:57,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:36:57,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:36:57,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:36:57,652 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:36:57" (1/1) ... [2025-02-08 06:36:57,659 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:36:57" (1/1) ... [2025-02-08 06:36:57,671 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 130 [2025-02-08 06:36:57,672 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:36:57,672 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:36:57,672 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:36:57,672 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:36:57,677 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:36:57" (1/1) ... [2025-02-08 06:36:57,677 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:36:57" (1/1) ... [2025-02-08 06:36:57,680 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:36:57" (1/1) ... [2025-02-08 06:36:57,688 INFO L175 MemorySlicer]: Split 26 memory accesses to 2 slices as follows [2, 24]. 92 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2025-02-08 06:36:57,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:36:57" (1/1) ... [2025-02-08 06:36:57,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:36:57" (1/1) ... [2025-02-08 06:36:57,693 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:36:57" (1/1) ... [2025-02-08 06:36:57,694 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:36:57" (1/1) ... [2025-02-08 06:36:57,694 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:36:57" (1/1) ... [2025-02-08 06:36:57,695 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:36:57" (1/1) ... [2025-02-08 06:36:57,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:36:57,697 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:36:57,697 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:36:57,697 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:36:57,698 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:36:57" (1/1) ... [2025-02-08 06:36:57,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:36:57,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:36:57,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:36:57,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:36:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-08 06:36:57,737 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-08 06:36:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:36:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:36:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:36:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:36:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:36:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:36:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:36:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:36:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:36:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:36:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:36:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:36:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:36:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:36:57,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:36:57,802 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:36:57,803 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:36:58,119 INFO L? ?]: Removed 112 outVars from TransFormulas that were not future-live. [2025-02-08 06:36:58,119 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:36:58,129 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:36:58,130 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:36:58,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:36:58 BoogieIcfgContainer [2025-02-08 06:36:58,130 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:36:58,132 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:36:58,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:36:58,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:36:58,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:36:57" (1/3) ... [2025-02-08 06:36:58,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9434275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:36:58, skipping insertion in model container [2025-02-08 06:36:58,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:36:57" (2/3) ... [2025-02-08 06:36:58,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9434275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:36:58, skipping insertion in model container [2025-02-08 06:36:58,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:36:58" (3/3) ... [2025-02-08 06:36:58,139 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2025-02-08 06:36:58,150 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:36:58,152 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-token-1.i that has 2 procedures, 148 locations, 1 initial locations, 9 loop locations, and 59 error locations. [2025-02-08 06:36:58,192 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:36:58,201 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;@30acfb97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:36:58,203 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-02-08 06:36:58,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 148 states, 81 states have (on average 2.037037037037037) internal successors, (165), 140 states have internal predecessors, (165), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:36:58,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 06:36:58,208 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:36:58,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 06:36:58,209 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:36:58,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:36:58,213 INFO L85 PathProgramCache]: Analyzing trace with hash 6495, now seen corresponding path program 1 times [2025-02-08 06:36:58,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:36:58,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037730202] [2025-02-08 06:36:58,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:36:58,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:36:58,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 06:36:58,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 06:36:58,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:36:58,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:36:58,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:36:58,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:36:58,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037730202] [2025-02-08 06:36:58,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037730202] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:36:58,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:36:58,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:36:58,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128470336] [2025-02-08 06:36:58,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:36:58,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:36:58,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:36:58,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:36:58,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:36:58,471 INFO L87 Difference]: Start difference. First operand has 148 states, 81 states have (on average 2.037037037037037) internal successors, (165), 140 states have internal predecessors, (165), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:36:58,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:36:58,594 INFO L93 Difference]: Finished difference Result 137 states and 144 transitions. [2025-02-08 06:36:58,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:36:58,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2025-02-08 06:36:58,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:36:58,600 INFO L225 Difference]: With dead ends: 137 [2025-02-08 06:36:58,600 INFO L226 Difference]: Without dead ends: 135 [2025-02-08 06:36:58,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:36:58,604 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 88 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:36:58,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 124 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:36:58,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-08 06:36:58,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2025-02-08 06:36:58,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 73 states have (on average 1.8630136986301369) internal successors, (136), 133 states have internal predecessors, (136), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:36:58,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 142 transitions. [2025-02-08 06:36:58,653 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 142 transitions. Word has length 2 [2025-02-08 06:36:58,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:36:58,653 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 142 transitions. [2025-02-08 06:36:58,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:36:58,654 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 142 transitions. [2025-02-08 06:36:58,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 06:36:58,654 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:36:58,654 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 06:36:58,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:36:58,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:36:58,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:36:58,655 INFO L85 PathProgramCache]: Analyzing trace with hash 6496, now seen corresponding path program 1 times [2025-02-08 06:36:58,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:36:58,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789052003] [2025-02-08 06:36:58,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:36:58,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:36:58,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 06:36:58,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 06:36:58,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:36:58,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:36:58,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:36:58,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:36:58,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789052003] [2025-02-08 06:36:58,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789052003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:36:58,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:36:58,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:36:58,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431742325] [2025-02-08 06:36:58,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:36:58,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:36:58,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:36:58,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:36:58,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:36:58,791 INFO L87 Difference]: Start difference. First operand 135 states and 142 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:36:58,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:36:58,948 INFO L93 Difference]: Finished difference Result 132 states and 139 transitions. [2025-02-08 06:36:58,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:36:58,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2025-02-08 06:36:58,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:36:58,950 INFO L225 Difference]: With dead ends: 132 [2025-02-08 06:36:58,954 INFO L226 Difference]: Without dead ends: 132 [2025-02-08 06:36:58,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:36:58,955 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 88 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:36:58,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 124 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:36:58,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-08 06:36:58,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-02-08 06:36:58,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 73 states have (on average 1.821917808219178) internal successors, (133), 130 states have internal predecessors, (133), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:36:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2025-02-08 06:36:58,969 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 2 [2025-02-08 06:36:58,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:36:58,969 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2025-02-08 06:36:58,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:36:58,969 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2025-02-08 06:36:58,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 06:36:58,970 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:36:58,970 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:36:58,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:36:58,970 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:36:58,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:36:58,970 INFO L85 PathProgramCache]: Analyzing trace with hash 245367316, now seen corresponding path program 1 times [2025-02-08 06:36:58,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:36:58,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961128823] [2025-02-08 06:36:58,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:36:58,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:36:58,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 06:36:59,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 06:36:59,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:36:59,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:36:59,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:36:59,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:36:59,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961128823] [2025-02-08 06:36:59,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961128823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:36:59,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:36:59,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:36:59,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752012507] [2025-02-08 06:36:59,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:36:59,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:36:59,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:36:59,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:36:59,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:36:59,253 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) [2025-02-08 06:36:59,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:36:59,469 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2025-02-08 06:36:59,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:36:59,469 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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 [2025-02-08 06:36:59,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:36:59,470 INFO L225 Difference]: With dead ends: 121 [2025-02-08 06:36:59,470 INFO L226 Difference]: Without dead ends: 121 [2025-02-08 06:36:59,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:36:59,470 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 139 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:36:59,471 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 89 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:36:59,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-08 06:36:59,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-02-08 06:36:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 77 states have (on average 1.6103896103896105) internal successors, (124), 119 states have internal predecessors, (124), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:36:59,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2025-02-08 06:36:59,484 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 8 [2025-02-08 06:36:59,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:36:59,485 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2025-02-08 06:36:59,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 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) [2025-02-08 06:36:59,489 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2025-02-08 06:36:59,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 06:36:59,489 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:36:59,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:36:59,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:36:59,489 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:36:59,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:36:59,489 INFO L85 PathProgramCache]: Analyzing trace with hash 245367317, now seen corresponding path program 1 times [2025-02-08 06:36:59,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:36:59,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004421205] [2025-02-08 06:36:59,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:36:59,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:36:59,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 06:36:59,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 06:36:59,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:36:59,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:36:59,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:36:59,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:36:59,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004421205] [2025-02-08 06:36:59,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004421205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:36:59,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:36:59,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:36:59,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807763490] [2025-02-08 06:36:59,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:36:59,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:36:59,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:36:59,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:36:59,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:36:59,820 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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) [2025-02-08 06:37:00,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:00,074 INFO L93 Difference]: Finished difference Result 171 states and 184 transitions. [2025-02-08 06:37:00,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:37:00,074 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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 [2025-02-08 06:37:00,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:00,075 INFO L225 Difference]: With dead ends: 171 [2025-02-08 06:37:00,076 INFO L226 Difference]: Without dead ends: 171 [2025-02-08 06:37:00,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:37:00,077 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 161 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:00,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 181 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:37:00,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2025-02-08 06:37:00,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 161. [2025-02-08 06:37:00,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 117 states have (on average 1.4957264957264957) internal successors, (175), 159 states have internal predecessors, (175), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:00,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 181 transitions. [2025-02-08 06:37:00,087 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 181 transitions. Word has length 8 [2025-02-08 06:37:00,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:00,089 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 181 transitions. [2025-02-08 06:37:00,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 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) [2025-02-08 06:37:00,090 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 181 transitions. [2025-02-08 06:37:00,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 06:37:00,090 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:00,090 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:37:00,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:37:00,090 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:37:00,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:00,091 INFO L85 PathProgramCache]: Analyzing trace with hash -296504796, now seen corresponding path program 1 times [2025-02-08 06:37:00,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:00,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471437233] [2025-02-08 06:37:00,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:00,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:00,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 06:37:00,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 06:37:00,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:00,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:00,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:37:00,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:00,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471437233] [2025-02-08 06:37:00,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471437233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:00,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:00,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:37:00,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023291149] [2025-02-08 06:37:00,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:00,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:37:00,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:00,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:37:00,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:37:00,206 INFO L87 Difference]: Start difference. First operand 161 states and 181 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:00,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:00,317 INFO L93 Difference]: Finished difference Result 160 states and 179 transitions. [2025-02-08 06:37:00,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:37:00,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-08 06:37:00,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:00,318 INFO L225 Difference]: With dead ends: 160 [2025-02-08 06:37:00,318 INFO L226 Difference]: Without dead ends: 160 [2025-02-08 06:37:00,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:37:00,319 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 4 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:00,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 322 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:37:00,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-08 06:37:00,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-02-08 06:37:00,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 117 states have (on average 1.4786324786324787) internal successors, (173), 158 states have internal predecessors, (173), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:00,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2025-02-08 06:37:00,330 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 11 [2025-02-08 06:37:00,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:00,331 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2025-02-08 06:37:00,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:00,331 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2025-02-08 06:37:00,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 06:37:00,331 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:00,331 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:37:00,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:37:00,331 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:37:00,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:00,336 INFO L85 PathProgramCache]: Analyzing trace with hash -296504795, now seen corresponding path program 1 times [2025-02-08 06:37:00,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:00,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504920231] [2025-02-08 06:37:00,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:00,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:00,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 06:37:00,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 06:37:00,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:00,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:37:00,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:00,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504920231] [2025-02-08 06:37:00,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504920231] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:00,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:00,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:37:00,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450313810] [2025-02-08 06:37:00,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:00,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:37:00,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:00,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:37:00,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:37:00,527 INFO L87 Difference]: Start difference. First operand 160 states and 179 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:00,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:00,639 INFO L93 Difference]: Finished difference Result 159 states and 177 transitions. [2025-02-08 06:37:00,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:37:00,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-08 06:37:00,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:00,640 INFO L225 Difference]: With dead ends: 159 [2025-02-08 06:37:00,640 INFO L226 Difference]: Without dead ends: 159 [2025-02-08 06:37:00,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:37:00,641 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 2 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:00,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 317 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:37:00,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-08 06:37:00,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-02-08 06:37:00,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 117 states have (on average 1.4615384615384615) internal successors, (171), 157 states have internal predecessors, (171), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:00,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 177 transitions. [2025-02-08 06:37:00,649 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 177 transitions. Word has length 11 [2025-02-08 06:37:00,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:00,649 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 177 transitions. [2025-02-08 06:37:00,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:00,649 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 177 transitions. [2025-02-08 06:37:00,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 06:37:00,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:00,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:37:00,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:37:00,650 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:37:00,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:00,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1165031970, now seen corresponding path program 1 times [2025-02-08 06:37:00,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:00,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795373691] [2025-02-08 06:37:00,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:00,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:00,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:37:00,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:37:00,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:00,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:00,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:37:00,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:00,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795373691] [2025-02-08 06:37:00,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795373691] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:00,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:00,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:37:00,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575414485] [2025-02-08 06:37:00,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:00,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:37:00,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:00,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:37:00,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:37:00,717 INFO L87 Difference]: Start difference. First operand 159 states and 177 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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) [2025-02-08 06:37:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:00,818 INFO L93 Difference]: Finished difference Result 158 states and 175 transitions. [2025-02-08 06:37:00,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:37:00,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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 [2025-02-08 06:37:00,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:00,819 INFO L225 Difference]: With dead ends: 158 [2025-02-08 06:37:00,819 INFO L226 Difference]: Without dead ends: 158 [2025-02-08 06:37:00,819 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:37:00,820 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 4 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:00,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 317 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:37:00,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-08 06:37:00,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-02-08 06:37:00,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 117 states have (on average 1.4444444444444444) internal successors, (169), 156 states have internal predecessors, (169), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:00,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 175 transitions. [2025-02-08 06:37:00,824 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 175 transitions. Word has length 13 [2025-02-08 06:37:00,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:00,824 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 175 transitions. [2025-02-08 06:37:00,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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) [2025-02-08 06:37:00,824 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 175 transitions. [2025-02-08 06:37:00,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 06:37:00,824 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:00,824 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:37:00,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:37:00,824 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:37:00,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:00,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1165031971, now seen corresponding path program 1 times [2025-02-08 06:37:00,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:00,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399032565] [2025-02-08 06:37:00,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:00,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:00,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:37:00,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:37:00,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:00,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:00,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:37:00,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:00,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399032565] [2025-02-08 06:37:00,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399032565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:00,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:00,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:37:00,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875058213] [2025-02-08 06:37:00,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:00,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:37:00,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:00,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:37:00,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:37:00,988 INFO L87 Difference]: Start difference. First operand 158 states and 175 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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) [2025-02-08 06:37:01,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:01,097 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2025-02-08 06:37:01,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:37:01,097 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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 [2025-02-08 06:37:01,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:01,098 INFO L225 Difference]: With dead ends: 157 [2025-02-08 06:37:01,098 INFO L226 Difference]: Without dead ends: 157 [2025-02-08 06:37:01,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:37:01,098 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 2 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:01,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 312 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:37:01,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-08 06:37:01,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-02-08 06:37:01,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 117 states have (on average 1.4273504273504274) internal successors, (167), 155 states have internal predecessors, (167), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:01,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 173 transitions. [2025-02-08 06:37:01,102 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 173 transitions. Word has length 13 [2025-02-08 06:37:01,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:01,102 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 173 transitions. [2025-02-08 06:37:01,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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) [2025-02-08 06:37:01,102 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 173 transitions. [2025-02-08 06:37:01,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 06:37:01,102 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:01,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:37:01,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:37:01,103 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:37:01,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:01,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1532784990, now seen corresponding path program 1 times [2025-02-08 06:37:01,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:01,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632793427] [2025-02-08 06:37:01,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:01,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:01,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 06:37:01,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 06:37:01,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:01,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:01,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:37:01,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:01,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632793427] [2025-02-08 06:37:01,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632793427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:01,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:01,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 06:37:01,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649548450] [2025-02-08 06:37:01,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:01,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:37:01,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:01,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:37:01,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:37:01,267 INFO L87 Difference]: Start difference. First operand 157 states and 173 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 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) [2025-02-08 06:37:01,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:01,625 INFO L93 Difference]: Finished difference Result 156 states and 172 transitions. [2025-02-08 06:37:01,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:37:01,625 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 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 [2025-02-08 06:37:01,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:01,626 INFO L225 Difference]: With dead ends: 156 [2025-02-08 06:37:01,626 INFO L226 Difference]: Without dead ends: 156 [2025-02-08 06:37:01,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-02-08 06:37:01,627 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 132 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:01,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 218 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:37:01,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-08 06:37:01,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2025-02-08 06:37:01,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 117 states have (on average 1.4188034188034189) internal successors, (166), 154 states have internal predecessors, (166), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:01,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 172 transitions. [2025-02-08 06:37:01,634 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 172 transitions. Word has length 15 [2025-02-08 06:37:01,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:01,634 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 172 transitions. [2025-02-08 06:37:01,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 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) [2025-02-08 06:37:01,634 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 172 transitions. [2025-02-08 06:37:01,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 06:37:01,634 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:01,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:37:01,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:37:01,639 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:37:01,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:01,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1532784991, now seen corresponding path program 1 times [2025-02-08 06:37:01,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:01,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23813731] [2025-02-08 06:37:01,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:01,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:01,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 06:37:01,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 06:37:01,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:01,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:01,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:37:01,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:01,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23813731] [2025-02-08 06:37:01,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23813731] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:01,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:01,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:37:01,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647329120] [2025-02-08 06:37:01,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:01,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:37:01,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:01,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:37:01,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-08 06:37:01,937 INFO L87 Difference]: Start difference. First operand 156 states and 172 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 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) [2025-02-08 06:37:02,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:02,354 INFO L93 Difference]: Finished difference Result 148 states and 164 transitions. [2025-02-08 06:37:02,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 06:37:02,355 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 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 [2025-02-08 06:37:02,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:02,356 INFO L225 Difference]: With dead ends: 148 [2025-02-08 06:37:02,356 INFO L226 Difference]: Without dead ends: 148 [2025-02-08 06:37:02,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-02-08 06:37:02,357 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 141 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:02,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 392 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:37:02,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-02-08 06:37:02,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 132. [2025-02-08 06:37:02,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 101 states have (on average 1.396039603960396) internal successors, (141), 130 states have internal predecessors, (141), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:02,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 147 transitions. [2025-02-08 06:37:02,361 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 147 transitions. Word has length 15 [2025-02-08 06:37:02,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:02,361 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 147 transitions. [2025-02-08 06:37:02,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 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) [2025-02-08 06:37:02,361 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 147 transitions. [2025-02-08 06:37:02,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 06:37:02,361 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:02,362 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:37:02,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:37:02,362 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:37:02,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:02,363 INFO L85 PathProgramCache]: Analyzing trace with hash -163215406, now seen corresponding path program 1 times [2025-02-08 06:37:02,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:02,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283303949] [2025-02-08 06:37:02,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:02,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:02,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:37:02,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:37:02,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:02,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:02,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:37:02,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:02,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283303949] [2025-02-08 06:37:02,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283303949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:02,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:02,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:37:02,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907325029] [2025-02-08 06:37:02,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:02,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:37:02,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:02,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:37:02,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:37:02,565 INFO L87 Difference]: Start difference. First operand 132 states and 147 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) [2025-02-08 06:37:02,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:02,744 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2025-02-08 06:37:02,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:37:02,744 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 [2025-02-08 06:37:02,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:02,745 INFO L225 Difference]: With dead ends: 135 [2025-02-08 06:37:02,745 INFO L226 Difference]: Without dead ends: 135 [2025-02-08 06:37:02,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:37:02,746 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 45 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:02,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 318 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:37:02,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-08 06:37:02,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2025-02-08 06:37:02,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 101 states have (on average 1.386138613861386) internal successors, (140), 129 states have internal predecessors, (140), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:02,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 146 transitions. [2025-02-08 06:37:02,749 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 146 transitions. Word has length 16 [2025-02-08 06:37:02,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:02,749 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 146 transitions. [2025-02-08 06:37:02,749 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) [2025-02-08 06:37:02,749 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 146 transitions. [2025-02-08 06:37:02,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 06:37:02,749 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:02,749 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:37:02,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 06:37:02,749 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:37:02,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:02,750 INFO L85 PathProgramCache]: Analyzing trace with hash -163215407, now seen corresponding path program 1 times [2025-02-08 06:37:02,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:02,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984998312] [2025-02-08 06:37:02,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:02,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:02,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:37:02,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:37:02,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:02,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:02,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:37:02,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:02,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984998312] [2025-02-08 06:37:02,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984998312] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:02,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:02,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-08 06:37:02,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414818283] [2025-02-08 06:37:02,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:02,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:37:02,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:02,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:37:02,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:37:02,849 INFO L87 Difference]: Start difference. First operand 131 states and 146 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) [2025-02-08 06:37:02,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:02,997 INFO L93 Difference]: Finished difference Result 134 states and 150 transitions. [2025-02-08 06:37:02,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:37:02,997 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 [2025-02-08 06:37:02,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:02,998 INFO L225 Difference]: With dead ends: 134 [2025-02-08 06:37:02,998 INFO L226 Difference]: Without dead ends: 134 [2025-02-08 06:37:02,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:37:02,998 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 45 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:02,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 246 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:37:02,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-08 06:37:03,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2025-02-08 06:37:03,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 101 states have (on average 1.3762376237623761) internal successors, (139), 128 states have internal predecessors, (139), 6 states have call successors, (6), 1 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:03,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 145 transitions. [2025-02-08 06:37:03,001 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 145 transitions. Word has length 16 [2025-02-08 06:37:03,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:03,001 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 145 transitions. [2025-02-08 06:37:03,001 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) [2025-02-08 06:37:03,001 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 145 transitions. [2025-02-08 06:37:03,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-08 06:37:03,002 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:03,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:37:03,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 06:37:03,002 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:37:03,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:03,002 INFO L85 PathProgramCache]: Analyzing trace with hash -666924612, now seen corresponding path program 1 times [2025-02-08 06:37:03,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:03,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380947697] [2025-02-08 06:37:03,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:03,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:03,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 06:37:03,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 06:37:03,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:03,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:03,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:37:03,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:03,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380947697] [2025-02-08 06:37:03,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380947697] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:03,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:03,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:37:03,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753035583] [2025-02-08 06:37:03,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:03,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:37:03,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:03,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:37:03,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:37:03,070 INFO L87 Difference]: Start difference. First operand 130 states and 145 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:03,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:03,167 INFO L93 Difference]: Finished difference Result 133 states and 148 transitions. [2025-02-08 06:37:03,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:37:03,167 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-08 06:37:03,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:03,168 INFO L225 Difference]: With dead ends: 133 [2025-02-08 06:37:03,168 INFO L226 Difference]: Without dead ends: 133 [2025-02-08 06:37:03,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:37:03,168 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 201 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:03,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 81 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:37:03,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-08 06:37:03,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2025-02-08 06:37:03,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 101 states have (on average 1.3663366336633664) internal successors, (138), 127 states have internal predecessors, (138), 5 states have call successors, (5), 1 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:03,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 143 transitions. [2025-02-08 06:37:03,171 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 143 transitions. Word has length 20 [2025-02-08 06:37:03,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:03,171 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 143 transitions. [2025-02-08 06:37:03,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:03,171 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 143 transitions. [2025-02-08 06:37:03,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-08 06:37:03,172 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:03,172 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:37:03,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 06:37:03,172 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:37:03,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:03,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1830099782, now seen corresponding path program 1 times [2025-02-08 06:37:03,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:03,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943205174] [2025-02-08 06:37:03,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:03,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:03,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 06:37:03,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 06:37:03,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:03,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:03,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:37:03,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:03,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943205174] [2025-02-08 06:37:03,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943205174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:03,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:03,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:37:03,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373545525] [2025-02-08 06:37:03,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:03,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:37:03,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:03,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:37:03,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:37:03,206 INFO L87 Difference]: Start difference. First operand 129 states and 143 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:03,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:03,277 INFO L93 Difference]: Finished difference Result 154 states and 168 transitions. [2025-02-08 06:37:03,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:37:03,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-08 06:37:03,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:03,278 INFO L225 Difference]: With dead ends: 154 [2025-02-08 06:37:03,278 INFO L226 Difference]: Without dead ends: 154 [2025-02-08 06:37:03,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:37:03,279 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 123 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:03,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 151 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:37:03,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-02-08 06:37:03,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 128. [2025-02-08 06:37:03,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 126 states have internal predecessors, (137), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:03,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 141 transitions. [2025-02-08 06:37:03,282 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 141 transitions. Word has length 22 [2025-02-08 06:37:03,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:03,282 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 141 transitions. [2025-02-08 06:37:03,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:03,282 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2025-02-08 06:37:03,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 06:37:03,282 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:03,282 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:37:03,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 06:37:03,283 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:37:03,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:03,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1243586544, now seen corresponding path program 1 times [2025-02-08 06:37:03,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:03,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269928162] [2025-02-08 06:37:03,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:03,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:03,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 06:37:03,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 06:37:03,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:03,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:03,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:37:03,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:03,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269928162] [2025-02-08 06:37:03,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269928162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:03,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:03,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-08 06:37:03,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358769252] [2025-02-08 06:37:03,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:03,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 06:37:03,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:03,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 06:37:03,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-02-08 06:37:03,770 INFO L87 Difference]: Start difference. First operand 128 states and 141 transitions. Second operand has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:04,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:04,214 INFO L93 Difference]: Finished difference Result 243 states and 268 transitions. [2025-02-08 06:37:04,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 06:37:04,215 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-08 06:37:04,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:04,216 INFO L225 Difference]: With dead ends: 243 [2025-02-08 06:37:04,216 INFO L226 Difference]: Without dead ends: 243 [2025-02-08 06:37:04,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2025-02-08 06:37:04,217 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 235 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 692 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:04,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 800 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 692 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:37:04,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-02-08 06:37:04,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 149. [2025-02-08 06:37:04,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 122 states have (on average 1.3114754098360655) internal successors, (160), 147 states have internal predecessors, (160), 4 states have call successors, (4), 1 states have call predecessors, (4), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:04,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 164 transitions. [2025-02-08 06:37:04,220 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 164 transitions. Word has length 29 [2025-02-08 06:37:04,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:04,220 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 164 transitions. [2025-02-08 06:37:04,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8666666666666667) internal successors, (28), 14 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:04,221 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 164 transitions. [2025-02-08 06:37:04,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-08 06:37:04,221 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:04,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:37:04,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 06:37:04,222 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:37:04,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:04,222 INFO L85 PathProgramCache]: Analyzing trace with hash -799821730, now seen corresponding path program 1 times [2025-02-08 06:37:04,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:04,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503642801] [2025-02-08 06:37:04,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:04,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:04,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 06:37:04,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 06:37:04,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:04,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:04,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:37:04,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:04,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503642801] [2025-02-08 06:37:04,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503642801] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:04,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:04,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:37:04,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194758660] [2025-02-08 06:37:04,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:04,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:37:04,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:04,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:37:04,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:37:04,262 INFO L87 Difference]: Start difference. First operand 149 states and 164 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:04,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:04,338 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2025-02-08 06:37:04,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:37:04,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-08 06:37:04,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:04,339 INFO L225 Difference]: With dead ends: 148 [2025-02-08 06:37:04,339 INFO L226 Difference]: Without dead ends: 148 [2025-02-08 06:37:04,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:37:04,339 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 6 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:04,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 273 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:37:04,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2025-02-08 06:37:04,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2025-02-08 06:37:04,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 122 states have (on average 1.2950819672131149) internal successors, (158), 146 states have internal predecessors, (158), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 161 transitions. [2025-02-08 06:37:04,342 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 161 transitions. Word has length 29 [2025-02-08 06:37:04,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:04,342 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 161 transitions. [2025-02-08 06:37:04,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:04,342 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 161 transitions. [2025-02-08 06:37:04,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 06:37:04,343 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:04,343 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:37:04,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 06:37:04,343 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:37:04,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:04,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1144340851, now seen corresponding path program 1 times [2025-02-08 06:37:04,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:04,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594860981] [2025-02-08 06:37:04,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:04,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:04,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:37:04,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:37:04,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:04,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:04,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:37:04,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:04,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594860981] [2025-02-08 06:37:04,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594860981] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:37:04,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027507350] [2025-02-08 06:37:04,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:04,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:37:04,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:37:04,664 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:37:04,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:37:04,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:37:04,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:37:04,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:04,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:04,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 06:37:04,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:37:04,877 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 06:37:04,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 06:37:04,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:37:05,012 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:37:05,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-08 06:37:05,070 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:37:05,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-02-08 06:37:05,177 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 [2025-02-08 06:37:05,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:37:05,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:37:05,431 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_59| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_594 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_59| 0) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_593))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_594)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_59|)) 1) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_59|))) is different from false [2025-02-08 06:37:05,444 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_59| Int) (v_ArrVal_593 (Array Int Int)) (v_ArrVal_594 (Array Int Int))) (or (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_593))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_594)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_59|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_59| 0) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_59|))) is different from false [2025-02-08 06:37:05,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:05,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2025-02-08 06:37:05,468 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:05,469 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 144 treesize of output 131 [2025-02-08 06:37:05,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:05,480 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 80 treesize of output 78 [2025-02-08 06:37:05,484 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 70 treesize of output 66 [2025-02-08 06:37:06,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:06,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 100 treesize of output 254 [2025-02-08 06:37:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:37:08,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027507350] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:37:08,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:37:08,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 34 [2025-02-08 06:37:08,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527999051] [2025-02-08 06:37:08,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:37:08,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-08 06:37:08,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:08,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-08 06:37:08,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=884, Unknown=9, NotChecked=126, Total=1190 [2025-02-08 06:37:08,094 INFO L87 Difference]: Start difference. First operand 148 states and 161 transitions. Second operand has 35 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 35 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:09,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:09,392 INFO L93 Difference]: Finished difference Result 213 states and 232 transitions. [2025-02-08 06:37:09,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 06:37:09,393 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 35 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-08 06:37:09,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:09,394 INFO L225 Difference]: With dead ends: 213 [2025-02-08 06:37:09,394 INFO L226 Difference]: Without dead ends: 213 [2025-02-08 06:37:09,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=301, Invalid=1504, Unknown=9, NotChecked=166, Total=1980 [2025-02-08 06:37:09,395 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 482 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 482 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 1615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 415 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:09,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [482 Valid, 876 Invalid, 1615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1158 Invalid, 0 Unknown, 415 Unchecked, 0.9s Time] [2025-02-08 06:37:09,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-02-08 06:37:09,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 153. [2025-02-08 06:37:09,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 127 states have (on average 1.2913385826771653) internal successors, (164), 151 states have internal predecessors, (164), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:09,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 167 transitions. [2025-02-08 06:37:09,401 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 167 transitions. Word has length 31 [2025-02-08 06:37:09,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:09,401 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 167 transitions. [2025-02-08 06:37:09,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 35 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:09,402 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 167 transitions. [2025-02-08 06:37:09,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 06:37:09,402 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:09,402 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:37:09,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 06:37:09,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 06:37:09,603 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:37:09,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:09,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1144340850, now seen corresponding path program 1 times [2025-02-08 06:37:09,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:09,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144238817] [2025-02-08 06:37:09,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:09,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:09,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:37:09,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:37:09,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:09,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:09,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:37:09,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:09,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144238817] [2025-02-08 06:37:09,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144238817] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:37:09,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622823305] [2025-02-08 06:37:09,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:09,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:37:09,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:37:09,972 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:37:09,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:37:10,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:37:10,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:37:10,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:10,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:10,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-08 06:37:10,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:37:10,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:37:10,149 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:37:10,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:37:10,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-08 06:37:10,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:37:10,255 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:37:10,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2025-02-08 06:37:10,259 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 24 treesize of output 11 [2025-02-08 06:37:10,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-02-08 06:37:10,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:37:10,349 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:10,349 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 17 treesize of output 15 [2025-02-08 06:37:10,389 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:37:10,389 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:37:10,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622823305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:10,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:37:10,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [13] total 25 [2025-02-08 06:37:10,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576826620] [2025-02-08 06:37:10,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:10,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 06:37:10,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:10,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 06:37:10,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2025-02-08 06:37:10,390 INFO L87 Difference]: Start difference. First operand 153 states and 167 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:10,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:10,629 INFO L93 Difference]: Finished difference Result 186 states and 201 transitions. [2025-02-08 06:37:10,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 06:37:10,629 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-08 06:37:10,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:10,630 INFO L225 Difference]: With dead ends: 186 [2025-02-08 06:37:10,630 INFO L226 Difference]: Without dead ends: 183 [2025-02-08 06:37:10,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2025-02-08 06:37:10,631 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 175 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:10,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 342 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:37:10,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-08 06:37:10,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 145. [2025-02-08 06:37:10,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 119 states have (on average 1.2941176470588236) internal successors, (154), 143 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:10,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2025-02-08 06:37:10,634 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 31 [2025-02-08 06:37:10,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:10,634 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2025-02-08 06:37:10,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:10,634 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2025-02-08 06:37:10,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 06:37:10,634 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:10,634 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:37:10,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 06:37:10,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 06:37:10,839 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:37:10,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:10,839 INFO L85 PathProgramCache]: Analyzing trace with hash 99414862, now seen corresponding path program 1 times [2025-02-08 06:37:10,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:10,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246737519] [2025-02-08 06:37:10,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:10,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:10,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:37:10,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:37:10,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:10,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:11,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:37:11,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:11,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246737519] [2025-02-08 06:37:11,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246737519] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:11,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:11,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 06:37:11,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541099155] [2025-02-08 06:37:11,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:11,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 06:37:11,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:11,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 06:37:11,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:37:11,073 INFO L87 Difference]: Start difference. First operand 145 states and 157 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:11,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:11,352 INFO L93 Difference]: Finished difference Result 183 states and 198 transitions. [2025-02-08 06:37:11,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 06:37:11,352 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-08 06:37:11,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:11,353 INFO L225 Difference]: With dead ends: 183 [2025-02-08 06:37:11,353 INFO L226 Difference]: Without dead ends: 183 [2025-02-08 06:37:11,353 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2025-02-08 06:37:11,354 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 178 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:11,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 369 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:37:11,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-08 06:37:11,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 153. [2025-02-08 06:37:11,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 127 states have (on average 1.2834645669291338) internal successors, (163), 151 states have internal predecessors, (163), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:11,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 166 transitions. [2025-02-08 06:37:11,358 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 166 transitions. Word has length 31 [2025-02-08 06:37:11,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:11,358 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 166 transitions. [2025-02-08 06:37:11,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:11,359 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 166 transitions. [2025-02-08 06:37:11,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 06:37:11,359 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:11,359 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:37:11,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 06:37:11,359 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:37:11,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:11,359 INFO L85 PathProgramCache]: Analyzing trace with hash 99414863, now seen corresponding path program 1 times [2025-02-08 06:37:11,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:11,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509493586] [2025-02-08 06:37:11,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:11,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:11,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:37:11,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:37:11,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:11,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:11,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:37:11,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:11,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509493586] [2025-02-08 06:37:11,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509493586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:11,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:11,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-08 06:37:11,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178893750] [2025-02-08 06:37:11,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:11,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 06:37:11,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:11,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 06:37:11,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-08 06:37:11,635 INFO L87 Difference]: Start difference. First operand 153 states and 166 transitions. Second operand has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:11,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:11,970 INFO L93 Difference]: Finished difference Result 183 states and 198 transitions. [2025-02-08 06:37:11,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 06:37:11,970 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-08 06:37:11,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:11,971 INFO L225 Difference]: With dead ends: 183 [2025-02-08 06:37:11,971 INFO L226 Difference]: Without dead ends: 183 [2025-02-08 06:37:11,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-02-08 06:37:11,972 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 74 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:11,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 451 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:37:11,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-08 06:37:11,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 153. [2025-02-08 06:37:11,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 127 states have (on average 1.2755905511811023) internal successors, (162), 151 states have internal predecessors, (162), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:11,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 165 transitions. [2025-02-08 06:37:11,974 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 165 transitions. Word has length 31 [2025-02-08 06:37:11,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:11,975 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 165 transitions. [2025-02-08 06:37:11,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:11,975 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 165 transitions. [2025-02-08 06:37:11,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 06:37:11,975 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:11,975 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:37:11,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 06:37:11,975 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:37:11,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:11,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1802172733, now seen corresponding path program 1 times [2025-02-08 06:37:11,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:11,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355116746] [2025-02-08 06:37:11,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:11,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:11,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-08 06:37:11,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-08 06:37:11,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:11,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:37:12,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:12,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355116746] [2025-02-08 06:37:12,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355116746] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:37:12,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:37:12,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-08 06:37:12,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871080140] [2025-02-08 06:37:12,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:37:12,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 06:37:12,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:37:12,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 06:37:12,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-02-08 06:37:12,334 INFO L87 Difference]: Start difference. First operand 153 states and 165 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:12,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:37:12,639 INFO L93 Difference]: Finished difference Result 180 states and 194 transitions. [2025-02-08 06:37:12,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 06:37:12,639 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-08 06:37:12,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:37:12,640 INFO L225 Difference]: With dead ends: 180 [2025-02-08 06:37:12,640 INFO L226 Difference]: Without dead ends: 180 [2025-02-08 06:37:12,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2025-02-08 06:37:12,640 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 143 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:37:12,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 536 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:37:12,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-02-08 06:37:12,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 154. [2025-02-08 06:37:12,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 128 states have (on average 1.2734375) internal successors, (163), 152 states have internal predecessors, (163), 3 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:12,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2025-02-08 06:37:12,643 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 35 [2025-02-08 06:37:12,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:37:12,643 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2025-02-08 06:37:12,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 13 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:37:12,643 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2025-02-08 06:37:12,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-08 06:37:12,644 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:37:12,644 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:37:12,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 06:37:12,644 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:37:12,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:37:12,644 INFO L85 PathProgramCache]: Analyzing trace with hash 496869264, now seen corresponding path program 1 times [2025-02-08 06:37:12,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:37:12,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360250849] [2025-02-08 06:37:12,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:12,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:37:12,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 06:37:12,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 06:37:12,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:12,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:37:13,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:37:13,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360250849] [2025-02-08 06:37:13,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360250849] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:37:13,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581766941] [2025-02-08 06:37:13,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:37:13,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:37:13,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:37:13,250 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:37:13,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:37:13,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 06:37:13,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 06:37:13,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:37:13,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:37:13,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-02-08 06:37:13,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:37:13,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 06:37:13,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:37:13,401 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:37:13,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 06:37:13,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:37:13,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-08 06:37:13,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:37:13,484 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:37:13,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 38 [2025-02-08 06:37:13,487 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 24 treesize of output 11 [2025-02-08 06:37:13,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-02-08 06:37:13,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:37:13,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:37:13,571 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-02-08 06:37:13,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-02-08 06:37:13,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:37:13,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:37:13,651 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:37:13,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44 [2025-02-08 06:37:13,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-02-08 06:37:13,672 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 24 treesize of output 12 [2025-02-08 06:37:13,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:37:13,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:37:13,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:37:13,789 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_979 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (= .cse0 0) (= .cse0 1)))) is different from false [2025-02-08 06:37:13,797 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_979 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int#1| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (= .cse0 0) (= .cse0 1)))) is different from false [2025-02-08 06:37:13,853 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_977 (Array Int Int)) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_int#1| .cse1 v_ArrVal_978) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_977) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_979)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)))) (or (= .cse0 1) (= .cse0 0)))) is different from false [2025-02-08 06:37:13,867 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:13,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 59 [2025-02-08 06:37:13,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 99 [2025-02-08 06:37:13,871 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 49 treesize of output 45 [2025-02-08 06:37:13,939 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (= |c_ULTIMATE.start_main_#t~malloc6#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse3 (not .cse5)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (or (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_975))) (let ((.cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse0 1) (= (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse0 0))))) .cse3) (or .cse3 (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse4 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_975) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse4 1) (= .cse4 0))))) (or .cse5 (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_979 (Array Int Int))) (let ((.cse6 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_975) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse6 0) (= .cse6 1))))) (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_979 (Array Int Int))) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_975))) (let ((.cse7 (select (select (store .cse9 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse7 0) (= .cse7 1) (forall ((v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse8 (select (select (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse8 1) (= .cse8 0))))))))))) is different from false [2025-02-08 06:37:15,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:37:15,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 279 treesize of output 224 [2025-02-08 06:37:15,209 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 434 treesize of output 398 [2025-02-08 06:37:15,215 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 375 treesize of output 365 [2025-02-08 06:37:15,329 INFO L349 Elim1Store]: treesize reduction 4, result has 96.9 percent of original size [2025-02-08 06:37:15,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 372 treesize of output 482 [2025-02-08 06:37:15,345 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 382 treesize of output 368 [2025-02-08 06:37:43,497 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_#t~malloc3#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse6 (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_arrayElimCell_46 Int)) (or (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_979 (Array Int Int))) (let ((.cse222 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse220 (store .cse222 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse223 (select (select (store .cse220 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (forall ((v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse219 (select (select (store (store .cse220 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse219 1) (= .cse219 0)))) (forall ((v_ArrVal_971 (Array Int Int))) (let ((.cse221 (select (select (store (store (store .cse222 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 1 .cse221) (= 0 .cse221)))) (= .cse223 0) (= .cse223 1)))))) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|)))))) (.cse7 (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse218 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse217 (select (select (store .cse218 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse216 (select (select (store (store .cse218 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse216 1) (= .cse217 0) (= .cse217 1) (= .cse216 0))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|)))))) (.cse77 (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse215 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse214 (select (select (store .cse215 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse213 (select (select (store (store .cse215 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= .cse213 1) (= .cse214 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse214 1) (= .cse213 0)))))))) (.cse85 (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_19 Int)) (or (= v_prenex_19 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (forall ((v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int))) (let ((.cse212 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse212 0) (= .cse212 1))))))))) (.cse26 (not .cse0))) (and (or .cse0 (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse5 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse2 (store .cse5 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse4 (select (select (store .cse2 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store (store .cse2 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= .cse4 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= (select (select (store (store (store (store .cse5 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse4 1))))))) (or .cse0 (and .cse6 .cse7 (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_arrayElimCell_46 Int)) (or (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse8 (store .cse10 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse9 (select (select (store .cse8 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store (store .cse8 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse9 0) (= (select (select (store (store (store (store .cse10 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse9 1)))))) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|))))) (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_46 Int)) (or (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse11 (select (select (store (store (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse12 (select (select (store (store .cse13 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse11 1) (= .cse12 0) (= .cse11 0) (= .cse12 1))))) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46))))))) (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_46 Int)) (or (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse15 (store .cse17 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse14 (store (store .cse17 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975)) (.cse16 (select (select (store .cse15 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 1 (select (select (store .cse14 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store (store .cse15 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse16 0) (= (select (select (store (store .cse14 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse16 1)))))) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46))))))))) (or .cse0 (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse20 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse19 (select (select (store .cse20 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse18 (select (select (store (store .cse20 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= .cse18 1) (= .cse19 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse19 1) (= .cse18 0)))))) (or (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse25 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse24 (store .cse25 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975)) (.cse21 (store (store .cse25 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975))) (let ((.cse22 (select (select (store .cse21 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse23 (select (select (store .cse24 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store (store .cse21 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= 1 .cse22) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= 0 .cse22) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= .cse23 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= .cse23 1) (= (select (select (store (store .cse24 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))) .cse26) (or (forall ((v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_arrayElimCell_53 Int) (v_prenex_19 Int)) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse27 (select (select (store (store (store .cse28 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse27 1) (= (select (select (store (store .cse28 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= v_prenex_19 v_arrayElimCell_53) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= .cse27 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_53))))) .cse26) (or .cse0 (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse29 (store .cse31 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse30 (select (select (store .cse29 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store (store .cse29 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= .cse30 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= (select (select (store (store (store (store .cse31 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse30 1))))))) (or .cse0 (and .cse7 (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (forall ((v_arrayElimCell_46 Int)) (or (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse34 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse32 (store .cse34 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse33 (select (select (store .cse32 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store (store .cse32 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse33 0) (= (select (select (store (store (store (store .cse34 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse33 1)))))) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|))))) (forall ((v_ArrVal_969 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_arrayElimCell_46 Int)) (or (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_979 (Array Int Int))) (let ((.cse38 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse36 (store .cse38 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse39 (select (select (store .cse36 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (forall ((v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse35 (select (select (store (store .cse36 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse35 1) (= .cse35 0)))) (forall ((v_ArrVal_971 (Array Int Int))) (let ((.cse37 (select (select (store (store (store .cse38 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 1 .cse37) (= 0 .cse37)))) (= .cse39 0) (= .cse39 1)))))) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|))) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (forall ((v_ArrVal_969 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_arrayElimCell_46 Int)) (or (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse43 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse41 (store .cse43 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse40 (store (store .cse43 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975)) (.cse42 (select (select (store .cse41 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 1 (select (select (store .cse40 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store (store .cse41 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse42 0) (= (select (select (store (store .cse40 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse42 1)))))) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|))) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_arrayElimCell_46 Int)) (or (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse46 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse44 (select (select (store (store (store (store .cse46 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse45 (select (select (store (store .cse46 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse44 1) (= .cse45 0) (= .cse44 0) (= .cse45 1))))) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|))))))) (or .cse0 (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse49 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse47 (select (select (store (store (store (store .cse49 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse48 (select (select (store (store .cse49 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse47 1) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= .cse48 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= .cse47 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse48 1)))))) (or (forall ((v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_arrayElimCell_53 Int) (v_prenex_19 Int)) (let ((.cse50 (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse50 1) (= v_prenex_19 v_arrayElimCell_53) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= .cse50 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_53)))) .cse26) (or (forall ((v_prenex_20 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_prenex_19 Int)) (let ((.cse51 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse51 0) (= .cse51 1) (= v_prenex_19 |c_ULTIMATE.start_main_~x~0#1.base|) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19)))) .cse0) (or .cse26 (and (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse54 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975))) (let ((.cse53 (select (select (store .cse54 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse52 (select (select (store (store .cse54 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse52 1) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= 1 .cse53) (= 0 .cse53) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= .cse52 0))))))) (forall ((v_ArrVal_969 (Array Int Int))) (or (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse57 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse55 (store (store .cse57 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975))) (let ((.cse56 (select (select (store .cse55 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store (store .cse55 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= 1 .cse56) (= 0 .cse56) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= (select (select (store (store (store .cse57 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse60 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse58 (select (select (store (store (store .cse60 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse59 (select (select (store (store (store .cse60 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= 1 .cse58) (= .cse59 1) (= 0 .cse58) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= .cse59 0))))))))) (or .cse26 (forall ((v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_arrayElimCell_53 Int) (v_prenex_19 Int)) (let ((.cse61 (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse61 1) (= v_prenex_19 v_arrayElimCell_53) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= .cse61 0) (= v_arrayElimCell_53 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19))))) (or .cse0 (and (forall ((v_ArrVal_969 (Array Int Int))) (or (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse65 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse63 (store .cse65 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse62 (store (store .cse65 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975)) (.cse64 (select (select (store .cse63 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= 1 (select (select (store .cse62 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store (store .cse63 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= .cse64 0) (= (select (select (store (store .cse62 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse64 1)))))) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse70 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse69 (store .cse70 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse66 (select (select (store (store (store .cse70 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse68 (select (select (store .cse69 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse67 (select (select (store (store .cse69 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= 1 .cse66) (= .cse67 1) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= 0 .cse66) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= .cse68 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse68 1) (= .cse67 0)))))))) (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse73 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse71 (select (select (store (store (store (store .cse73 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse72 (select (select (store (store .cse73 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse71 1) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= .cse72 0) (= .cse71 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse72 1))))))) (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse76 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse74 (store .cse76 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse75 (select (select (store .cse74 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse74 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= .cse75 0) (= (select (select (store (store (store (store .cse76 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse75 1)))))))) .cse77)) (or .cse0 (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse81 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse79 (store .cse81 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse78 (store (store .cse81 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975)) (.cse80 (select (select (store .cse79 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= 1 (select (select (store .cse78 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store (store .cse79 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= .cse80 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= (select (select (store (store .cse78 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse80 1))))))) (or (and (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_19 Int)) (or (= v_prenex_19 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (forall ((v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse84 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse83 (select (select (store (store .cse84 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse82 (select (select (store (store (store .cse84 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse82 1) (= .cse83 0) (= .cse83 1) (= .cse82 0) (= v_arrayElimCell_53 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_53))))))))) .cse85) .cse0) (or (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse90 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse89 (store .cse90 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975)) (.cse86 (store (store .cse90 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975))) (let ((.cse87 (select (select (store .cse86 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse88 (select (select (store .cse89 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store (store .cse86 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= 1 .cse87) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= 0 .cse87) (= .cse88 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= .cse88 1) (= (select (select (store (store .cse89 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))) .cse26) (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse95 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse94 (store .cse95 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse91 (select (select (store (store (store .cse95 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse93 (select (select (store .cse94 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse92 (select (select (store (store .cse94 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= 1 .cse91) (= .cse92 1) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= 0 .cse91) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= .cse93 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse93 1) (= .cse92 0)))))))) (or (forall ((v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_arrayElimCell_53 Int) (v_prenex_19 Int)) (let ((.cse97 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse96 (select (select (store (store (store .cse97 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse96 1) (= (select (select (store (store .cse97 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= v_prenex_19 v_arrayElimCell_53) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= .cse96 0) (= v_arrayElimCell_53 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19))))) .cse26) (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse102 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse101 (store .cse102 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse98 (select (select (store (store (store .cse102 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse100 (select (select (store .cse101 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse99 (select (select (store (store .cse101 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= 1 .cse98) (= .cse99 1) (= 0 .cse98) (= .cse100 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse100 1) (= .cse99 0)))))))) (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse107 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse106 (store .cse107 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse103 (select (select (store (store (store .cse107 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse105 (select (select (store .cse106 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse104 (select (select (store (store .cse106 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= 1 .cse103) (= .cse104 1) (= 0 .cse103) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= .cse105 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse105 1) (= .cse104 0)))))))) (or .cse0 (and .cse6 .cse7 (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse110 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse108 (select (select (store (store (store (store .cse110 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse109 (select (select (store (store .cse110 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse108 1) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= .cse109 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= .cse108 0) (= .cse109 1))))))))) (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse114 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse112 (store .cse114 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse111 (store (store .cse114 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975)) (.cse113 (select (select (store .cse112 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= 1 (select (select (store .cse111 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store (store .cse112 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= .cse113 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= (select (select (store (store .cse111 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse113 1)))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|))))) (forall ((v_ArrVal_969 (Array Int Int))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse117 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse115 (store .cse117 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse116 (select (select (store .cse115 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store (store .cse115 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= .cse116 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= (select (select (store (store (store (store .cse117 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= .cse116 1)))))))) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))))))) (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_19 Int)) (or (= v_prenex_19 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (forall ((v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse120 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse119 (select (select (store (store .cse120 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse118 (select (select (store (store (store .cse120 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse118 1) (= .cse119 0) (= .cse119 1) (= v_prenex_19 v_arrayElimCell_53) (= .cse118 0))))))))) (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_19 Int)) (or (= v_prenex_19 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (forall ((v_arrayElimCell_53 Int)) (or (= v_prenex_19 v_arrayElimCell_53) (= v_arrayElimCell_53 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_53) (forall ((v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int))) (let ((.cse123 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse122 (select (select (store (store .cse123 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse121 (select (select (store (store (store .cse123 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse121 1) (= .cse122 0) (= .cse122 1) (= .cse121 0))))))))))) (or (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse126 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse124 (store .cse126 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse125 (select (select (store .cse124 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store (store .cse124 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse125 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= (select (select (store (store (store (store .cse126 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse125 1)))))) .cse0) (or .cse26 (forall ((v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_arrayElimCell_53 Int) (v_prenex_19 Int)) (let ((.cse127 (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse127 1) (= v_prenex_19 v_arrayElimCell_53) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= .cse127 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19))))) (or (and (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse130 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse128 (store .cse130 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse129 (select (select (store .cse128 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= (select (select (store (store .cse128 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= .cse129 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= (select (select (store (store (store (store .cse130 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse129 1)))))))) .cse77 (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse133 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse131 (select (select (store (store (store (store .cse133 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse132 (select (select (store (store .cse133 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse131 1) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= .cse132 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= .cse131 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse132 1))))))) (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse137 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse135 (store .cse137 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse134 (store (store .cse137 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975)) (.cse136 (select (select (store .cse135 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= 1 (select (select (store .cse134 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (= (select (select (store (store .cse135 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= .cse136 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= (select (select (store (store .cse134 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse136 1))))))))) .cse0) (or (and (forall ((v_ArrVal_969 (Array Int Int))) (or (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse140 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse138 (select (select (store (store (store .cse140 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse139 (select (select (store (store (store .cse140 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= 1 .cse138) (= .cse139 1) (= 0 .cse138) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= .cse139 0))))) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse143 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975))) (let ((.cse142 (select (select (store .cse143 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse141 (select (select (store (store .cse143 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse141 1) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= 1 .cse142) (= 0 .cse142) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= .cse141 0))))))) (forall ((v_ArrVal_969 (Array Int Int))) (or (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse146 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse144 (store (store .cse146 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975))) (let ((.cse145 (select (select (store .cse144 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= (select (select (store (store .cse144 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= 1 .cse145) (= 0 .cse145) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= (select (select (store (store (store .cse146 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) .cse26) (or (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse150 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse148 (store .cse150 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse147 (store (store .cse150 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975)) (.cse149 (select (select (store .cse148 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= 1 (select (select (store .cse147 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store (store .cse148 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= .cse149 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= (select (select (store (store .cse147 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse149 1)))))) .cse0) (or .cse0 (and .cse85 (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_19 Int)) (or (= v_prenex_19 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (forall ((v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse153 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse152 (select (select (store (store .cse153 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse151 (select (select (store (store (store .cse153 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse151 1) (= .cse152 0) (= .cse152 1) (= .cse151 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_53))))))))))) (or .cse0 (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse156 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse154 (select (select (store (store (store (store .cse156 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse155 (select (select (store (store .cse156 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse154 1) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= .cse155 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= .cse154 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse155 1)))))) (or .cse0 (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse160 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse158 (store .cse160 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse157 (store (store .cse160 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975)) (.cse159 (select (select (store .cse158 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= 1 (select (select (store .cse157 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store (store .cse158 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse159 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= (select (select (store (store .cse157 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse159 1))))))) (or .cse26 (and (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse163 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse164 (store (store .cse163 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975))) (let ((.cse162 (select (select (store .cse164 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse161 (select (select (store (store .cse164 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse161 1) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= 1 .cse162) (= 0 .cse162) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= .cse161 0) (= (select (select (store (store .cse163 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1)))))))) (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse168 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse167 (store .cse168 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse165 (select (select (store (store (store .cse168 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse166 (select (select (store (store .cse167 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= 1 .cse165) (= .cse166 1) (= 0 .cse165) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= (select (select (store .cse167 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse166 0)))))))) (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse172 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse169 (store (store .cse172 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975))) (let ((.cse170 (select (select (store .cse169 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse171 (store .cse172 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (or (= (select (select (store (store .cse169 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= 1 .cse170) (= 0 .cse170) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= (select (select (store .cse171 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store (store .cse171 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))))))) (or (and (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_19 Int)) (or (= v_prenex_19 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_arrayElimCell_53 Int)) (or (= v_arrayElimCell_53 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_53) (forall ((v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int))) (let ((.cse175 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse174 (select (select (store (store .cse175 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse173 (select (select (store (store (store .cse175 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse173 1) (= .cse174 0) (= .cse174 1) (= .cse173 0))))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19))))) .cse85) .cse0) (forall ((v_ArrVal_969 (Array Int Int))) (or (forall ((v_prenex_19 Int)) (or (forall ((v_arrayElimCell_53 Int)) (or (= v_prenex_19 v_arrayElimCell_53) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_53) (forall ((v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int))) (let ((.cse178 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse177 (select (select (store (store .cse178 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse176 (select (select (store (store (store .cse178 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse176 1) (= .cse177 0) (= .cse177 1) (= .cse176 0))))))) (= v_prenex_19 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19))) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (or (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse182 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse183 (store (store .cse182 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975))) (let ((.cse180 (select (select (store .cse183 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse179 (select (select (store (store .cse183 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse181 (select (select (store (store .cse182 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse179 1) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= 1 .cse180) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= 0 .cse180) (= .cse181 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= .cse179 0) (= .cse181 1)))))) .cse26) (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_19 Int)) (or (= v_prenex_19 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (forall ((v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse186 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse185 (select (select (store (store .cse186 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse184 (select (select (store (store (store .cse186 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse184 1) (= .cse185 0) (= .cse185 1) (= v_prenex_19 v_arrayElimCell_53) (= .cse184 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_53))))))))) (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_19 Int)) (or (= v_prenex_19 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) (forall ((v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse189 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse188 (select (select (store (store .cse189 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse187 (select (select (store (store (store .cse189 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse187 1) (= .cse188 0) (= .cse188 1) (= v_prenex_19 v_arrayElimCell_53) (= .cse187 0) (= v_arrayElimCell_53 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_53))))))))) (or .cse26 (forall ((v_prenex_21 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_prenex_18 (Array Int Int)) (v_arrayElimCell_53 Int) (v_prenex_19 Int)) (let ((.cse191 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse190 (select (select (store (store (store .cse191 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_21) v_arrayElimCell_53 v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse190 1) (= (select (select (store (store .cse191 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) v_prenex_19 v_prenex_20) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= v_prenex_19 v_arrayElimCell_53) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= .cse190 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19)))))) (or (and (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse194 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse195 (store (store .cse194 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975))) (let ((.cse193 (select (select (store .cse195 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse192 (select (select (store (store .cse195 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse192 1) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= 1 .cse193) (= 0 .cse193) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= .cse192 0) (= (select (select (store (store .cse194 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1)))))))) (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse199 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse196 (store (store .cse199 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975))) (let ((.cse197 (select (select (store .cse196 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse198 (store .cse199 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (or (= (select (select (store (store .cse196 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= 1 .cse197) (= 0 .cse197) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= (select (select (store .cse198 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= (select (select (store (store .cse198 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))))) (forall ((v_ArrVal_969 (Array Int Int))) (or (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse203 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse202 (store .cse203 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975))) (let ((.cse200 (select (select (store (store (store .cse203 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse201 (select (select (store (store .cse202 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= 1 .cse200) (= .cse201 1) (= 0 .cse200) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= (select (select (store .cse202 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 1) (= .cse201 0))))))))) .cse26) (or (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse207 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse208 (store (store .cse207 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975))) (let ((.cse205 (select (select (store .cse208 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse204 (select (select (store (store .cse208 |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse206 (select (select (store (store .cse207 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse204 1) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= 1 .cse205) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= 0 .cse205) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= .cse206 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= .cse204 0) (= .cse206 1)))))) .cse26) (or .cse0 (forall ((v_ArrVal_975 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc6#1.base_12| Int) (v_ArrVal_979 (Array Int Int)) (v_ArrVal_978 (Array Int Int)) (v_ArrVal_969 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_971 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse211 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_969))) (let ((.cse209 (select (select (store (store (store (store .cse211 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_971) v_arrayElimCell_46 v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_978) v_arrayElimCell_44 v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse210 (select (select (store (store .cse211 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_975) |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_ArrVal_979) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse209 1) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (not (= v_ArrVal_969 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_969 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= .cse210 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| v_arrayElimCell_46) (= .cse209 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_12| |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse210 1))))))))) is different from false