./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 c00e63dc 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-?-c00e63d-m [2025-02-06 10:33:26,766 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:33:26,823 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:33:26,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:33:26,832 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:33:26,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:33:26,856 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:33:26,856 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:33:26,856 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:33:26,856 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:33:26,857 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:33:26,857 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:33:26,857 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:33:26,857 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:33:26,857 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:33:26,857 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:33:26,858 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:33:26,858 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:33:26,858 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:33:26,858 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:33:26,858 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:33:26,858 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:33:26,858 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:33:26,859 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:33:26,859 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:33:26,859 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:33:26,859 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:33:26,859 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:33:26,859 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:33:26,859 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:33:26,860 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:33:26,860 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:33:26,860 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:33:26,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:33:26,860 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:33:26,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:33:26,860 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:33:26,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:33:26,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:33:26,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:33:26,861 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:33:26,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:33:26,861 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-06 10:33:27,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:33:27,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:33:27,134 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:33:27,134 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:33:27,134 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:33:27,135 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-06 10:33:28,273 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e26ee29ae/855915f2219e4ac98566329e30736c22/FLAG5a48e2848 [2025-02-06 10:33:28,571 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:33:28,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-token-1.i [2025-02-06 10:33:28,584 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e26ee29ae/855915f2219e4ac98566329e30736c22/FLAG5a48e2848 [2025-02-06 10:33:28,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e26ee29ae/855915f2219e4ac98566329e30736c22 [2025-02-06 10:33:28,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:33:28,857 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:33:28,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:33:28,859 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:33:28,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:33:28,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:33:28" (1/1) ... [2025-02-06 10:33:28,866 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dffad80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:28, skipping insertion in model container [2025-02-06 10:33:28,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:33:28" (1/1) ... [2025-02-06 10:33:28,895 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:33:29,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:33:29,067 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:33:29,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:33:29,139 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:33:29,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:29 WrapperNode [2025-02-06 10:33:29,140 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:33:29,141 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:33:29,141 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:33:29,141 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:33:29,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:29" (1/1) ... [2025-02-06 10:33:29,153 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:29" (1/1) ... [2025-02-06 10:33:29,168 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 130 [2025-02-06 10:33:29,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:33:29,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:33:29,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:33:29,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:33:29,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:29" (1/1) ... [2025-02-06 10:33:29,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:29" (1/1) ... [2025-02-06 10:33:29,187 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:29" (1/1) ... [2025-02-06 10:33:29,201 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-06 10:33:29,204 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:29" (1/1) ... [2025-02-06 10:33:29,205 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:29" (1/1) ... [2025-02-06 10:33:29,213 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:29" (1/1) ... [2025-02-06 10:33:29,214 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:29" (1/1) ... [2025-02-06 10:33:29,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:29" (1/1) ... [2025-02-06 10:33:29,219 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:29" (1/1) ... [2025-02-06 10:33:29,221 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:33:29,221 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:33:29,224 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:33:29,224 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:33:29,225 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:29" (1/1) ... [2025-02-06 10:33:29,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:33:29,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:33:29,269 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-06 10:33:29,276 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-06 10:33:29,290 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-02-06 10:33:29,290 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-02-06 10:33:29,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:33:29,290 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:33:29,290 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:33:29,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:33:29,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:33:29,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:33:29,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:33:29,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:33:29,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:33:29,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:33:29,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:33:29,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:33:29,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:33:29,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:33:29,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:33:29,435 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:33:29,436 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:33:29,735 INFO L? ?]: Removed 112 outVars from TransFormulas that were not future-live. [2025-02-06 10:33:29,735 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:33:29,743 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:33:29,743 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:33:29,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:33:29 BoogieIcfgContainer [2025-02-06 10:33:29,744 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:33:29,745 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:33:29,745 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:33:29,751 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:33:29,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:33:28" (1/3) ... [2025-02-06 10:33:29,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa46c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:33:29, skipping insertion in model container [2025-02-06 10:33:29,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:33:29" (2/3) ... [2025-02-06 10:33:29,754 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa46c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:33:29, skipping insertion in model container [2025-02-06 10:33:29,754 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:33:29" (3/3) ... [2025-02-06 10:33:29,755 INFO L128 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2025-02-06 10:33:29,767 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:33:29,768 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll-token-1.i that has 2 procedures, 149 locations, 1 initial locations, 9 loop locations, and 59 error locations. [2025-02-06 10:33:29,794 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:33:29,802 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;@2acbde17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:33:29,802 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-02-06 10:33:29,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 82 states have (on average 2.024390243902439) internal successors, (166), 141 states have internal predecessors, (166), 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-06 10:33:29,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 10:33:29,809 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:29,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 10:33:29,809 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-06 10:33:29,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:29,813 INFO L85 PathProgramCache]: Analyzing trace with hash 203532, now seen corresponding path program 1 times [2025-02-06 10:33:29,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:29,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291039308] [2025-02-06 10:33:29,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:29,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:29,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 10:33:29,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 10:33:29,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:29,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:29,931 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-06 10:33:29,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:29,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291039308] [2025-02-06 10:33:29,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291039308] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:29,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:29,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:33:29,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728835401] [2025-02-06 10:33:29,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:29,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:33:29,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:29,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:33:29,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:33:29,954 INFO L87 Difference]: Start difference. First operand has 149 states, 82 states have (on average 2.024390243902439) internal successors, (166), 141 states have internal predecessors, (166), 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.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:30,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:30,064 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2025-02-06 10:33:30,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:33:30,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 10:33:30,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:30,070 INFO L225 Difference]: With dead ends: 138 [2025-02-06 10:33:30,071 INFO L226 Difference]: Without dead ends: 136 [2025-02-06 10:33:30,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:33:30,074 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 88 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:30,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 125 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:30,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-02-06 10:33:30,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-02-06 10:33:30,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 74 states have (on average 1.8513513513513513) internal successors, (137), 134 states have internal predecessors, (137), 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-06 10:33:30,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 143 transitions. [2025-02-06 10:33:30,100 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 143 transitions. Word has length 3 [2025-02-06 10:33:30,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:30,100 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 143 transitions. [2025-02-06 10:33:30,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:30,100 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 143 transitions. [2025-02-06 10:33:30,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-02-06 10:33:30,101 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:30,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-02-06 10:33:30,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:33:30,101 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-06 10:33:30,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:30,102 INFO L85 PathProgramCache]: Analyzing trace with hash 203533, now seen corresponding path program 1 times [2025-02-06 10:33:30,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:30,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517573875] [2025-02-06 10:33:30,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:30,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:30,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 10:33:30,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 10:33:30,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:30,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:30,176 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-06 10:33:30,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:30,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517573875] [2025-02-06 10:33:30,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517573875] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:30,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:30,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:33:30,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100486036] [2025-02-06 10:33:30,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:30,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:33:30,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:30,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:33:30,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:33:30,178 INFO L87 Difference]: Start difference. First operand 136 states and 143 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:30,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:30,261 INFO L93 Difference]: Finished difference Result 133 states and 140 transitions. [2025-02-06 10:33:30,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:33:30,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-02-06 10:33:30,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:30,265 INFO L225 Difference]: With dead ends: 133 [2025-02-06 10:33:30,265 INFO L226 Difference]: Without dead ends: 133 [2025-02-06 10:33:30,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:33:30,266 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 88 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:30,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 125 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:30,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-06 10:33:30,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-02-06 10:33:30,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 74 states have (on average 1.8108108108108107) internal successors, (134), 131 states have internal predecessors, (134), 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-06 10:33:30,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 140 transitions. [2025-02-06 10:33:30,275 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 140 transitions. Word has length 3 [2025-02-06 10:33:30,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:30,275 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 140 transitions. [2025-02-06 10:33:30,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:30,276 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 140 transitions. [2025-02-06 10:33:30,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 10:33:30,276 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:30,276 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:30,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:33:30,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-06 10:33:30,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:30,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1744287272, now seen corresponding path program 1 times [2025-02-06 10:33:30,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:30,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047847162] [2025-02-06 10:33:30,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:30,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:30,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 10:33:30,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 10:33:30,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:30,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:30,400 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-06 10:33:30,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:30,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047847162] [2025-02-06 10:33:30,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047847162] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:30,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:30,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:33:30,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415203185] [2025-02-06 10:33:30,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:30,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:33:30,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:30,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:33:30,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:33:30,401 INFO L87 Difference]: Start difference. First operand 133 states and 140 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:30,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:30,558 INFO L93 Difference]: Finished difference Result 122 states and 131 transitions. [2025-02-06 10:33:30,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:33:30,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 10:33:30,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:30,559 INFO L225 Difference]: With dead ends: 122 [2025-02-06 10:33:30,559 INFO L226 Difference]: Without dead ends: 122 [2025-02-06 10:33:30,559 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-06 10:33:30,563 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 138 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:30,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 90 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:30,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-06 10:33:30,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-02-06 10:33:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 78 states have (on average 1.6025641025641026) internal successors, (125), 120 states have internal predecessors, (125), 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-06 10:33:30,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2025-02-06 10:33:30,572 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 9 [2025-02-06 10:33:30,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:30,572 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2025-02-06 10:33:30,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:30,572 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2025-02-06 10:33:30,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 10:33:30,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:30,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:30,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:33:30,572 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-06 10:33:30,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:30,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1744287273, now seen corresponding path program 1 times [2025-02-06 10:33:30,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:30,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131230504] [2025-02-06 10:33:30,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:30,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:30,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 10:33:30,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 10:33:30,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:30,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:30,686 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-06 10:33:30,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:30,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131230504] [2025-02-06 10:33:30,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131230504] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:30,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:30,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:33:30,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827731956] [2025-02-06 10:33:30,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:30,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:33:30,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:30,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:33:30,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:33:30,688 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:30,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:30,832 INFO L93 Difference]: Finished difference Result 172 states and 185 transitions. [2025-02-06 10:33:30,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:33:30,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 10:33:30,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:30,833 INFO L225 Difference]: With dead ends: 172 [2025-02-06 10:33:30,833 INFO L226 Difference]: Without dead ends: 172 [2025-02-06 10:33:30,833 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-06 10:33:30,833 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 160 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:30,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 141 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:30,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-02-06 10:33:30,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2025-02-06 10:33:30,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 118 states have (on average 1.4915254237288136) internal successors, (176), 160 states have internal predecessors, (176), 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-06 10:33:30,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 182 transitions. [2025-02-06 10:33:30,839 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 182 transitions. Word has length 9 [2025-02-06 10:33:30,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:30,839 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 182 transitions. [2025-02-06 10:33:30,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:30,839 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 182 transitions. [2025-02-06 10:33:30,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:33:30,839 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:30,840 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:30,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:33:30,840 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-06 10:33:30,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:30,840 INFO L85 PathProgramCache]: Analyzing trace with hash -745373032, now seen corresponding path program 1 times [2025-02-06 10:33:30,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:30,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970456337] [2025-02-06 10:33:30,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:30,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:30,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:33:30,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:33:30,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:30,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:30,943 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-06 10:33:30,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:30,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970456337] [2025-02-06 10:33:30,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970456337] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:30,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:30,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:33:30,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041862345] [2025-02-06 10:33:30,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:30,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:33:30,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:30,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:33:30,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:33:30,945 INFO L87 Difference]: Start difference. First operand 162 states and 182 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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-06 10:33:31,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:31,081 INFO L93 Difference]: Finished difference Result 161 states and 180 transitions. [2025-02-06 10:33:31,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:33:31,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-02-06 10:33:31,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:31,082 INFO L225 Difference]: With dead ends: 161 [2025-02-06 10:33:31,082 INFO L226 Difference]: Without dead ends: 161 [2025-02-06 10:33:31,083 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-06 10:33:31,083 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 4 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:31,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 323 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:31,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-02-06 10:33:31,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2025-02-06 10:33:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 118 states have (on average 1.4745762711864407) internal successors, (174), 159 states have internal predecessors, (174), 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-06 10:33:31,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 180 transitions. [2025-02-06 10:33:31,091 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 180 transitions. Word has length 12 [2025-02-06 10:33:31,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:31,091 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 180 transitions. [2025-02-06 10:33:31,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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-06 10:33:31,092 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 180 transitions. [2025-02-06 10:33:31,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:33:31,092 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:31,092 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:31,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:33:31,092 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-06 10:33:31,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:31,093 INFO L85 PathProgramCache]: Analyzing trace with hash -745373031, now seen corresponding path program 1 times [2025-02-06 10:33:31,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:31,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102707967] [2025-02-06 10:33:31,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:31,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:31,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:33:31,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:33:31,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:31,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:31,291 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-06 10:33:31,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:31,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102707967] [2025-02-06 10:33:31,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102707967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:31,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:31,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:33:31,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884007945] [2025-02-06 10:33:31,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:31,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:33:31,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:31,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:33:31,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:33:31,292 INFO L87 Difference]: Start difference. First operand 161 states and 180 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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-06 10:33:31,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:31,437 INFO L93 Difference]: Finished difference Result 160 states and 178 transitions. [2025-02-06 10:33:31,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:33:31,437 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-02-06 10:33:31,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:31,438 INFO L225 Difference]: With dead ends: 160 [2025-02-06 10:33:31,438 INFO L226 Difference]: Without dead ends: 160 [2025-02-06 10:33:31,438 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-06 10:33:31,440 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 2 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:31,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 318 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:31,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-02-06 10:33:31,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-02-06 10:33:31,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 118 states have (on average 1.4576271186440677) internal successors, (172), 158 states have internal predecessors, (172), 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-06 10:33:31,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 178 transitions. [2025-02-06 10:33:31,446 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 178 transitions. Word has length 12 [2025-02-06 10:33:31,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:31,446 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 178 transitions. [2025-02-06 10:33:31,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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-06 10:33:31,446 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 178 transitions. [2025-02-06 10:33:31,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 10:33:31,446 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:31,446 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:31,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:33:31,447 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-06 10:33:31,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:31,447 INFO L85 PathProgramCache]: Analyzing trace with hash -700613194, now seen corresponding path program 1 times [2025-02-06 10:33:31,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:31,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722252592] [2025-02-06 10:33:31,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:31,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:31,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:33:31,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:33:31,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:31,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:31,538 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-06 10:33:31,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:31,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722252592] [2025-02-06 10:33:31,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722252592] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:31,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:31,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:33:31,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364595068] [2025-02-06 10:33:31,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:31,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:33:31,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:31,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:33:31,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:33:31,540 INFO L87 Difference]: Start difference. First operand 160 states and 178 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:31,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:31,649 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2025-02-06 10:33:31,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:33:31,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-06 10:33:31,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:31,650 INFO L225 Difference]: With dead ends: 159 [2025-02-06 10:33:31,651 INFO L226 Difference]: Without dead ends: 159 [2025-02-06 10:33:31,651 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-06 10:33:31,651 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 4 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 318 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-06 10:33:31,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 318 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:31,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-06 10:33:31,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2025-02-06 10:33:31,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 118 states have (on average 1.4406779661016949) internal successors, (170), 157 states have internal predecessors, (170), 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-06 10:33:31,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 176 transitions. [2025-02-06 10:33:31,661 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 176 transitions. Word has length 14 [2025-02-06 10:33:31,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:31,661 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 176 transitions. [2025-02-06 10:33:31,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:31,661 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 176 transitions. [2025-02-06 10:33:31,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-06 10:33:31,661 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:31,661 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:31,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:33:31,661 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-06 10:33:31,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:31,662 INFO L85 PathProgramCache]: Analyzing trace with hash -700613193, now seen corresponding path program 1 times [2025-02-06 10:33:31,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:31,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502514774] [2025-02-06 10:33:31,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:31,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:31,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 10:33:31,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 10:33:31,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:31,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:31,821 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-06 10:33:31,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:31,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502514774] [2025-02-06 10:33:31,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502514774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:31,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:31,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:33:31,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272537355] [2025-02-06 10:33:31,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:31,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:33:31,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:31,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:33:31,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:33:31,823 INFO L87 Difference]: Start difference. First operand 159 states and 176 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:31,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:31,934 INFO L93 Difference]: Finished difference Result 158 states and 174 transitions. [2025-02-06 10:33:31,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:33:31,935 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-02-06 10:33:31,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:31,935 INFO L225 Difference]: With dead ends: 158 [2025-02-06 10:33:31,935 INFO L226 Difference]: Without dead ends: 158 [2025-02-06 10:33:31,936 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-06 10:33:31,936 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 2 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 313 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-06 10:33:31,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 313 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:31,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-02-06 10:33:31,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2025-02-06 10:33:31,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 118 states have (on average 1.423728813559322) internal successors, (168), 156 states have internal predecessors, (168), 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-06 10:33:31,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 174 transitions. [2025-02-06 10:33:31,939 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 174 transitions. Word has length 14 [2025-02-06 10:33:31,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:31,940 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 174 transitions. [2025-02-06 10:33:31,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:31,940 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 174 transitions. [2025-02-06 10:33:31,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:33:31,940 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:31,940 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:31,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:33:31,941 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-06 10:33:31,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:31,941 INFO L85 PathProgramCache]: Analyzing trace with hash -350855150, now seen corresponding path program 1 times [2025-02-06 10:33:31,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:31,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699933373] [2025-02-06 10:33:31,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:31,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:31,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:33:31,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:33:31,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:31,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:32,193 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-06 10:33:32,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:32,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699933373] [2025-02-06 10:33:32,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699933373] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:32,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:32,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:33:32,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864271921] [2025-02-06 10:33:32,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:32,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:33:32,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:32,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:33:32,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:33:32,194 INFO L87 Difference]: Start difference. First operand 158 states and 174 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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-06 10:33:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:32,562 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2025-02-06 10:33:32,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 10:33:32,563 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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-06 10:33:32,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:32,563 INFO L225 Difference]: With dead ends: 157 [2025-02-06 10:33:32,563 INFO L226 Difference]: Without dead ends: 157 [2025-02-06 10:33:32,564 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-06 10:33:32,564 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 132 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:32,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 219 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:33:32,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-02-06 10:33:32,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-02-06 10:33:32,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 118 states have (on average 1.4152542372881356) 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-06 10:33:32,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 173 transitions. [2025-02-06 10:33:32,567 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 173 transitions. Word has length 16 [2025-02-06 10:33:32,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:32,567 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 173 transitions. [2025-02-06 10:33:32,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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-06 10:33:32,568 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 173 transitions. [2025-02-06 10:33:32,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:33:32,568 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:32,568 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:32,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:33:32,568 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-06 10:33:32,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:32,569 INFO L85 PathProgramCache]: Analyzing trace with hash -350855149, now seen corresponding path program 1 times [2025-02-06 10:33:32,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:32,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348982599] [2025-02-06 10:33:32,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:32,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:32,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:33:32,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:33:32,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:32,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:32,852 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-06 10:33:32,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:32,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348982599] [2025-02-06 10:33:32,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348982599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:32,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:32,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:33:32,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022692803] [2025-02-06 10:33:32,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:32,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:33:32,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:32,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:33:32,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:33:32,854 INFO L87 Difference]: Start difference. First operand 157 states and 173 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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-06 10:33:33,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:33,328 INFO L93 Difference]: Finished difference Result 149 states and 165 transitions. [2025-02-06 10:33:33,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:33:33,329 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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-06 10:33:33,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:33,332 INFO L225 Difference]: With dead ends: 149 [2025-02-06 10:33:33,332 INFO L226 Difference]: Without dead ends: 149 [2025-02-06 10:33:33,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:33:33,333 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 141 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:33,333 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 346 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:33:33,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-02-06 10:33:33,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 133. [2025-02-06 10:33:33,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 102 states have (on average 1.392156862745098) internal successors, (142), 131 states have internal predecessors, (142), 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-06 10:33:33,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 148 transitions. [2025-02-06 10:33:33,336 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 148 transitions. Word has length 16 [2025-02-06 10:33:33,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:33,336 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 148 transitions. [2025-02-06 10:33:33,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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-06 10:33:33,336 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 148 transitions. [2025-02-06 10:33:33,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 10:33:33,337 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:33,337 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:33,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:33:33,337 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-06 10:33:33,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:33,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1573482398, now seen corresponding path program 1 times [2025-02-06 10:33:33,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:33,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076234548] [2025-02-06 10:33:33,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:33,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:33,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:33:33,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:33:33,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:33,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:33,513 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-06 10:33:33,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:33,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076234548] [2025-02-06 10:33:33,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076234548] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:33,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:33,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:33:33,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753905200] [2025-02-06 10:33:33,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:33,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:33:33,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:33,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:33:33,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:33:33,515 INFO L87 Difference]: Start difference. First operand 133 states and 148 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:33,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:33,710 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2025-02-06 10:33:33,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:33:33,710 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-06 10:33:33,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:33,711 INFO L225 Difference]: With dead ends: 136 [2025-02-06 10:33:33,711 INFO L226 Difference]: Without dead ends: 136 [2025-02-06 10:33:33,711 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-06 10:33:33,712 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 45 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:33,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 289 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:33:33,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-02-06 10:33:33,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2025-02-06 10:33:33,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 102 states have (on average 1.3823529411764706) 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-06 10:33:33,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 147 transitions. [2025-02-06 10:33:33,715 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 147 transitions. Word has length 17 [2025-02-06 10:33:33,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:33,715 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 147 transitions. [2025-02-06 10:33:33,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:33,716 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 147 transitions. [2025-02-06 10:33:33,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 10:33:33,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:33,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:33,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:33:33,716 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-06 10:33:33,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:33,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1573482399, now seen corresponding path program 1 times [2025-02-06 10:33:33,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:33,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526439030] [2025-02-06 10:33:33,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:33,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:33,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:33:33,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:33:33,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:33,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:33,912 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-06 10:33:33,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:33,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526439030] [2025-02-06 10:33:33,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526439030] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:33,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:33,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:33:33,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028934249] [2025-02-06 10:33:33,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:33,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:33:33,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:33,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:33:33,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:33:33,914 INFO L87 Difference]: Start difference. First operand 132 states and 147 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:34,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:34,112 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2025-02-06 10:33:34,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:33:34,112 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-06 10:33:34,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:34,113 INFO L225 Difference]: With dead ends: 135 [2025-02-06 10:33:34,113 INFO L226 Difference]: Without dead ends: 135 [2025-02-06 10:33:34,113 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-06 10:33:34,114 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 45 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:34,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 319 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:33:34,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-06 10:33:34,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 131. [2025-02-06 10:33:34,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 102 states have (on average 1.3725490196078431) 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-06 10:33:34,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 146 transitions. [2025-02-06 10:33:34,117 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 146 transitions. Word has length 17 [2025-02-06 10:33:34,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:34,117 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 146 transitions. [2025-02-06 10:33:34,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:34,117 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 146 transitions. [2025-02-06 10:33:34,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 10:33:34,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:34,117 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] [2025-02-06 10:33:34,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:33:34,118 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-06 10:33:34,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:34,118 INFO L85 PathProgramCache]: Analyzing trace with hash -2000601366, now seen corresponding path program 1 times [2025-02-06 10:33:34,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:34,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506553219] [2025-02-06 10:33:34,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:34,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:34,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 10:33:34,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 10:33:34,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:34,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:34,183 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-06 10:33:34,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:34,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506553219] [2025-02-06 10:33:34,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506553219] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:34,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:34,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:33:34,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945955292] [2025-02-06 10:33:34,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:34,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:33:34,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:34,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:33:34,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:33:34,185 INFO L87 Difference]: Start difference. First operand 131 states and 146 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-06 10:33:34,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:34,266 INFO L93 Difference]: Finished difference Result 134 states and 149 transitions. [2025-02-06 10:33:34,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:33:34,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 21 [2025-02-06 10:33:34,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:34,267 INFO L225 Difference]: With dead ends: 134 [2025-02-06 10:33:34,267 INFO L226 Difference]: Without dead ends: 134 [2025-02-06 10:33:34,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-06 10:33:34,267 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 201 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:34,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 82 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:34,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-06 10:33:34,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2025-02-06 10:33:34,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 102 states have (on average 1.3627450980392157) internal successors, (139), 128 states have internal predecessors, (139), 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-06 10:33:34,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 144 transitions. [2025-02-06 10:33:34,271 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 144 transitions. Word has length 21 [2025-02-06 10:33:34,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:34,271 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 144 transitions. [2025-02-06 10:33:34,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-06 10:33:34,271 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 144 transitions. [2025-02-06 10:33:34,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 10:33:34,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:34,271 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:34,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:33:34,272 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-06 10:33:34,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:34,272 INFO L85 PathProgramCache]: Analyzing trace with hash 700869320, now seen corresponding path program 1 times [2025-02-06 10:33:34,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:34,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611364233] [2025-02-06 10:33:34,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:34,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:34,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:33:34,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:33:34,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:34,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:34,328 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-06 10:33:34,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:34,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611364233] [2025-02-06 10:33:34,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611364233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:34,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:34,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:33:34,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146283713] [2025-02-06 10:33:34,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:34,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:33:34,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:34,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:33:34,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:33:34,330 INFO L87 Difference]: Start difference. First operand 130 states and 144 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-06 10:33:34,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:34,402 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2025-02-06 10:33:34,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:33:34,403 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 23 [2025-02-06 10:33:34,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:34,403 INFO L225 Difference]: With dead ends: 155 [2025-02-06 10:33:34,404 INFO L226 Difference]: Without dead ends: 155 [2025-02-06 10:33:34,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-06 10:33:34,404 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 123 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 154 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-06 10:33:34,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 154 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:34,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2025-02-06 10:33:34,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 129. [2025-02-06 10:33:34,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 102 states have (on average 1.3529411764705883) internal successors, (138), 127 states have internal predecessors, (138), 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-06 10:33:34,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2025-02-06 10:33:34,407 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 23 [2025-02-06 10:33:34,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:34,407 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2025-02-06 10:33:34,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-06 10:33:34,407 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2025-02-06 10:33:34,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 10:33:34,408 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:34,408 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] [2025-02-06 10:33:34,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 10:33:34,408 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-06 10:33:34,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:34,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1486114669, now seen corresponding path program 1 times [2025-02-06 10:33:34,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:34,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893258263] [2025-02-06 10:33:34,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:34,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:34,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:33:34,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:33:34,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:34,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:34,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-06 10:33:34,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:34,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893258263] [2025-02-06 10:33:34,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893258263] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:34,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:34,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:33:34,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6574761] [2025-02-06 10:33:34,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:34,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:33:34,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:34,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:33:34,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:33:34,449 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06 10:33:34,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:34,526 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2025-02-06 10:33:34,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:33:34,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 30 [2025-02-06 10:33:34,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:34,527 INFO L225 Difference]: With dead ends: 128 [2025-02-06 10:33:34,527 INFO L226 Difference]: Without dead ends: 128 [2025-02-06 10:33:34,527 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-06 10:33:34,528 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 6 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 277 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-06 10:33:34,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 277 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:34,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-02-06 10:33:34,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2025-02-06 10:33:34,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 126 states have internal predecessors, (136), 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-06 10:33:34,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2025-02-06 10:33:34,530 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 30 [2025-02-06 10:33:34,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:34,531 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2025-02-06 10:33:34,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-06 10:33:34,531 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2025-02-06 10:33:34,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 10:33:34,531 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:34,531 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] [2025-02-06 10:33:34,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 10:33:34,531 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-06 10:33:34,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:34,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1929879483, now seen corresponding path program 1 times [2025-02-06 10:33:34,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:34,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124499101] [2025-02-06 10:33:34,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:34,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:34,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:33:34,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:33:34,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:34,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:35,038 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-06 10:33:35,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:35,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124499101] [2025-02-06 10:33:35,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124499101] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:35,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:35,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-02-06 10:33:35,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483685131] [2025-02-06 10:33:35,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:35,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 10:33:35,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:35,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 10:33:35,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-02-06 10:33:35,040 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 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-06 10:33:35,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:35,507 INFO L93 Difference]: Finished difference Result 240 states and 261 transitions. [2025-02-06 10:33:35,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 10:33:35,507 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 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 30 [2025-02-06 10:33:35,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:35,509 INFO L225 Difference]: With dead ends: 240 [2025-02-06 10:33:35,509 INFO L226 Difference]: Without dead ends: 240 [2025-02-06 10:33:35,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2025-02-06 10:33:35,510 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 228 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:35,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 784 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:33:35,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-02-06 10:33:35,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 149. [2025-02-06 10:33:35,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 123 states have (on average 1.2926829268292683) internal successors, (159), 147 states have internal predecessors, (159), 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-06 10:33:35,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 162 transitions. [2025-02-06 10:33:35,516 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 162 transitions. Word has length 30 [2025-02-06 10:33:35,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:35,516 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 162 transitions. [2025-02-06 10:33:35,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 15 states have internal predecessors, (29), 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-06 10:33:35,516 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 162 transitions. [2025-02-06 10:33:35,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 10:33:35,518 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:35,518 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:35,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 10:33:35,518 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-06 10:33:35,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:35,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1995971330, now seen corresponding path program 1 times [2025-02-06 10:33:35,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:35,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617313240] [2025-02-06 10:33:35,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:35,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:35,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 10:33:35,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:33:35,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:35,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:35,775 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-06 10:33:35,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:35,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617313240] [2025-02-06 10:33:35,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617313240] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:35,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:35,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 10:33:35,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880462416] [2025-02-06 10:33:35,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:35,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 10:33:35,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:35,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 10:33:35,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:33:35,777 INFO L87 Difference]: Start difference. First operand 149 states and 162 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:36,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:36,079 INFO L93 Difference]: Finished difference Result 214 states and 233 transitions. [2025-02-06 10:33:36,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 10:33:36,079 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-02-06 10:33:36,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:36,080 INFO L225 Difference]: With dead ends: 214 [2025-02-06 10:33:36,080 INFO L226 Difference]: Without dead ends: 214 [2025-02-06 10:33:36,080 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-06 10:33:36,081 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 214 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:36,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 407 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:33:36,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-02-06 10:33:36,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 157. [2025-02-06 10:33:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 131 states have (on average 1.282442748091603) internal successors, (168), 155 states have internal predecessors, (168), 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-06 10:33:36,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 171 transitions. [2025-02-06 10:33:36,084 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 171 transitions. Word has length 32 [2025-02-06 10:33:36,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:36,084 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 171 transitions. [2025-02-06 10:33:36,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:36,084 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 171 transitions. [2025-02-06 10:33:36,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 10:33:36,084 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:36,085 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:36,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 10:33:36,085 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-06 10:33:36,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:36,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1995971331, now seen corresponding path program 1 times [2025-02-06 10:33:36,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:36,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891192360] [2025-02-06 10:33:36,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:36,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:36,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 10:33:36,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:33:36,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:36,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:36,385 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-06 10:33:36,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:36,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891192360] [2025-02-06 10:33:36,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891192360] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:36,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:36,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 10:33:36,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066993542] [2025-02-06 10:33:36,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:36,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 10:33:36,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:36,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 10:33:36,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:33:36,387 INFO L87 Difference]: Start difference. First operand 157 states and 171 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:36,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:36,724 INFO L93 Difference]: Finished difference Result 219 states and 238 transitions. [2025-02-06 10:33:36,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:33:36,724 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-02-06 10:33:36,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:36,725 INFO L225 Difference]: With dead ends: 219 [2025-02-06 10:33:36,725 INFO L226 Difference]: Without dead ends: 219 [2025-02-06 10:33:36,725 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-06 10:33:36,726 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 120 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:36,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 492 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:33:36,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2025-02-06 10:33:36,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 157. [2025-02-06 10:33:36,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 131 states have (on average 1.2748091603053435) internal successors, (167), 155 states have internal predecessors, (167), 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-06 10:33:36,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 170 transitions. [2025-02-06 10:33:36,731 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 170 transitions. Word has length 32 [2025-02-06 10:33:36,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:36,732 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 170 transitions. [2025-02-06 10:33:36,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:36,732 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 170 transitions. [2025-02-06 10:33:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 10:33:36,732 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:36,732 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] [2025-02-06 10:33:36,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 10:33:36,732 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-06 10:33:36,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:36,732 INFO L85 PathProgramCache]: Analyzing trace with hash 752215617, now seen corresponding path program 1 times [2025-02-06 10:33:36,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:36,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626765513] [2025-02-06 10:33:36,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:36,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:36,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 10:33:36,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:33:36,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:36,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:36,999 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-06 10:33:36,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:36,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626765513] [2025-02-06 10:33:36,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626765513] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:33:37,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011298575] [2025-02-06 10:33:37,000 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:37,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:33:37,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:33:37,002 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-06 10:33:37,006 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-06 10:33:37,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 10:33:37,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:33:37,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:37,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:37,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 10:33:37,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:33:37,235 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 10:33:37,236 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-06 10:33:37,279 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-06 10:33:37,386 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:33:37,386 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-06 10:33:37,457 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:33:37,458 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-06 10:33:37,588 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-06 10:33:37,667 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-06 10:33:37,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:33:37,865 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_59| Int) (v_ArrVal_681 (Array Int Int)) (v_ArrVal_682 (Array Int Int))) (or (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_681))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_682)) |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-06 10:33:37,877 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_59| Int) (v_ArrVal_681 (Array Int Int)) (v_ArrVal_682 (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_681))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_682)) |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-06 10:33:37,900 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:33:37,900 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-06 10:33:37,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:33:37,918 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-06 10:33:37,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:33:37,942 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-06 10:33:37,950 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-06 10:33:38,692 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:33:38,693 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-06 10:33:40,032 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-06 10:33:40,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011298575] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:33:40,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:33:40,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 34 [2025-02-06 10:33:40,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138059989] [2025-02-06 10:33:40,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:33:40,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-06 10:33:40,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:40,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-06 10:33:40,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=887, Unknown=6, NotChecked=126, Total=1190 [2025-02-06 10:33:40,035 INFO L87 Difference]: Start difference. First operand 157 states and 170 transitions. Second operand has 35 states, 34 states have (on average 2.676470588235294) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:41,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:41,211 INFO L93 Difference]: Finished difference Result 217 states and 236 transitions. [2025-02-06 10:33:41,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 10:33:41,215 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.676470588235294) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-02-06 10:33:41,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:41,217 INFO L225 Difference]: With dead ends: 217 [2025-02-06 10:33:41,217 INFO L226 Difference]: Without dead ends: 217 [2025-02-06 10:33:41,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=301, Invalid=1507, Unknown=6, NotChecked=166, Total=1980 [2025-02-06 10:33:41,218 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 580 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 417 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:41,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 977 Invalid, 1707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1251 Invalid, 0 Unknown, 417 Unchecked, 0.9s Time] [2025-02-06 10:33:41,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-02-06 10:33:41,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 162. [2025-02-06 10:33:41,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 136 states have (on average 1.2720588235294117) internal successors, (173), 160 states have internal predecessors, (173), 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-06 10:33:41,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 176 transitions. [2025-02-06 10:33:41,222 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 176 transitions. Word has length 32 [2025-02-06 10:33:41,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:41,222 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 176 transitions. [2025-02-06 10:33:41,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.676470588235294) internal successors, (91), 35 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:41,222 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 176 transitions. [2025-02-06 10:33:41,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 10:33:41,222 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:41,223 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] [2025-02-06 10:33:41,231 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 10:33:41,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:33:41,423 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-06 10:33:41,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:41,424 INFO L85 PathProgramCache]: Analyzing trace with hash 752215618, now seen corresponding path program 1 times [2025-02-06 10:33:41,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:41,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208060230] [2025-02-06 10:33:41,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:41,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:41,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 10:33:41,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:33:41,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:41,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:41,845 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-06 10:33:41,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:41,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208060230] [2025-02-06 10:33:41,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208060230] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:33:41,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646623676] [2025-02-06 10:33:41,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:41,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:33:41,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:33:41,848 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-06 10:33:41,852 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-06 10:33:41,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 10:33:41,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:33:41,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:41,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:41,939 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 10:33:41,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:33:41,995 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-06 10:33:42,030 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:33:42,030 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-06 10:33:42,063 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-06 10:33:42,072 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-06 10:33:42,153 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:33:42,154 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-06 10:33:42,156 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-06 10:33:42,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 16 treesize of output 8 [2025-02-06 10:33:42,207 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-06 10:33:42,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:33:42,271 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-06 10:33:42,318 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-06 10:33:42,318 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:33:42,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646623676] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:42,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:33:42,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 25 [2025-02-06 10:33:42,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160846487] [2025-02-06 10:33:42,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:42,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-06 10:33:42,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:42,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-06 10:33:42,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2025-02-06 10:33:42,321 INFO L87 Difference]: Start difference. First operand 162 states and 176 transitions. Second operand has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:42,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:42,598 INFO L93 Difference]: Finished difference Result 185 states and 200 transitions. [2025-02-06 10:33:42,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 10:33:42,599 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-02-06 10:33:42,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:42,599 INFO L225 Difference]: With dead ends: 185 [2025-02-06 10:33:42,599 INFO L226 Difference]: Without dead ends: 182 [2025-02-06 10:33:42,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=712, Unknown=0, NotChecked=0, Total=870 [2025-02-06 10:33:42,600 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 162 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:42,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 353 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:33:42,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-02-06 10:33:42,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 154. [2025-02-06 10:33:42,602 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-06 10:33:42,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2025-02-06 10:33:42,603 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 32 [2025-02-06 10:33:42,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:42,604 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2025-02-06 10:33:42,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:33:42,604 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2025-02-06 10:33:42,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 10:33:42,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:42,605 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:42,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 10:33:42,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:33:42,809 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-06 10:33:42,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:42,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1214402472, now seen corresponding path program 1 times [2025-02-06 10:33:42,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:42,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836954009] [2025-02-06 10:33:42,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:42,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:42,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 10:33:42,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 10:33:42,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:42,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:43,263 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-06 10:33:43,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:43,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836954009] [2025-02-06 10:33:43,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836954009] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:43,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:43,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 10:33:43,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183239613] [2025-02-06 10:33:43,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:43,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 10:33:43,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:43,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 10:33:43,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:33:43,264 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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-06 10:33:43,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:43,667 INFO L93 Difference]: Finished difference Result 181 states and 195 transitions. [2025-02-06 10:33:43,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 10:33:43,668 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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 36 [2025-02-06 10:33:43,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:43,669 INFO L225 Difference]: With dead ends: 181 [2025-02-06 10:33:43,669 INFO L226 Difference]: Without dead ends: 181 [2025-02-06 10:33:43,669 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 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-06 10:33:43,669 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 132 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:43,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 614 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:33:43,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-02-06 10:33:43,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 155. [2025-02-06 10:33:43,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 129 states have (on average 1.2713178294573644) internal successors, (164), 153 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-06 10:33:43,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 167 transitions. [2025-02-06 10:33:43,672 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 167 transitions. Word has length 36 [2025-02-06 10:33:43,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:43,672 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 167 transitions. [2025-02-06 10:33:43,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 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-06 10:33:43,672 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 167 transitions. [2025-02-06 10:33:43,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:33:43,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:43,673 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:43,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 10:33:43,673 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-06 10:33:43,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:43,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1550204376, now seen corresponding path program 1 times [2025-02-06 10:33:43,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:43,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052235339] [2025-02-06 10:33:43,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:43,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:43,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:33:43,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:33:43,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:43,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:43,719 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-06 10:33:43,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:43,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052235339] [2025-02-06 10:33:43,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052235339] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:33:43,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:33:43,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:33:43,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586857277] [2025-02-06 10:33:43,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:33:43,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:33:43,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:33:43,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:33:43,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:33:43,720 INFO L87 Difference]: Start difference. First operand 155 states and 167 transitions. Second operand has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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-06 10:33:43,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:33:43,808 INFO L93 Difference]: Finished difference Result 168 states and 177 transitions. [2025-02-06 10:33:43,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:33:43,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2025-02-06 10:33:43,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:33:43,809 INFO L225 Difference]: With dead ends: 168 [2025-02-06 10:33:43,809 INFO L226 Difference]: Without dead ends: 168 [2025-02-06 10:33:43,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-06 10:33:43,810 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 91 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:33:43,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 133 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:33:43,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-02-06 10:33:43,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 157. [2025-02-06 10:33:43,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 131 states have (on average 1.2671755725190839) internal successors, (166), 155 states have internal predecessors, (166), 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-06 10:33:43,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 169 transitions. [2025-02-06 10:33:43,813 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 169 transitions. Word has length 42 [2025-02-06 10:33:43,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:33:43,813 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 169 transitions. [2025-02-06 10:33:43,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 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-06 10:33:43,813 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 169 transitions. [2025-02-06 10:33:43,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 10:33:43,814 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:33:43,814 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:33:43,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 10:33:43,814 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-06 10:33:43,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:33:43,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1556727390, now seen corresponding path program 1 times [2025-02-06 10:33:43,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:33:43,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072823872] [2025-02-06 10:33:43,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:43,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:33:43,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 10:33:43,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:33:43,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:43,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:44,421 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-06 10:33:44,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:33:44,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072823872] [2025-02-06 10:33:44,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072823872] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:33:44,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033584723] [2025-02-06 10:33:44,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:33:44,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:33:44,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:33:44,423 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-06 10:33:44,425 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-06 10:33:44,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 10:33:44,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:33:44,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:33:44,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:33:44,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-02-06 10:33:44,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:33:44,531 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-06 10:33:44,539 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-06 10:33:44,571 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:33:44,571 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-06 10:33:44,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:33:44,580 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-06 10:33:44,591 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-06 10:33:44,642 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:33:44,643 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-06 10:33:44,646 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-06 10:33:44,666 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-06 10:33:44,684 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-06 10:33:44,725 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-06 10:33:44,744 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-02-06 10:33:44,744 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-06 10:33:44,753 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-06 10:33:44,761 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-06 10:33:44,832 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:33:44,833 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-06 10:33:44,835 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-06 10:33:44,851 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-06 10:33:44,856 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-06 10:33:44,893 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-06 10:33:44,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:33:44,964 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1021 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1021) |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-06 10:33:44,969 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1021 (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_1021) |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-06 10:33:44,980 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1021 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_1020) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_1019) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1021) |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-06 10:33:44,986 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1021 (Array Int Int)) (v_ArrVal_1020 (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_1020) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1019) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1021)) |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-06 10:33:44,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:33:44,995 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-06 10:33:44,997 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-06 10:33:45,000 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-06 10:33:45,035 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (= |c_ULTIMATE.start_main_#t~malloc6#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse0 (not .cse9)) (.cse3 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (or .cse0 (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1021 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse2 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1018))) (let ((.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_1020) v_arrayElimCell_44 v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse1 0) (= .cse1 1) (= (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3) 0)))))) (or .cse0 (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1021 (Array Int Int)) (v_ArrVal_1020 (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_1018) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_1020) v_arrayElimCell_44 v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse4 0) (= .cse4 1))))) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1021 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1018))) (let ((.cse5 (select (select (store (store .cse7 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_1020) v_arrayElimCell_44 v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3)) (.cse6 (select (select (store .cse7 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse5 0) (= .cse6 1) (= .cse5 1) (= .cse6 0))))) (or (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1021 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1018) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) .cse3))) (or (= .cse8 1) (= .cse8 0)))) .cse9)))) is different from false [2025-02-06 10:33:45,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:33:45,873 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-06 10:33:45,878 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-06 10:33:45,884 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-06 10:33:45,999 INFO L349 Elim1Store]: treesize reduction 4, result has 96.9 percent of original size [2025-02-06 10:33:46,000 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-06 10:33:46,016 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-06 10:34:00,547 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (= |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|)) (.cse2 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (let ((.cse13 (forall ((v_ArrVal_1011 (Array Int Int))) (or (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_arrayElimCell_46 Int)) (or (forall ((v_prenex_18 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse131 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse132 (store .cse131 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19))) (let ((.cse129 (select (select (store .cse132 v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse128 (select (select (store (store .cse132 v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse130 (select (select (store (store (store .cse131 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_46 v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse128 1) (= .cse129 1) (= .cse130 0) (= .cse129 0) (= .cse128 0) (= .cse130 1)))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= v_prenex_18 |c_ULTIMATE.start_main_~x~0#1.base|))) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46)))))) (.cse32 (forall ((v_ArrVal_1011 (Array Int Int))) (or (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1021 (Array Int Int))) (let ((.cse127 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1018) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= .cse127 1) (= .cse127 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))))))) (.cse3 (not .cse14)) (.cse12 (forall ((v_ArrVal_1011 (Array Int Int))) (or (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse126 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19))) (let ((.cse125 (select (select (store .cse126 v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse124 (select (select (store (store .cse126 v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse124 1) (= .cse125 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= .cse125 0) (= v_prenex_18 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse124 0))))) (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|))))))) (.cse20 (forall ((v_ArrVal_1011 (Array Int Int))) (or (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_46 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse122 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse123 (store .cse122 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19))) (let ((.cse120 (select (select (store .cse123 v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse119 (select (select (store (store .cse123 v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse121 (select (select (store (store (store .cse122 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_46 v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse119 1) (= .cse120 1) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= .cse121 0) (= .cse120 0) (= v_prenex_18 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse119 0) (= .cse121 1)))))))))) (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1021 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse0 (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_53 v_ArrVal_1018) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse0 1) (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= .cse0 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_53) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|)))) .cse3) (or (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1011 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse5 (store .cse7 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19))) (let ((.cse4 (select (select (store (store .cse5 v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse6 (select (select (store (store (store .cse7 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_46 v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse4 1) (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store .cse5 v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= .cse6 0) (= v_prenex_18 v_arrayElimCell_46) (= .cse4 0) (= .cse6 1)))))) .cse3) (or (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1011 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse9 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse11 (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_46 v_prenex_19))) (let ((.cse8 (select (select (store (store .cse11 v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse10 (select (select (store .cse11 v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse8 1) (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store (store .cse9 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= .cse10 0) (= .cse8 0) (= v_prenex_18 v_arrayElimCell_46) (= .cse10 1)))))) .cse3) (or (and .cse12 .cse13) .cse14) (or (and (forall ((v_ArrVal_1011 (Array Int Int))) (or (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_arrayElimCell_46 Int)) (or (forall ((v_prenex_18 Int)) (or (forall ((v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse18 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse19 (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19))) (let ((.cse16 (select (select (store .cse19 v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse15 (select (select (store (store .cse19 v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse17 (select (select (store (store (store .cse18 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_46 v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse15 1) (= .cse16 1) (= .cse17 0) (= .cse16 0) (= .cse15 0) (= .cse17 1)))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= v_prenex_18 v_arrayElimCell_46) (= v_prenex_18 |c_ULTIMATE.start_main_~x~0#1.base|))) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46))))) .cse12 .cse20 .cse13) .cse14) (or .cse3 (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1011 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse21 (store (store .cse24 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_46 v_prenex_19))) (let ((.cse22 (store .cse24 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19)) (.cse23 (select (select (store .cse21 v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= (select (select (store (store .cse21 v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store .cse22 v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= .cse23 0) (= v_prenex_18 v_arrayElimCell_46) (= (select (select (store (store .cse22 v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse23 1))))))) (or .cse3 (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1011 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse26 (store .cse28 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19))) (let ((.cse25 (select (select (store (store .cse26 v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse27 (select (select (store (store (store .cse28 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_46 v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse25 1) (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store .cse26 v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= .cse27 0) (= v_prenex_18 v_arrayElimCell_46) (= .cse25 0) (= .cse27 1))))))) (forall ((v_ArrVal_1011 (Array Int Int))) (or (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_arrayElimCell_53 Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (v_ArrVal_1021 (Array Int Int))) (let ((.cse31 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse29 (select (select (store (store (store .cse31 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_53 v_ArrVal_1018) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse30 (select (select (store (store .cse31 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1018) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse29 1) (= .cse29 0) (= .cse30 1) (= .cse30 0))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_53) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))))) (or (and .cse32 (forall ((v_ArrVal_1011 (Array Int Int))) (or (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_arrayElimCell_53 Int)) (or (= v_arrayElimCell_53 |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (v_ArrVal_1021 (Array Int Int))) (let ((.cse35 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse33 (select (select (store (store (store .cse35 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_53 v_ArrVal_1018) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse34 (select (select (store (store .cse35 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1018) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse33 1) (= .cse33 0) (= .cse34 1) (= .cse34 0))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_53)))))) .cse14) (forall ((v_ArrVal_1011 (Array Int Int))) (or (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_46 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse39 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse40 (store .cse39 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19))) (let ((.cse37 (select (select (store .cse40 v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse36 (select (select (store (store .cse40 v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse38 (select (select (store (store (store .cse39 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_46 v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse36 1) (= .cse37 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= .cse38 0) (= .cse37 0) (= v_prenex_18 v_arrayElimCell_46) (= v_prenex_18 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse36 0) (= .cse38 1)))))))) (or (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1011 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse44 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse41 (store (store .cse44 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_46 v_prenex_19))) (let ((.cse42 (store .cse44 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19)) (.cse43 (select (select (store .cse41 v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= (select (select (store (store .cse41 v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store .cse42 v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= .cse43 0) (= v_prenex_18 v_arrayElimCell_46) (= (select (select (store (store .cse42 v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse43 1)))))) .cse3) (or (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1011 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse46 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse48 (store (store .cse46 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_46 v_prenex_19))) (let ((.cse45 (select (select (store (store .cse48 v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse47 (select (select (store .cse48 v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse45 1) (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store (store .cse46 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= .cse47 0) (= .cse45 0) (= v_prenex_18 v_arrayElimCell_46) (= .cse47 1)))))) .cse3) (or .cse3 (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1021 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse50 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse49 (select (select (store (store (store .cse50 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_53 v_ArrVal_1018) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse49 1) (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= .cse49 0) (= (select (select (store (store .cse50 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1018) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_53) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|)))))) (or .cse3 (and (forall ((v_ArrVal_1011 (Array Int Int))) (or (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_46 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse53 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse51 (store (store .cse53 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_46 v_prenex_19))) (let ((.cse52 (select (select (store .cse51 v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= (select (select (store (store .cse51 v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= .cse52 0) (= v_prenex_18 v_arrayElimCell_46) (= (select (select (store (store (store .cse53 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse52 1)))))))) (forall ((v_ArrVal_1011 (Array Int Int))) (or (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_46 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse56 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse54 (select (select (store (store (store .cse56 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse55 (select (select (store (store (store .cse56 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_46 v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse54 1) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= .cse55 0) (= v_prenex_18 v_arrayElimCell_46) (= .cse54 0) (= .cse55 1))))) (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (forall ((v_ArrVal_1011 (Array Int Int))) (or (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_46 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse59 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_46 v_prenex_19))) (let ((.cse57 (select (select (store (store .cse59 v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse58 (select (select (store .cse59 v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse57 1) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= .cse58 0) (= .cse57 0) (= v_prenex_18 v_arrayElimCell_46) (= .cse58 1))))))))) (or (and .cse32 (forall ((v_ArrVal_1011 (Array Int Int))) (or (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (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_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (v_ArrVal_1021 (Array Int Int))) (let ((.cse62 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse60 (select (select (store (store (store .cse62 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_53 v_ArrVal_1018) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse61 (select (select (store (store .cse62 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1018) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse60 1) (= .cse60 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= .cse61 1) (= .cse61 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|)))))))))) .cse14) (or (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1011 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse66 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse63 (store (store .cse66 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_46 v_prenex_19))) (let ((.cse64 (store .cse66 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19)) (.cse65 (select (select (store .cse63 v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= (select (select (store (store .cse63 v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store .cse64 v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= .cse65 0) (= v_prenex_18 v_arrayElimCell_46) (= (select (select (store (store .cse64 v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse65 1)))))) .cse3) (forall ((v_ArrVal_1011 (Array Int Int))) (or (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_46 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse70 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse71 (store .cse70 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19))) (let ((.cse68 (select (select (store .cse71 v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse67 (select (select (store (store .cse71 v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse69 (select (select (store (store (store .cse70 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_46 v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse67 1) (= .cse68 1) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= .cse69 0) (= .cse68 0) (= v_prenex_18 v_arrayElimCell_46) (= v_prenex_18 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse67 0) (= .cse69 1)))))))) (forall ((v_ArrVal_1011 (Array Int Int))) (or (forall ((v_arrayElimCell_53 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (v_ArrVal_1021 (Array Int Int))) (let ((.cse74 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse72 (select (select (store (store (store .cse74 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_53 v_ArrVal_1018) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse73 (select (select (store (store .cse74 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1018) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse72 1) (= .cse72 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= .cse73 1) (= .cse73 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_53) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_53))) (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1021 (Array Int Int))) (let ((.cse75 (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1018) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= .cse75 1) (= .cse75 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|)))) .cse14) (or (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse78 (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19))) (let ((.cse77 (select (select (store .cse78 v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse76 (select (select (store (store .cse78 v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse76 1) (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= .cse77 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= .cse77 0) (= v_prenex_18 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse76 0))))) .cse14) (or .cse3 (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1021 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse80 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse79 (select (select (store (store (store .cse80 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_53 v_ArrVal_1018) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse79 1) (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= .cse79 0) (= (select (select (store (store .cse80 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1018) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_53) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_53) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|)))))) (or .cse3 (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1011 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse82 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse84 (store (store .cse82 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_46 v_prenex_19))) (let ((.cse81 (select (select (store (store .cse84 v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse83 (select (select (store .cse84 v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse81 1) (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store (store .cse82 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= .cse83 0) (= .cse81 0) (= v_prenex_18 v_arrayElimCell_46) (= .cse83 1))))))) (or .cse3 (and (forall ((v_ArrVal_1011 (Array Int Int))) (or (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_46 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse87 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse85 (select (select (store (store (store .cse87 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse86 (select (select (store (store (store .cse87 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_46 v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse85 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= .cse86 0) (= v_prenex_18 v_arrayElimCell_46) (= .cse85 0) (= .cse86 1))))))) (forall ((v_ArrVal_1011 (Array Int Int))) (or (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_46 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse90 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_46 v_prenex_19))) (let ((.cse88 (select (select (store (store .cse90 v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse89 (select (select (store .cse90 v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse88 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= .cse89 0) (= .cse88 0) (= v_prenex_18 v_arrayElimCell_46) (= .cse89 1))))))) (forall ((v_ArrVal_1011 (Array Int Int))) (or (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_46 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse93 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse91 (store (store .cse93 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_46 v_prenex_19))) (let ((.cse92 (select (select (store .cse91 v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= (select (select (store (store .cse91 v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= .cse92 0) (= v_prenex_18 v_arrayElimCell_46) (= (select (select (store (store (store .cse93 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse92 1)))))))))) (forall ((v_ArrVal_1011 (Array Int Int))) (or (forall ((v_arrayElimCell_53 Int)) (or (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int)) (or (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (forall ((v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (v_ArrVal_1021 (Array Int Int))) (let ((.cse96 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse94 (select (select (store (store (store .cse96 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_53 v_ArrVal_1018) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse95 (select (select (store (store .cse96 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1018) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse94 1) (= .cse94 0) (= .cse95 1) (= .cse95 0))))) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_53) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_53))) (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (or .cse3 (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (v_ArrVal_1011 (Array Int Int)) (v_ArrVal_1021 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse97 (select (select (store (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_53 v_ArrVal_1018) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse97 1) (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= .cse97 0) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_53) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_53) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))))) (forall ((v_ArrVal_1011 (Array Int Int))) (or (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_13| Int) (v_ArrVal_1018 (Array Int Int)) (v_ArrVal_1014 (Array Int Int)) (v_ArrVal_1021 (Array Int Int)) (v_arrayElimCell_53 Int)) (let ((.cse100 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse98 (select (select (store (store (store .cse100 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1014) v_arrayElimCell_53 v_ArrVal_1018) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse99 (select (select (store (store .cse100 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1018) |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_ArrVal_1021) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse98 1) (= .cse98 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_#t~malloc3#1.base|) (= .cse99 1) (= .cse99 0) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| v_arrayElimCell_53) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_13| |c_ULTIMATE.start_main_~x~0#1.base|))))))) (or (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_46 Int) (v_ArrVal_1011 (Array Int Int)) (v_prenex_22 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse104 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse102 (store .cse104 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19))) (let ((.cse101 (select (select (store (store .cse102 v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse103 (select (select (store (store (store .cse104 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_46 v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse101 1) (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= (select (select (store .cse102 v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= .cse103 0) (= v_prenex_18 v_arrayElimCell_46) (= .cse101 0) (= .cse103 1)))))) .cse3) (or (and (forall ((v_ArrVal_1011 (Array Int Int))) (or (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_46 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse107 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse105 (store (store .cse107 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_46 v_prenex_19))) (let ((.cse106 (select (select (store .cse105 v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= (select (select (store (store .cse105 v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= .cse106 0) (= v_prenex_18 v_arrayElimCell_46) (= (select (select (store (store (store .cse107 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2) 0) (= .cse106 1)))))))) (forall ((v_ArrVal_1011 (Array Int Int))) (or (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_46 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse110 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse108 (select (select (store (store (store .cse110 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19) v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse109 (select (select (store (store (store .cse110 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_46 v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse108 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= .cse109 0) (= v_prenex_18 v_arrayElimCell_46) (= .cse108 0) (= .cse109 1))))))) (forall ((v_ArrVal_1011 (Array Int Int))) (or (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|)))) (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_46 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse113 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_46 v_prenex_19))) (let ((.cse111 (select (select (store (store .cse113 v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse112 (select (select (store .cse113 v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse111 1) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= .cse112 0) (= .cse111 0) (= v_prenex_18 v_arrayElimCell_46) (= .cse112 1)))))))) .cse3) (or (and .cse12 .cse20) .cse14) (forall ((v_ArrVal_1011 (Array Int Int))) (or (forall ((v_prenex_18 Int) (v_prenex_19 (Array Int Int)) (v_prenex_20 (Array Int Int)) (v_arrayElimCell_46 Int) (v_prenex_22 (Array Int Int)) (v_ArrVal_1020 (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse117 (store |c_#memory_int#1| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1011))) (let ((.cse118 (store .cse117 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_19))) (let ((.cse115 (select (select (store .cse118 v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse114 (select (select (store (store .cse118 v_prenex_18 v_ArrVal_1020) v_arrayElimCell_44 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2)) (.cse116 (select (select (store (store (store .cse117 |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_20) v_arrayElimCell_46 v_prenex_19) v_prenex_18 v_prenex_22) |c_ULTIMATE.start_main_~head~0#1.base|) .cse2))) (or (= .cse114 1) (= .cse115 1) (= v_arrayElimCell_46 |c_ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_46) (= |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_18) (= .cse116 0) (= .cse115 0) (= v_prenex_18 v_arrayElimCell_46) (= v_prenex_18 |c_ULTIMATE.start_main_~x~0#1.base|) (= .cse114 0) (= .cse116 1)))))) (not (= v_ArrVal_1011 (store .cse1 |c_ULTIMATE.start_main_~x~0#1.offset| (select v_ArrVal_1011 |c_ULTIMATE.start_main_~x~0#1.offset|))))))))) is different from false