./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0513.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/memsafety/test-0513.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 aaec9a71c2206d3d9fbfa56b3c6172e3ff60aad385f0ad346fdbde53f8ce1a2e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:17:50,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:17:50,560 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:17:50,563 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:17:50,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:17:50,578 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:17:50,579 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:17:50,579 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:17:50,579 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:17:50,579 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:17:50,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:17:50,579 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:17:50,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:17:50,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:17:50,580 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:17:50,580 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:17:50,580 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:17:50,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:17:50,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:17:50,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:17:50,580 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:17:50,581 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:17:50,581 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:17:50,581 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:17:50,581 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:17:50,581 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:17:50,581 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:17:50,581 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:17:50,581 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:17:50,581 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:17:50,581 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:17:50,582 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:17:50,582 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:17:50,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:17:50,582 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:17:50,582 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:17:50,582 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:17:50,582 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:17:50,582 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:17:50,582 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:17:50,582 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:17:50,582 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:17:50,583 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 -> aaec9a71c2206d3d9fbfa56b3c6172e3ff60aad385f0ad346fdbde53f8ce1a2e [2025-02-06 10:17:50,861 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:17:50,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:17:50,872 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:17:50,873 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:17:50,873 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:17:50,877 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0513.i [2025-02-06 10:17:52,047 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/110eb83e1/3b0ca1945fa6461eb15893c135976abb/FLAG7e3fd0a50 [2025-02-06 10:17:52,316 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:17:52,317 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety/test-0513.i [2025-02-06 10:17:52,328 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/110eb83e1/3b0ca1945fa6461eb15893c135976abb/FLAG7e3fd0a50 [2025-02-06 10:17:52,631 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/110eb83e1/3b0ca1945fa6461eb15893c135976abb [2025-02-06 10:17:52,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:17:52,641 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:17:52,643 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:17:52,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:17:52,650 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:17:52,651 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:17:52" (1/1) ... [2025-02-06 10:17:52,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61008295 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:52, skipping insertion in model container [2025-02-06 10:17:52,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:17:52" (1/1) ... [2025-02-06 10:17:52,697 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:17:53,074 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:17:53,081 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:17:53,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:17:53,140 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:17:53,140 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:53 WrapperNode [2025-02-06 10:17:53,141 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:17:53,142 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:17:53,142 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:17:53,142 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:17:53,146 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:17:53" (1/1) ... [2025-02-06 10:17:53,155 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:17:53" (1/1) ... [2025-02-06 10:17:53,170 INFO L138 Inliner]: procedures = 123, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 118 [2025-02-06 10:17:53,172 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:17:53,173 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:17:53,173 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:17:53,173 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:17:53,178 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:53" (1/1) ... [2025-02-06 10:17:53,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:53" (1/1) ... [2025-02-06 10:17:53,182 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:53" (1/1) ... [2025-02-06 10:17:53,199 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [2, 26]. 93 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 11 writes are split as follows [0, 11]. [2025-02-06 10:17:53,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:53" (1/1) ... [2025-02-06 10:17:53,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:53" (1/1) ... [2025-02-06 10:17:53,205 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:53" (1/1) ... [2025-02-06 10:17:53,205 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:53" (1/1) ... [2025-02-06 10:17:53,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:53" (1/1) ... [2025-02-06 10:17:53,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:53" (1/1) ... [2025-02-06 10:17:53,210 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:17:53,210 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:17:53,210 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:17:53,210 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:17:53,211 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:53" (1/1) ... [2025-02-06 10:17:53,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:17:53,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:17:53,243 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:17:53,248 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:17:53,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:17:53,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:17:53,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:17:53,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:17:53,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:17:53,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:17:53,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:17:53,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:17:53,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:17:53,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:17:53,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:17:53,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:17:53,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:17:53,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:17:53,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:17:53,339 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:17:53,341 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:17:53,588 INFO L? ?]: Removed 146 outVars from TransFormulas that were not future-live. [2025-02-06 10:17:53,589 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:17:53,596 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:17:53,596 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:17:53,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:17:53 BoogieIcfgContainer [2025-02-06 10:17:53,597 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:17:53,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:17:53,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:17:53,601 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:17:53,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:17:52" (1/3) ... [2025-02-06 10:17:53,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd85b5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:17:53, skipping insertion in model container [2025-02-06 10:17:53,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:17:53" (2/3) ... [2025-02-06 10:17:53,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dd85b5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:17:53, skipping insertion in model container [2025-02-06 10:17:53,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:17:53" (3/3) ... [2025-02-06 10:17:53,603 INFO L128 eAbstractionObserver]: Analyzing ICFG test-0513.i [2025-02-06 10:17:53,612 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:17:53,613 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-0513.i that has 1 procedures, 132 locations, 1 initial locations, 4 loop locations, and 62 error locations. [2025-02-06 10:17:53,637 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:17:53,645 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;@5c911201, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:17:53,645 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2025-02-06 10:17:53,647 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 69 states have (on average 2.072463768115942) internal successors, (143), 131 states have internal predecessors, (143), 0 states have call successors, (0), 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:17:53,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 10:17:53,650 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:53,650 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 10:17:53,651 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:17:53,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:53,654 INFO L85 PathProgramCache]: Analyzing trace with hash 166970310, now seen corresponding path program 1 times [2025-02-06 10:17:53,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:53,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208864317] [2025-02-06 10:17:53,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:53,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:53,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 10:17:53,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 10:17:53,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:53,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:53,732 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:17:53,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:53,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208864317] [2025-02-06 10:17:53,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208864317] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:53,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:53,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:17:53,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133310579] [2025-02-06 10:17:53,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:53,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 10:17:53,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:53,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 10:17:53,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:17:53,752 INFO L87 Difference]: Start difference. First operand has 132 states, 69 states have (on average 2.072463768115942) internal successors, (143), 131 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:53,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:53,763 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2025-02-06 10:17:53,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 10:17:53,764 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-06 10:17:53,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:53,768 INFO L225 Difference]: With dead ends: 132 [2025-02-06 10:17:53,768 INFO L226 Difference]: Without dead ends: 130 [2025-02-06 10:17:53,769 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:17:53,771 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:53,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:17:53,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-06 10:17:53,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-02-06 10:17:53,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 68 states have (on average 2.0294117647058822) internal successors, (138), 129 states have internal predecessors, (138), 0 states have call successors, (0), 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:17:53,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2025-02-06 10:17:53,794 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 5 [2025-02-06 10:17:53,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:53,794 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2025-02-06 10:17:53,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:53,794 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2025-02-06 10:17:53,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:17:53,794 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:53,794 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:17:53,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:17:53,795 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:17:53,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:53,796 INFO L85 PathProgramCache]: Analyzing trace with hash 881118453, now seen corresponding path program 1 times [2025-02-06 10:17:53,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:53,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69682370] [2025-02-06 10:17:53,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:53,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:53,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:17:53,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:17:53,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:53,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:53,826 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:17:53,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:53,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69682370] [2025-02-06 10:17:53,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69682370] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:53,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:53,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:17:53,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071518984] [2025-02-06 10:17:53,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:53,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:17:53,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:53,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:17:53,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:17:53,828 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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:17:53,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:53,942 INFO L93 Difference]: Finished difference Result 177 states and 187 transitions. [2025-02-06 10:17:53,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:17:53,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-02-06 10:17:53,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:53,944 INFO L225 Difference]: With dead ends: 177 [2025-02-06 10:17:53,944 INFO L226 Difference]: Without dead ends: 176 [2025-02-06 10:17:53,944 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:17:53,944 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 43 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:53,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 192 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:17:53,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-02-06 10:17:53,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 133. [2025-02-06 10:17:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 71 states have (on average 2.0) internal successors, (142), 132 states have internal predecessors, (142), 0 states have call successors, (0), 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:17:53,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2025-02-06 10:17:53,951 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 6 [2025-02-06 10:17:53,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:53,951 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2025-02-06 10:17:53,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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:17:53,951 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2025-02-06 10:17:53,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:17:53,951 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:53,952 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:17:53,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:17:53,952 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:17:53,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:53,952 INFO L85 PathProgramCache]: Analyzing trace with hash 881120508, now seen corresponding path program 1 times [2025-02-06 10:17:53,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:53,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025476284] [2025-02-06 10:17:53,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:53,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:53,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:17:53,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:17:53,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:53,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:53,993 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:17:53,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:53,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025476284] [2025-02-06 10:17:53,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025476284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:53,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:53,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:17:53,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834101143] [2025-02-06 10:17:53,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:53,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:17:53,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:53,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:17:53,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:17:53,994 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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:17:54,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:54,092 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2025-02-06 10:17:54,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:17:54,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-02-06 10:17:54,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:54,093 INFO L225 Difference]: With dead ends: 140 [2025-02-06 10:17:54,093 INFO L226 Difference]: Without dead ends: 140 [2025-02-06 10:17:54,094 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:17:54,094 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 45 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:54,094 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 154 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:17:54,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-06 10:17:54,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2025-02-06 10:17:54,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 75 states have (on average 1.96) internal successors, (147), 133 states have internal predecessors, (147), 0 states have call successors, (0), 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:17:54,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 147 transitions. [2025-02-06 10:17:54,103 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 147 transitions. Word has length 6 [2025-02-06 10:17:54,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:54,103 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 147 transitions. [2025-02-06 10:17:54,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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:17:54,103 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 147 transitions. [2025-02-06 10:17:54,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:17:54,103 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:54,103 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:17:54,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:17:54,104 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:17:54,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:54,104 INFO L85 PathProgramCache]: Analyzing trace with hash 881120509, now seen corresponding path program 1 times [2025-02-06 10:17:54,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:54,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375750738] [2025-02-06 10:17:54,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:54,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:54,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:17:54,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:17:54,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:54,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:54,195 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:17:54,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:54,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375750738] [2025-02-06 10:17:54,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375750738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:54,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:54,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:17:54,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771230515] [2025-02-06 10:17:54,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:54,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:17:54,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:54,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:17:54,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:17:54,198 INFO L87 Difference]: Start difference. First operand 134 states and 147 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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:17:54,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:54,278 INFO L93 Difference]: Finished difference Result 132 states and 145 transitions. [2025-02-06 10:17:54,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:17:54,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2025-02-06 10:17:54,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:54,279 INFO L225 Difference]: With dead ends: 132 [2025-02-06 10:17:54,279 INFO L226 Difference]: Without dead ends: 132 [2025-02-06 10:17:54,279 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:17:54,279 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 21 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:54,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 175 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:17:54,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-02-06 10:17:54,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-02-06 10:17:54,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 75 states have (on average 1.9333333333333333) internal successors, (145), 131 states have internal predecessors, (145), 0 states have call successors, (0), 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:17:54,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 145 transitions. [2025-02-06 10:17:54,291 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 145 transitions. Word has length 6 [2025-02-06 10:17:54,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:54,291 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 145 transitions. [2025-02-06 10:17:54,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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:17:54,291 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 145 transitions. [2025-02-06 10:17:54,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:17:54,291 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:54,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:17:54,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:17:54,292 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:17:54,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:54,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1544872491, now seen corresponding path program 1 times [2025-02-06 10:17:54,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:54,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804711112] [2025-02-06 10:17:54,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:54,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:54,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:17:54,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:17:54,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:54,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:54,340 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:17:54,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:54,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804711112] [2025-02-06 10:17:54,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804711112] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:54,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:54,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:17:54,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807056714] [2025-02-06 10:17:54,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:54,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:17:54,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:54,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:17:54,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:17:54,341 INFO L87 Difference]: Start difference. First operand 132 states and 145 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:17:54,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:54,384 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2025-02-06 10:17:54,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:17:54,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2025-02-06 10:17:54,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:54,385 INFO L225 Difference]: With dead ends: 138 [2025-02-06 10:17:54,385 INFO L226 Difference]: Without dead ends: 137 [2025-02-06 10:17:54,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:17:54,386 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 6 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:54,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 222 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:17:54,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-06 10:17:54,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2025-02-06 10:17:54,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 80 states have (on average 1.8625) internal successors, (149), 136 states have internal predecessors, (149), 0 states have call successors, (0), 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:17:54,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2025-02-06 10:17:54,396 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 7 [2025-02-06 10:17:54,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:54,396 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2025-02-06 10:17:54,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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:17:54,396 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2025-02-06 10:17:54,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:17:54,396 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:54,396 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:17:54,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:17:54,399 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:17:54,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:54,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1966129829, now seen corresponding path program 1 times [2025-02-06 10:17:54,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:54,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200648163] [2025-02-06 10:17:54,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:54,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:54,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:17:54,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:17:54,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:54,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:54,479 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:17:54,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:54,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200648163] [2025-02-06 10:17:54,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200648163] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:54,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:54,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:17:54,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870951722] [2025-02-06 10:17:54,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:54,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:17:54,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:54,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:17:54,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:17:54,480 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:54,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:54,540 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2025-02-06 10:17:54,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:17:54,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 10:17:54,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:54,541 INFO L225 Difference]: With dead ends: 133 [2025-02-06 10:17:54,541 INFO L226 Difference]: Without dead ends: 133 [2025-02-06 10:17:54,541 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:17:54,542 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 18 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:54,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 169 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:17:54,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-02-06 10:17:54,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2025-02-06 10:17:54,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 80 states have (on average 1.8125) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 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:17:54,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2025-02-06 10:17:54,548 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 11 [2025-02-06 10:17:54,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:54,548 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2025-02-06 10:17:54,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:54,549 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2025-02-06 10:17:54,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:17:54,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:54,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:17:54,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:17:54,550 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:17:54,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:54,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1966129830, now seen corresponding path program 1 times [2025-02-06 10:17:54,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:54,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126419061] [2025-02-06 10:17:54,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:54,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:54,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:17:54,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:17:54,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:54,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:54,647 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:17:54,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:54,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126419061] [2025-02-06 10:17:54,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126419061] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:54,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:54,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:17:54,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958213653] [2025-02-06 10:17:54,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:54,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:17:54,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:54,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:17:54,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:17:54,649 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:54,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:54,739 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2025-02-06 10:17:54,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:17:54,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 10:17:54,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:54,740 INFO L225 Difference]: With dead ends: 130 [2025-02-06 10:17:54,740 INFO L226 Difference]: Without dead ends: 130 [2025-02-06 10:17:54,741 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:17:54,742 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 11 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:54,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 180 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:17:54,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-02-06 10:17:54,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2025-02-06 10:17:54,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.775) internal successors, (142), 129 states have internal predecessors, (142), 0 states have call successors, (0), 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:17:54,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2025-02-06 10:17:54,750 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 11 [2025-02-06 10:17:54,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:54,750 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2025-02-06 10:17:54,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:54,750 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2025-02-06 10:17:54,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 10:17:54,750 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:54,750 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:17:54,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:17:54,751 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:17:54,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:54,751 INFO L85 PathProgramCache]: Analyzing trace with hash 2063517450, now seen corresponding path program 1 times [2025-02-06 10:17:54,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:54,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809568765] [2025-02-06 10:17:54,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:54,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:54,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 10:17:54,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 10:17:54,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:54,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:54,813 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:17:54,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:54,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809568765] [2025-02-06 10:17:54,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809568765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:54,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:54,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:17:54,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58300262] [2025-02-06 10:17:54,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:54,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:17:54,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:54,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:17:54,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:17:54,815 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:54,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:54,918 INFO L93 Difference]: Finished difference Result 200 states and 235 transitions. [2025-02-06 10:17:54,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:17:54,919 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-06 10:17:54,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:54,920 INFO L225 Difference]: With dead ends: 200 [2025-02-06 10:17:54,920 INFO L226 Difference]: Without dead ends: 200 [2025-02-06 10:17:54,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:17:54,921 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 90 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:54,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 333 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:17:54,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-02-06 10:17:54,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 130. [2025-02-06 10:17:54,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.75) internal successors, (140), 129 states have internal predecessors, (140), 0 states have call successors, (0), 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:17:54,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2025-02-06 10:17:54,930 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 18 [2025-02-06 10:17:54,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:54,931 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2025-02-06 10:17:54,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:54,931 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2025-02-06 10:17:54,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:17:54,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:54,931 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:17:54,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:17:54,932 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:17:54,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:54,932 INFO L85 PathProgramCache]: Analyzing trace with hash -455464266, now seen corresponding path program 1 times [2025-02-06 10:17:54,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:54,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366379395] [2025-02-06 10:17:54,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:54,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:54,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:17:54,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:17:54,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:54,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:55,005 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:17:55,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:55,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366379395] [2025-02-06 10:17:55,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366379395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:55,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:55,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:17:55,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348997349] [2025-02-06 10:17:55,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:55,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:17:55,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:55,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:17:55,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:17:55,007 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:55,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:55,113 INFO L93 Difference]: Finished difference Result 124 states and 135 transitions. [2025-02-06 10:17:55,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:17:55,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-06 10:17:55,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:55,114 INFO L225 Difference]: With dead ends: 124 [2025-02-06 10:17:55,114 INFO L226 Difference]: Without dead ends: 124 [2025-02-06 10:17:55,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:17:55,115 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 59 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:55,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 169 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:17:55,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-06 10:17:55,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2025-02-06 10:17:55,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 82 states have (on average 1.646341463414634) internal successors, (135), 123 states have internal predecessors, (135), 0 states have call successors, (0), 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:17:55,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2025-02-06 10:17:55,117 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 19 [2025-02-06 10:17:55,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:55,117 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2025-02-06 10:17:55,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:55,117 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2025-02-06 10:17:55,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:17:55,118 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:55,118 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:17:55,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:17:55,118 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:17:55,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:55,118 INFO L85 PathProgramCache]: Analyzing trace with hash -455464265, now seen corresponding path program 1 times [2025-02-06 10:17:55,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:55,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144294170] [2025-02-06 10:17:55,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:55,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:55,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:17:55,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:17:55,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:55,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:55,263 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:17:55,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:55,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144294170] [2025-02-06 10:17:55,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144294170] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:55,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:55,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:17:55,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514138582] [2025-02-06 10:17:55,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:55,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:17:55,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:55,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:17:55,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:17:55,264 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:55,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:55,422 INFO L93 Difference]: Finished difference Result 186 states and 206 transitions. [2025-02-06 10:17:55,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:17:55,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-06 10:17:55,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:55,424 INFO L225 Difference]: With dead ends: 186 [2025-02-06 10:17:55,424 INFO L226 Difference]: Without dead ends: 186 [2025-02-06 10:17:55,425 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:17:55,425 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 79 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:55,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 177 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:17:55,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-02-06 10:17:55,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 163. [2025-02-06 10:17:55,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 123 states have (on average 1.6747967479674797) internal successors, (206), 162 states have internal predecessors, (206), 0 states have call successors, (0), 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:17:55,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 206 transitions. [2025-02-06 10:17:55,429 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 206 transitions. Word has length 19 [2025-02-06 10:17:55,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:55,429 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 206 transitions. [2025-02-06 10:17:55,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:55,429 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 206 transitions. [2025-02-06 10:17:55,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:17:55,430 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:55,430 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] [2025-02-06 10:17:55,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:17:55,430 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:17:55,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:55,431 INFO L85 PathProgramCache]: Analyzing trace with hash -111224502, now seen corresponding path program 1 times [2025-02-06 10:17:55,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:55,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446144599] [2025-02-06 10:17:55,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:55,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:55,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:17:55,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:17:55,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:55,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:55,581 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:17:55,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:55,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446144599] [2025-02-06 10:17:55,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446144599] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:55,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:55,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:17:55,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56862940] [2025-02-06 10:17:55,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:55,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:17:55,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:55,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:17:55,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:17:55,582 INFO L87 Difference]: Start difference. First operand 163 states and 206 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:55,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:55,707 INFO L93 Difference]: Finished difference Result 188 states and 233 transitions. [2025-02-06 10:17:55,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:17:55,707 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-06 10:17:55,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:55,709 INFO L225 Difference]: With dead ends: 188 [2025-02-06 10:17:55,709 INFO L226 Difference]: Without dead ends: 188 [2025-02-06 10:17:55,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:17:55,709 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 32 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:55,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 308 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:17:55,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-02-06 10:17:55,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 175. [2025-02-06 10:17:55,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 135 states have (on average 1.637037037037037) internal successors, (221), 174 states have internal predecessors, (221), 0 states have call successors, (0), 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:17:55,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 221 transitions. [2025-02-06 10:17:55,713 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 221 transitions. Word has length 24 [2025-02-06 10:17:55,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:55,713 INFO L471 AbstractCegarLoop]: Abstraction has 175 states and 221 transitions. [2025-02-06 10:17:55,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:55,713 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 221 transitions. [2025-02-06 10:17:55,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:17:55,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:55,713 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] [2025-02-06 10:17:55,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:17:55,714 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:17:55,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:55,714 INFO L85 PathProgramCache]: Analyzing trace with hash -111224501, now seen corresponding path program 1 times [2025-02-06 10:17:55,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:55,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402184495] [2025-02-06 10:17:55,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:55,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:55,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:17:55,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:17:55,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:55,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:55,932 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:17:55,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:55,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402184495] [2025-02-06 10:17:55,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402184495] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:55,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:55,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:17:55,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101227483] [2025-02-06 10:17:55,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:55,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:17:55,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:55,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:17:55,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:17:55,933 INFO L87 Difference]: Start difference. First operand 175 states and 221 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:56,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:56,018 INFO L93 Difference]: Finished difference Result 176 states and 220 transitions. [2025-02-06 10:17:56,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:17:56,018 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-06 10:17:56,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:56,022 INFO L225 Difference]: With dead ends: 176 [2025-02-06 10:17:56,023 INFO L226 Difference]: Without dead ends: 176 [2025-02-06 10:17:56,023 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:17:56,023 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 6 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:56,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 344 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:17:56,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-02-06 10:17:56,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 171. [2025-02-06 10:17:56,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 131 states have (on average 1.6412213740458015) internal successors, (215), 170 states have internal predecessors, (215), 0 states have call successors, (0), 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:17:56,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 215 transitions. [2025-02-06 10:17:56,026 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 215 transitions. Word has length 24 [2025-02-06 10:17:56,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:56,026 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 215 transitions. [2025-02-06 10:17:56,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:56,026 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 215 transitions. [2025-02-06 10:17:56,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:17:56,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:56,030 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] [2025-02-06 10:17:56,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:17:56,031 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:17:56,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:56,031 INFO L85 PathProgramCache]: Analyzing trace with hash -112548180, now seen corresponding path program 1 times [2025-02-06 10:17:56,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:56,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486985297] [2025-02-06 10:17:56,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:56,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:56,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:17:56,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:17:56,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:56,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:56,096 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:17:56,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:56,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486985297] [2025-02-06 10:17:56,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486985297] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:56,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:56,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:17:56,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870941646] [2025-02-06 10:17:56,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:56,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:17:56,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:56,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:17:56,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:17:56,098 INFO L87 Difference]: Start difference. First operand 171 states and 215 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:56,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:56,166 INFO L93 Difference]: Finished difference Result 195 states and 216 transitions. [2025-02-06 10:17:56,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:17:56,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-06 10:17:56,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:56,171 INFO L225 Difference]: With dead ends: 195 [2025-02-06 10:17:56,171 INFO L226 Difference]: Without dead ends: 195 [2025-02-06 10:17:56,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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:17:56,171 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 78 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:56,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 254 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:17:56,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-02-06 10:17:56,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 172. [2025-02-06 10:17:56,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 132 states have (on average 1.6363636363636365) internal successors, (216), 171 states have internal predecessors, (216), 0 states have call successors, (0), 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:17:56,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 216 transitions. [2025-02-06 10:17:56,174 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 216 transitions. Word has length 24 [2025-02-06 10:17:56,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:56,174 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 216 transitions. [2025-02-06 10:17:56,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:56,174 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 216 transitions. [2025-02-06 10:17:56,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:17:56,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:56,177 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] [2025-02-06 10:17:56,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:17:56,177 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:17:56,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:56,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1446612514, now seen corresponding path program 1 times [2025-02-06 10:17:56,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:56,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902673292] [2025-02-06 10:17:56,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:56,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:56,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:17:56,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:17:56,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:56,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:56,387 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:17:56,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:56,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902673292] [2025-02-06 10:17:56,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902673292] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:56,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:56,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:17:56,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627343546] [2025-02-06 10:17:56,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:56,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:17:56,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:56,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:17:56,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:17:56,389 INFO L87 Difference]: Start difference. First operand 172 states and 216 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:56,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:56,504 INFO L93 Difference]: Finished difference Result 181 states and 227 transitions. [2025-02-06 10:17:56,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:17:56,504 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-02-06 10:17:56,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:56,505 INFO L225 Difference]: With dead ends: 181 [2025-02-06 10:17:56,505 INFO L226 Difference]: Without dead ends: 181 [2025-02-06 10:17:56,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:17:56,505 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 20 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:56,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 341 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:17:56,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-02-06 10:17:56,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2025-02-06 10:17:56,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 138 states have (on average 1.608695652173913) internal successors, (222), 177 states have internal predecessors, (222), 0 states have call successors, (0), 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:17:56,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 222 transitions. [2025-02-06 10:17:56,512 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 222 transitions. Word has length 27 [2025-02-06 10:17:56,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:56,512 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 222 transitions. [2025-02-06 10:17:56,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:56,512 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 222 transitions. [2025-02-06 10:17:56,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:17:56,513 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:56,513 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] [2025-02-06 10:17:56,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 10:17:56,513 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:17:56,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:56,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1446612866, now seen corresponding path program 1 times [2025-02-06 10:17:56,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:56,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690373145] [2025-02-06 10:17:56,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:56,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:56,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:17:56,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:17:56,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:56,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:56,866 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:17:56,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:56,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690373145] [2025-02-06 10:17:56,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690373145] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:56,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:56,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 10:17:56,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650955211] [2025-02-06 10:17:56,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:56,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:17:56,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:56,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:17:56,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:17:56,868 INFO L87 Difference]: Start difference. First operand 178 states and 222 transitions. Second operand has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:57,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:57,129 INFO L93 Difference]: Finished difference Result 191 states and 238 transitions. [2025-02-06 10:17:57,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:17:57,129 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-02-06 10:17:57,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:57,130 INFO L225 Difference]: With dead ends: 191 [2025-02-06 10:17:57,130 INFO L226 Difference]: Without dead ends: 191 [2025-02-06 10:17:57,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:17:57,132 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 40 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:57,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 328 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:17:57,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-02-06 10:17:57,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 179. [2025-02-06 10:17:57,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 139 states have (on average 1.6115107913669064) internal successors, (224), 178 states have internal predecessors, (224), 0 states have call successors, (0), 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:17:57,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 224 transitions. [2025-02-06 10:17:57,139 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 224 transitions. Word has length 27 [2025-02-06 10:17:57,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:57,140 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 224 transitions. [2025-02-06 10:17:57,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.7) internal successors, (27), 11 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:57,140 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 224 transitions. [2025-02-06 10:17:57,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:17:57,140 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:57,140 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] [2025-02-06 10:17:57,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 10:17:57,140 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:17:57,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:57,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1446612867, now seen corresponding path program 1 times [2025-02-06 10:17:57,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:57,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787469627] [2025-02-06 10:17:57,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:57,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:57,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:17:57,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:17:57,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:57,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:57,552 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:17:57,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:57,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787469627] [2025-02-06 10:17:57,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787469627] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:57,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:57,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:17:57,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89493057] [2025-02-06 10:17:57,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:57,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:17:57,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:57,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:17:57,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:17:57,553 INFO L87 Difference]: Start difference. First operand 179 states and 224 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:57,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:57,855 INFO L93 Difference]: Finished difference Result 190 states and 234 transitions. [2025-02-06 10:17:57,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:17:57,855 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-02-06 10:17:57,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:57,856 INFO L225 Difference]: With dead ends: 190 [2025-02-06 10:17:57,856 INFO L226 Difference]: Without dead ends: 190 [2025-02-06 10:17:57,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2025-02-06 10:17:57,856 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 37 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:57,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 358 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:17:57,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-06 10:17:57,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 179. [2025-02-06 10:17:57,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 139 states have (on average 1.60431654676259) internal successors, (223), 178 states have internal predecessors, (223), 0 states have call successors, (0), 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:17:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 223 transitions. [2025-02-06 10:17:57,860 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 223 transitions. Word has length 27 [2025-02-06 10:17:57,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:57,860 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 223 transitions. [2025-02-06 10:17:57,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:57,860 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 223 transitions. [2025-02-06 10:17:57,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-06 10:17:57,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:57,860 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] [2025-02-06 10:17:57,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 10:17:57,861 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:17:57,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:57,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1374440320, now seen corresponding path program 1 times [2025-02-06 10:17:57,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:57,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337734140] [2025-02-06 10:17:57,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:57,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:57,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 10:17:57,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 10:17:57,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:57,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:58,079 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:17:58,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:58,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337734140] [2025-02-06 10:17:58,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337734140] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:58,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:58,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:17:58,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796881621] [2025-02-06 10:17:58,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:58,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:17:58,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:58,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:17:58,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:17:58,081 INFO L87 Difference]: Start difference. First operand 179 states and 223 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:58,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:58,242 INFO L93 Difference]: Finished difference Result 192 states and 236 transitions. [2025-02-06 10:17:58,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:17:58,242 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-02-06 10:17:58,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:58,243 INFO L225 Difference]: With dead ends: 192 [2025-02-06 10:17:58,243 INFO L226 Difference]: Without dead ends: 192 [2025-02-06 10:17:58,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:17:58,244 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 36 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:58,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 422 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:17:58,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-02-06 10:17:58,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 181. [2025-02-06 10:17:58,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 141 states have (on average 1.5957446808510638) internal successors, (225), 180 states have internal predecessors, (225), 0 states have call successors, (0), 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:17:58,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 225 transitions. [2025-02-06 10:17:58,250 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 225 transitions. Word has length 29 [2025-02-06 10:17:58,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:58,250 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 225 transitions. [2025-02-06 10:17:58,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:17:58,250 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 225 transitions. [2025-02-06 10:17:58,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 10:17:58,250 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:58,250 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] [2025-02-06 10:17:58,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 10:17:58,251 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:17:58,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:58,251 INFO L85 PathProgramCache]: Analyzing trace with hash 342023016, now seen corresponding path program 1 times [2025-02-06 10:17:58,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:58,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020002500] [2025-02-06 10:17:58,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:58,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:58,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:17:58,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:17:58,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:58,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:58,508 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:17:58,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:58,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020002500] [2025-02-06 10:17:58,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020002500] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:58,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:58,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:17:58,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298139707] [2025-02-06 10:17:58,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:58,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:17:58,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:58,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:17:58,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:17:58,510 INFO L87 Difference]: Start difference. First operand 181 states and 225 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 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:17:58,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:58,754 INFO L93 Difference]: Finished difference Result 193 states and 237 transitions. [2025-02-06 10:17:58,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:17:58,754 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-02-06 10:17:58,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:58,755 INFO L225 Difference]: With dead ends: 193 [2025-02-06 10:17:58,755 INFO L226 Difference]: Without dead ends: 193 [2025-02-06 10:17:58,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-02-06 10:17:58,756 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 27 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:58,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 495 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:17:58,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-06 10:17:58,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 182. [2025-02-06 10:17:58,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 142 states have (on average 1.591549295774648) internal successors, (226), 181 states have internal predecessors, (226), 0 states have call successors, (0), 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:17:58,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 226 transitions. [2025-02-06 10:17:58,762 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 226 transitions. Word has length 30 [2025-02-06 10:17:58,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:58,762 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 226 transitions. [2025-02-06 10:17:58,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 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:17:58,762 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 226 transitions. [2025-02-06 10:17:58,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-06 10:17:58,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:58,763 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:17:58,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 10:17:58,763 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:17:58,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:58,763 INFO L85 PathProgramCache]: Analyzing trace with hash 2012778878, now seen corresponding path program 1 times [2025-02-06 10:17:58,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:58,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715154440] [2025-02-06 10:17:58,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:58,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:58,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 10:17:58,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 10:17:58,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:58,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:17:58,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:58,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715154440] [2025-02-06 10:17:58,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715154440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:17:58,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:17:58,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:17:58,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814819622] [2025-02-06 10:17:58,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:17:58,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:17:58,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:17:58,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:17:58,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:17:58,821 INFO L87 Difference]: Start difference. First operand 182 states and 226 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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:17:58,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:17:58,939 INFO L93 Difference]: Finished difference Result 247 states and 314 transitions. [2025-02-06 10:17:58,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:17:58,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-02-06 10:17:58,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:17:58,940 INFO L225 Difference]: With dead ends: 247 [2025-02-06 10:17:58,940 INFO L226 Difference]: Without dead ends: 247 [2025-02-06 10:17:58,940 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:17:58,940 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 65 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:17:58,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 235 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:17:58,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-02-06 10:17:58,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 186. [2025-02-06 10:17:58,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 148 states have (on average 1.6013513513513513) internal successors, (237), 185 states have internal predecessors, (237), 0 states have call successors, (0), 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:17:58,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 237 transitions. [2025-02-06 10:17:58,944 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 237 transitions. Word has length 31 [2025-02-06 10:17:58,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:17:58,944 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 237 transitions. [2025-02-06 10:17:58,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 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:17:58,944 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 237 transitions. [2025-02-06 10:17:58,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 10:17:58,944 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:17:58,944 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] [2025-02-06 10:17:58,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 10:17:58,945 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:17:58,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:17:58,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1545217691, now seen corresponding path program 1 times [2025-02-06 10:17:58,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:17:58,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638457630] [2025-02-06 10:17:58,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:58,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:17:58,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 10:17:58,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 10:17:58,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:58,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:17:59,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:17:59,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638457630] [2025-02-06 10:17:59,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638457630] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:17:59,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841079955] [2025-02-06 10:17:59,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:17:59,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:17:59,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:17:59,191 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:17:59,192 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:17:59,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 10:17:59,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 10:17:59,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:17:59,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:17:59,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 10:17:59,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:17:59,393 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:17:59,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:17:59,491 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 46 treesize of output 36 [2025-02-06 10:17:59,777 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~data~0#1.base_44| Int) (|v_ULTIMATE.start_main_~item2~0#1.base_25| Int)) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~item2~0#1.base_25| 1) |v_ULTIMATE.start_main_~data~0#1.base_44|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~item2~0#1.base_25|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~data~0#1.base_44| 0) |v_ULTIMATE.start_main_~item2~0#1.base_25| 0)))) is different from true [2025-02-06 10:17:59,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-02-06 10:17:59,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:17:59,906 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 48 treesize of output 44 [2025-02-06 10:18:04,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:04,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841079955] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:18:04,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:18:04,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 30 [2025-02-06 10:18:04,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895598438] [2025-02-06 10:18:04,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:18:04,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 10:18:04,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:04,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 10:18:04,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=773, Unknown=2, NotChecked=56, Total=930 [2025-02-06 10:18:04,414 INFO L87 Difference]: Start difference. First operand 186 states and 237 transitions. Second operand has 31 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 31 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:05,739 INFO L93 Difference]: Finished difference Result 198 states and 249 transitions. [2025-02-06 10:18:05,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:18:05,739 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 31 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-02-06 10:18:05,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:05,740 INFO L225 Difference]: With dead ends: 198 [2025-02-06 10:18:05,740 INFO L226 Difference]: Without dead ends: 197 [2025-02-06 10:18:05,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=175, Invalid=1309, Unknown=2, NotChecked=74, Total=1560 [2025-02-06 10:18:05,741 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 23 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:05,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 1060 Invalid, 1599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1447 Invalid, 0 Unknown, 149 Unchecked, 1.1s Time] [2025-02-06 10:18:05,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-06 10:18:05,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 188. [2025-02-06 10:18:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 150 states have (on average 1.5933333333333333) internal successors, (239), 187 states have internal predecessors, (239), 0 states have call successors, (0), 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:18:05,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 239 transitions. [2025-02-06 10:18:05,745 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 239 transitions. Word has length 33 [2025-02-06 10:18:05,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:05,745 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 239 transitions. [2025-02-06 10:18:05,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.8333333333333335) internal successors, (85), 31 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:05,746 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 239 transitions. [2025-02-06 10:18:05,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-06 10:18:05,746 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:05,746 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:05,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 10:18:05,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:05,951 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:18:05,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:05,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1545218043, now seen corresponding path program 1 times [2025-02-06 10:18:05,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:05,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210129899] [2025-02-06 10:18:05,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:05,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:05,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 10:18:05,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 10:18:05,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:05,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:06,380 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:06,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:06,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210129899] [2025-02-06 10:18:06,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210129899] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:06,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731840536] [2025-02-06 10:18:06,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:06,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:06,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:06,388 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:18:06,389 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:18:06,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 10:18:06,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 10:18:06,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:06,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:06,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-06 10:18:06,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:06,473 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:18:06,478 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:18:06,489 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:18:06,494 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:18:06,549 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:18:06,549 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-06 10:18:06,569 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:18:06,570 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-06 10:18:06,645 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-06 10:18:06,645 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 31 [2025-02-06 10:18:06,656 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 35 treesize of output 23 [2025-02-06 10:18:06,858 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:18:07,000 INFO L349 Elim1Store]: treesize reduction 8, result has 50.0 percent of original size [2025-02-06 10:18:07,001 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 95 treesize of output 91 [2025-02-06 10:18:07,059 INFO L349 Elim1Store]: treesize reduction 28, result has 69.9 percent of original size [2025-02-06 10:18:07,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 87 treesize of output 117 [2025-02-06 10:18:07,105 INFO L349 Elim1Store]: treesize reduction 4, result has 91.8 percent of original size [2025-02-06 10:18:07,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 85 [2025-02-06 10:18:07,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:07,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:18:07,381 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 10 treesize of output 8 [2025-02-06 10:18:07,670 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:18:07,750 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0))) (let ((.cse3 (not .cse1))) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_arrayElimCell_23 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_23) (forall ((v_ArrVal_513 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_513))) (or (= (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse0 v_arrayElimCell_23) 0) 0)))))))) (or .cse1 (and (forall ((v_ArrVal_513 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_23 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_23) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_513) v_arrayElimCell_23) 0) 0))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_23 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_23) (forall ((v_ArrVal_513 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_513))) (or (= (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse2 v_arrayElimCell_23) 0) 0)))))))) (or .cse1 (forall ((v_ArrVal_513 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_23 Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_23) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_513) v_arrayElimCell_23) 0) 0)))) (or .cse3 (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (forall ((v_ArrVal_513 (Array Int Int)) (v_arrayElimCell_23 Int)) (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_513))) (or (= (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= (select (select .cse4 v_arrayElimCell_23) 0) 0)))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (forall ((v_ArrVal_513 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))))) (or .cse3 (forall ((v_ArrVal_513 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_510 (Array Int Int))) (let ((.cse5 (select (store v_ArrVal_510 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|) 4))) (or (= (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_510) .cse5) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse5))))))) is different from false [2025-02-06 10:18:07,961 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 15 treesize of output 13 [2025-02-06 10:18:07,963 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 48 treesize of output 46 [2025-02-06 10:18:07,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:07,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731840536] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:18:07,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:18:07,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 40 [2025-02-06 10:18:07,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287809371] [2025-02-06 10:18:07,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:18:07,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-06 10:18:07,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:07,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-06 10:18:07,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1316, Unknown=8, NotChecked=74, Total=1560 [2025-02-06 10:18:07,971 INFO L87 Difference]: Start difference. First operand 188 states and 239 transitions. Second operand has 40 states, 40 states have (on average 1.85) internal successors, (74), 40 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:08,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:08,827 INFO L93 Difference]: Finished difference Result 196 states and 246 transitions. [2025-02-06 10:18:08,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 10:18:08,828 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.85) internal successors, (74), 40 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-02-06 10:18:08,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:08,829 INFO L225 Difference]: With dead ends: 196 [2025-02-06 10:18:08,829 INFO L226 Difference]: Without dead ends: 180 [2025-02-06 10:18:08,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 773 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=269, Invalid=1889, Unknown=8, NotChecked=90, Total=2256 [2025-02-06 10:18:08,830 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 52 mSDsluCounter, 1109 mSDsCounter, 0 mSdLazyCounter, 1164 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1204 SdHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:08,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1204 Invalid, 1249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1164 Invalid, 0 Unknown, 78 Unchecked, 0.6s Time] [2025-02-06 10:18:08,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-02-06 10:18:08,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 172. [2025-02-06 10:18:08,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 134 states have (on average 1.6567164179104477) internal successors, (222), 171 states have internal predecessors, (222), 0 states have call successors, (0), 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:18:08,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 222 transitions. [2025-02-06 10:18:08,833 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 222 transitions. Word has length 33 [2025-02-06 10:18:08,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:08,833 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 222 transitions. [2025-02-06 10:18:08,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.85) internal successors, (74), 40 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:08,833 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 222 transitions. [2025-02-06 10:18:08,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-06 10:18:08,833 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:08,833 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:08,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 10:18:09,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:09,034 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:18:09,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:09,034 INFO L85 PathProgramCache]: Analyzing trace with hash 173510969, now seen corresponding path program 1 times [2025-02-06 10:18:09,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:09,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993499390] [2025-02-06 10:18:09,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:09,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:09,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 10:18:09,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 10:18:09,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:09,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:09,193 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:09,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:09,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993499390] [2025-02-06 10:18:09,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993499390] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:09,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023670553] [2025-02-06 10:18:09,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:09,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:09,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:09,195 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:18:09,197 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:18:09,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 10:18:09,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 10:18:09,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:09,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:09,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 10:18:09,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:09,309 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:18:09,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:18:09,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:18:09,359 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 0 case distinctions, treesize of input 41 treesize of output 31 [2025-02-06 10:18:09,392 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 17 treesize of output 9 [2025-02-06 10:18:09,394 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:09,394 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:18:09,494 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:09,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023670553] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:18:09,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:18:09,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 18 [2025-02-06 10:18:09,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680238115] [2025-02-06 10:18:09,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:18:09,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 10:18:09,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:09,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 10:18:09,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-02-06 10:18:09,496 INFO L87 Difference]: Start difference. First operand 172 states and 222 transitions. Second operand has 19 states, 18 states have (on average 4.777777777777778) internal successors, (86), 19 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:09,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:09,840 INFO L93 Difference]: Finished difference Result 196 states and 223 transitions. [2025-02-06 10:18:09,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 10:18:09,841 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.777777777777778) internal successors, (86), 19 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-02-06 10:18:09,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:09,841 INFO L225 Difference]: With dead ends: 196 [2025-02-06 10:18:09,844 INFO L226 Difference]: Without dead ends: 196 [2025-02-06 10:18:09,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2025-02-06 10:18:09,846 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 166 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:09,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 556 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:18:09,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-02-06 10:18:09,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 172. [2025-02-06 10:18:09,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 134 states have (on average 1.6492537313432836) internal successors, (221), 171 states have internal predecessors, (221), 0 states have call successors, (0), 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:18:09,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 221 transitions. [2025-02-06 10:18:09,849 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 221 transitions. Word has length 38 [2025-02-06 10:18:09,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:09,849 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 221 transitions. [2025-02-06 10:18:09,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.777777777777778) internal successors, (86), 19 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:09,850 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 221 transitions. [2025-02-06 10:18:09,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-02-06 10:18:09,850 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:09,850 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:18:09,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 10:18:10,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:10,054 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:18:10,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:10,055 INFO L85 PathProgramCache]: Analyzing trace with hash 173510970, now seen corresponding path program 1 times [2025-02-06 10:18:10,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:10,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293689018] [2025-02-06 10:18:10,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:10,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:10,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 10:18:10,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 10:18:10,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:10,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:10,259 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:10,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:10,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293689018] [2025-02-06 10:18:10,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293689018] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:10,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610664745] [2025-02-06 10:18:10,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:10,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:10,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:10,262 INFO L229 MonitoredProcess]: Starting monitored process 5 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:18:10,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 10:18:10,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 10:18:10,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 10:18:10,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:10,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:10,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-06 10:18:10,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:10,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:18:10,431 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:18:10,435 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:18:10,457 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 0 case distinctions, treesize of input 64 treesize of output 42 [2025-02-06 10:18:10,461 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 35 treesize of output 11 [2025-02-06 10:18:10,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-06 10:18:10,532 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:10,532 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:18:10,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610664745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:10,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:18:10,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 15 [2025-02-06 10:18:10,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620106717] [2025-02-06 10:18:10,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:10,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:18:10,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:10,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:18:10,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2025-02-06 10:18:10,534 INFO L87 Difference]: Start difference. First operand 172 states and 221 transitions. Second operand has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 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:18:10,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:10,703 INFO L93 Difference]: Finished difference Result 195 states and 222 transitions. [2025-02-06 10:18:10,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:18:10,703 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2025-02-06 10:18:10,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:10,704 INFO L225 Difference]: With dead ends: 195 [2025-02-06 10:18:10,704 INFO L226 Difference]: Without dead ends: 195 [2025-02-06 10:18:10,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:18:10,705 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 60 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:10,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 408 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:18:10,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-02-06 10:18:10,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 172. [2025-02-06 10:18:10,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 134 states have (on average 1.6417910447761195) internal successors, (220), 171 states have internal predecessors, (220), 0 states have call successors, (0), 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:18:10,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 220 transitions. [2025-02-06 10:18:10,708 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 220 transitions. Word has length 38 [2025-02-06 10:18:10,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:10,708 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 220 transitions. [2025-02-06 10:18:10,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.75) internal successors, (38), 9 states have internal predecessors, (38), 0 states have call successors, (0), 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:18:10,708 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 220 transitions. [2025-02-06 10:18:10,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-06 10:18:10,709 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:10,709 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 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:18:10,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 10:18:10,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-06 10:18:10,914 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:18:10,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:10,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1440619475, now seen corresponding path program 1 times [2025-02-06 10:18:10,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:10,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871363975] [2025-02-06 10:18:10,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:10,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:10,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 10:18:10,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 10:18:10,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:10,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:11,047 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:11,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:11,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871363975] [2025-02-06 10:18:11,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871363975] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:11,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759221175] [2025-02-06 10:18:11,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:11,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:11,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:11,050 INFO L229 MonitoredProcess]: Starting monitored process 6 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:18:11,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 10:18:11,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 10:18:11,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 10:18:11,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:11,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:11,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-06 10:18:11,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:11,194 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:18:11,228 INFO L349 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2025-02-06 10:18:11,228 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 40 treesize of output 38 [2025-02-06 10:18:11,333 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2025-02-06 10:18:11,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 30 [2025-02-06 10:18:11,369 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 10:18:11,369 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:18:11,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759221175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:11,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:18:11,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2025-02-06 10:18:11,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953277929] [2025-02-06 10:18:11,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:11,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:18:11,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:11,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:18:11,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:18:11,370 INFO L87 Difference]: Start difference. First operand 172 states and 220 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 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:18:11,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:11,615 INFO L93 Difference]: Finished difference Result 184 states and 232 transitions. [2025-02-06 10:18:11,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 10:18:11,615 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 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 41 [2025-02-06 10:18:11,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:11,616 INFO L225 Difference]: With dead ends: 184 [2025-02-06 10:18:11,616 INFO L226 Difference]: Without dead ends: 184 [2025-02-06 10:18:11,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2025-02-06 10:18:11,617 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 23 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:11,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 557 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:18:11,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-06 10:18:11,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 174. [2025-02-06 10:18:11,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 136 states have (on average 1.6323529411764706) internal successors, (222), 173 states have internal predecessors, (222), 0 states have call successors, (0), 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:18:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 222 transitions. [2025-02-06 10:18:11,620 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 222 transitions. Word has length 41 [2025-02-06 10:18:11,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:11,620 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 222 transitions. [2025-02-06 10:18:11,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 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:18:11,620 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 222 transitions. [2025-02-06 10:18:11,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-06 10:18:11,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:11,621 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 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:18:11,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 10:18:11,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-06 10:18:11,821 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:18:11,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:11,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1440619827, now seen corresponding path program 1 times [2025-02-06 10:18:11,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:11,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339933691] [2025-02-06 10:18:11,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:11,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:11,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 10:18:11,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 10:18:11,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:11,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:11,934 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:11,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:11,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339933691] [2025-02-06 10:18:11,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339933691] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:11,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767812713] [2025-02-06 10:18:11,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:11,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:11,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:11,939 INFO L229 MonitoredProcess]: Starting monitored process 7 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:18:11,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 10:18:12,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-06 10:18:12,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-06 10:18:12,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:12,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:12,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 10:18:12,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:12,043 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:18:12,060 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 10:18:12,060 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 19 treesize of output 16 [2025-02-06 10:18:12,069 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:18:12,069 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:18:12,075 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 11 treesize of output 7 [2025-02-06 10:18:12,084 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:18:12,084 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 25 treesize of output 26 [2025-02-06 10:18:12,092 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:18:12,093 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:12,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:18:12,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:12,116 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 19 treesize of output 20 [2025-02-06 10:18:12,118 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 33 treesize of output 25 [2025-02-06 10:18:12,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-02-06 10:18:12,156 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:12,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767812713] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:18:12,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:18:12,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 12 [2025-02-06 10:18:12,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230240885] [2025-02-06 10:18:12,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:18:12,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 10:18:12,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:12,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 10:18:12,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=98, Unknown=3, NotChecked=0, Total=132 [2025-02-06 10:18:12,158 INFO L87 Difference]: Start difference. First operand 174 states and 222 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 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:18:12,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:12,365 INFO L93 Difference]: Finished difference Result 172 states and 217 transitions. [2025-02-06 10:18:12,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:18:12,366 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 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 41 [2025-02-06 10:18:12,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:12,366 INFO L225 Difference]: With dead ends: 172 [2025-02-06 10:18:12,366 INFO L226 Difference]: Without dead ends: 172 [2025-02-06 10:18:12,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=220, Unknown=5, NotChecked=0, Total=306 [2025-02-06 10:18:12,367 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 72 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:12,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 487 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:18:12,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2025-02-06 10:18:12,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 168. [2025-02-06 10:18:12,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 130 states have (on average 1.6538461538461537) internal successors, (215), 167 states have internal predecessors, (215), 0 states have call successors, (0), 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:18:12,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 215 transitions. [2025-02-06 10:18:12,369 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 215 transitions. Word has length 41 [2025-02-06 10:18:12,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:12,369 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 215 transitions. [2025-02-06 10:18:12,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 0 states have call successors, (0), 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:18:12,369 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 215 transitions. [2025-02-06 10:18:12,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:18:12,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:12,374 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 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:18:12,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 10:18:12,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-06 10:18:12,575 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:18:12,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:12,575 INFO L85 PathProgramCache]: Analyzing trace with hash 90507059, now seen corresponding path program 1 times [2025-02-06 10:18:12,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:12,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833411234] [2025-02-06 10:18:12,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:12,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:12,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:18:12,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:18:12,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:12,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:12,642 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-06 10:18:12,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:12,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833411234] [2025-02-06 10:18:12,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833411234] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:12,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:18:12,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:18:12,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047806751] [2025-02-06 10:18:12,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:12,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:18:12,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:12,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:18:12,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:18:12,643 INFO L87 Difference]: Start difference. First operand 168 states and 215 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 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:18:12,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:12,764 INFO L93 Difference]: Finished difference Result 167 states and 213 transitions. [2025-02-06 10:18:12,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:18:12,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 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 42 [2025-02-06 10:18:12,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:12,765 INFO L225 Difference]: With dead ends: 167 [2025-02-06 10:18:12,765 INFO L226 Difference]: Without dead ends: 167 [2025-02-06 10:18:12,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:18:12,765 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 19 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:12,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 306 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:18:12,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-02-06 10:18:12,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2025-02-06 10:18:12,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 130 states have (on average 1.6384615384615384) internal successors, (213), 166 states have internal predecessors, (213), 0 states have call successors, (0), 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:18:12,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 213 transitions. [2025-02-06 10:18:12,769 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 213 transitions. Word has length 42 [2025-02-06 10:18:12,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:12,769 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 213 transitions. [2025-02-06 10:18:12,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 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:18:12,769 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 213 transitions. [2025-02-06 10:18:12,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:18:12,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:12,769 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 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:18:12,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 10:18:12,770 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:18:12,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:12,770 INFO L85 PathProgramCache]: Analyzing trace with hash 90507060, now seen corresponding path program 1 times [2025-02-06 10:18:12,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:12,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037713035] [2025-02-06 10:18:12,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:12,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:12,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:18:12,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:18:12,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:12,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:12,963 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:12,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:12,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037713035] [2025-02-06 10:18:12,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037713035] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:12,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283747711] [2025-02-06 10:18:12,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:12,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:12,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:12,969 INFO L229 MonitoredProcess]: Starting monitored process 8 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:18:12,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 10:18:13,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-06 10:18:13,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:18:13,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:13,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:13,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-06 10:18:13,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:13,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:18:13,163 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:18:13,167 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:18:13,192 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 0 case distinctions, treesize of input 64 treesize of output 42 [2025-02-06 10:18:13,196 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 35 treesize of output 11 [2025-02-06 10:18:13,263 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 17 treesize of output 9 [2025-02-06 10:18:13,301 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:13,301 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 10:18:13,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283747711] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:18:13,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 10:18:13,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2025-02-06 10:18:13,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694427273] [2025-02-06 10:18:13,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:18:13,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 10:18:13,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:13,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 10:18:13,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:18:13,303 INFO L87 Difference]: Start difference. First operand 167 states and 213 transitions. Second operand has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 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:18:13,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:13,456 INFO L93 Difference]: Finished difference Result 187 states and 213 transitions. [2025-02-06 10:18:13,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:18:13,457 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 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:18:13,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:13,457 INFO L225 Difference]: With dead ends: 187 [2025-02-06 10:18:13,457 INFO L226 Difference]: Without dead ends: 187 [2025-02-06 10:18:13,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2025-02-06 10:18:13,458 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 60 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:13,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 414 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:18:13,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-02-06 10:18:13,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 167. [2025-02-06 10:18:13,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 130 states have (on average 1.623076923076923) internal successors, (211), 166 states have internal predecessors, (211), 0 states have call successors, (0), 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:18:13,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 211 transitions. [2025-02-06 10:18:13,461 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 211 transitions. Word has length 42 [2025-02-06 10:18:13,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:13,461 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 211 transitions. [2025-02-06 10:18:13,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.666666666666667) internal successors, (42), 10 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:18:13,461 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 211 transitions. [2025-02-06 10:18:13,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 10:18:13,462 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:13,462 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-06 10:18:13,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-06 10:18:13,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:13,666 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:18:13,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:13,666 INFO L85 PathProgramCache]: Analyzing trace with hash 812533072, now seen corresponding path program 1 times [2025-02-06 10:18:13,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:13,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121905959] [2025-02-06 10:18:13,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:13,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:13,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 10:18:13,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:18:13,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:13,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:13,878 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:13,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:13,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121905959] [2025-02-06 10:18:13,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121905959] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:13,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600398011] [2025-02-06 10:18:13,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:13,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:13,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:13,884 INFO L229 MonitoredProcess]: Starting monitored process 9 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:18:13,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 10:18:13,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 10:18:14,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:18:14,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:14,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:14,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-06 10:18:14,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:14,113 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:18:14,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:18:14,132 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 0 case distinctions, treesize of input 41 treesize of output 31 [2025-02-06 10:18:14,176 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 17 treesize of output 9 [2025-02-06 10:18:14,184 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:14,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:18:14,297 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:14,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600398011] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:18:14,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:18:14,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2025-02-06 10:18:14,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917882557] [2025-02-06 10:18:14,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:18:14,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 10:18:14,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:14,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 10:18:14,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2025-02-06 10:18:14,298 INFO L87 Difference]: Start difference. First operand 167 states and 211 transitions. Second operand has 19 states, 18 states have (on average 5.388888888888889) internal successors, (97), 19 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:14,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:14,679 INFO L93 Difference]: Finished difference Result 186 states and 212 transitions. [2025-02-06 10:18:14,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 10:18:14,679 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.388888888888889) internal successors, (97), 19 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2025-02-06 10:18:14,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:14,680 INFO L225 Difference]: With dead ends: 186 [2025-02-06 10:18:14,680 INFO L226 Difference]: Without dead ends: 186 [2025-02-06 10:18:14,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2025-02-06 10:18:14,680 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 174 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:14,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 836 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:18:14,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-02-06 10:18:14,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 167. [2025-02-06 10:18:14,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 130 states have (on average 1.6153846153846154) internal successors, (210), 166 states have internal predecessors, (210), 0 states have call successors, (0), 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:18:14,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 210 transitions. [2025-02-06 10:18:14,684 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 210 transitions. Word has length 46 [2025-02-06 10:18:14,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:14,684 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 210 transitions. [2025-02-06 10:18:14,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.388888888888889) internal successors, (97), 19 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:18:14,684 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 210 transitions. [2025-02-06 10:18:14,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 10:18:14,684 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:14,684 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 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:18:14,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 10:18:14,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-06 10:18:14,886 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:18:14,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:14,887 INFO L85 PathProgramCache]: Analyzing trace with hash -262892651, now seen corresponding path program 1 times [2025-02-06 10:18:14,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:14,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493373633] [2025-02-06 10:18:14,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:14,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:14,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 10:18:14,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:18:14,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:14,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:15,587 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:15,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:15,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493373633] [2025-02-06 10:18:15,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493373633] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:15,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1016018571] [2025-02-06 10:18:15,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:15,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:15,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:15,590 INFO L229 MonitoredProcess]: Starting monitored process 10 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:18:15,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 10:18:15,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 10:18:15,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:18:15,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:15,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:15,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-02-06 10:18:15,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:15,722 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:18:15,747 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 10:18:15,747 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:18:15,805 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:18:15,869 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2025-02-06 10:18:15,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2025-02-06 10:18:15,913 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 34 treesize of output 25 [2025-02-06 10:18:15,934 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 34 treesize of output 25 [2025-02-06 10:18:15,975 INFO L349 Elim1Store]: treesize reduction 72, result has 33.3 percent of original size [2025-02-06 10:18:15,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 48 [2025-02-06 10:18:16,103 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 42 treesize of output 31 [2025-02-06 10:18:16,135 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 32 [2025-02-06 10:18:16,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:18:16,233 INFO L349 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2025-02-06 10:18:16,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 91 [2025-02-06 10:18:16,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:18:16,718 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-06 10:18:16,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 117 treesize of output 44 [2025-02-06 10:18:16,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-02-06 10:18:16,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2025-02-06 10:18:16,960 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:16,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:18:17,179 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 8 treesize of output 4 [2025-02-06 10:18:18,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:18,268 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 198 treesize of output 129 [2025-02-06 10:18:18,271 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:18:18,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:18,278 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 450 treesize of output 450 [2025-02-06 10:18:18,285 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 178 treesize of output 162 [2025-02-06 10:18:18,291 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 45 treesize of output 41 [2025-02-06 10:18:18,302 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 8 treesize of output 4 [2025-02-06 10:18:18,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:18,310 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 54 treesize of output 54 [2025-02-06 10:18:19,366 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:19,366 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 293 treesize of output 183 [2025-02-06 10:18:19,370 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:18:19,383 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:19,383 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 1261 treesize of output 1251 [2025-02-06 10:18:19,392 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:18:19,395 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 199 treesize of output 183 [2025-02-06 10:18:19,401 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 19 treesize of output 15 [2025-02-06 10:18:19,407 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 8 treesize of output 4 [2025-02-06 10:18:19,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:19,416 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 33 treesize of output 33 [2025-02-06 10:18:31,446 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:31,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1016018571] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:18:31,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:18:31,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 21] total 49 [2025-02-06 10:18:31,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818460466] [2025-02-06 10:18:31,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:18:31,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-02-06 10:18:31,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:18:31,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-02-06 10:18:31,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=2106, Unknown=22, NotChecked=0, Total=2450 [2025-02-06 10:18:31,448 INFO L87 Difference]: Start difference. First operand 167 states and 210 transitions. Second operand has 50 states, 49 states have (on average 2.836734693877551) internal successors, (139), 50 states have internal predecessors, (139), 0 states have call successors, (0), 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:18:41,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2025-02-06 10:18:47,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:18:47,471 INFO L93 Difference]: Finished difference Result 209 states and 258 transitions. [2025-02-06 10:18:47,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-06 10:18:47,472 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.836734693877551) internal successors, (139), 50 states have internal predecessors, (139), 0 states have call successors, (0), 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 49 [2025-02-06 10:18:47,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:18:47,473 INFO L225 Difference]: With dead ends: 209 [2025-02-06 10:18:47,473 INFO L226 Difference]: Without dead ends: 209 [2025-02-06 10:18:47,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=639, Invalid=3120, Unknown=23, NotChecked=0, Total=3782 [2025-02-06 10:18:47,474 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 125 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 1794 mSolverCounterSat, 40 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 1835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 1794 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:18:47,474 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 992 Invalid, 1835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 1794 Invalid, 1 Unknown, 0 Unchecked, 13.1s Time] [2025-02-06 10:18:47,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-02-06 10:18:47,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 165. [2025-02-06 10:18:47,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 128 states have (on average 1.6015625) internal successors, (205), 164 states have internal predecessors, (205), 0 states have call successors, (0), 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:18:47,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 205 transitions. [2025-02-06 10:18:47,480 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 205 transitions. Word has length 49 [2025-02-06 10:18:47,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:18:47,480 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 205 transitions. [2025-02-06 10:18:47,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.836734693877551) internal successors, (139), 50 states have internal predecessors, (139), 0 states have call successors, (0), 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:18:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 205 transitions. [2025-02-06 10:18:47,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-06 10:18:47,481 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:18:47,481 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 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:18:47,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 10:18:47,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-06 10:18:47,686 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:18:47,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:18:47,686 INFO L85 PathProgramCache]: Analyzing trace with hash -262892650, now seen corresponding path program 1 times [2025-02-06 10:18:47,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:18:47,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440213344] [2025-02-06 10:18:47,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:47,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:18:47,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 10:18:47,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:18:47,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:47,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:49,770 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:49,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:18:49,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440213344] [2025-02-06 10:18:49,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440213344] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:18:49,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364554167] [2025-02-06 10:18:49,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:18:49,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:18:49,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:18:49,773 INFO L229 MonitoredProcess]: Starting monitored process 11 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:18:49,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 10:18:49,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 10:18:49,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 10:18:49,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:18:49,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:18:49,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 62 conjuncts are in the unsatisfiable core [2025-02-06 10:18:49,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:18:49,928 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:18:49,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:18:50,151 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:18:50,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-06 10:18:50,282 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 10:18:50,282 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:18:50,802 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:18:50,836 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:18:51,249 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2025-02-06 10:18:51,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2025-02-06 10:18:51,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2025-02-06 10:18:51,545 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 43 treesize of output 32 [2025-02-06 10:18:51,606 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:18:51,716 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 43 treesize of output 32 [2025-02-06 10:18:51,752 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:18:51,879 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-02-06 10:18:51,879 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 20 treesize of output 22 [2025-02-06 10:18:51,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 18 treesize of output 13 [2025-02-06 10:18:52,405 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:18:52,444 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 34 treesize of output 25 [2025-02-06 10:18:52,552 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 37 treesize of output 28 [2025-02-06 10:18:52,605 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 23 treesize of output 11 [2025-02-06 10:18:52,848 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-06 10:18:52,849 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 79 treesize of output 66 [2025-02-06 10:18:52,859 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 24 treesize of output 11 [2025-02-06 10:18:53,592 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 7 treesize of output 3 [2025-02-06 10:18:54,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:54,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 29 [2025-02-06 10:18:54,924 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:18:54,925 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:18:55,770 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_1663 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1663) |c_ULTIMATE.start_main_~data~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1664 (Array Int Int)) (v_ArrVal_1663 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1663) |c_ULTIMATE.start_main_~data~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1664) |c_ULTIMATE.start_main_~data~0#1.base|) .cse0)))))) is different from false [2025-02-06 10:18:55,805 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.offset| Int) (v_ArrVal_1663 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~data~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~data~0#1.offset| |ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1663) |c_ULTIMATE.start_main_~data~0#1.base|) .cse1) 4))) (forall ((|ULTIMATE.start_main_~lItem~0#1.offset| Int) (v_ArrVal_1664 (Array Int Int)) (v_ArrVal_1663 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~data~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~data~0#1.offset| |ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1663) |c_ULTIMATE.start_main_~data~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1664) |c_ULTIMATE.start_main_~data~0#1.base|) .cse1)))))) is different from false [2025-02-06 10:18:55,886 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.offset| Int) (v_ArrVal_1663 (Array Int Int)) (v_ArrVal_1660 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1660) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1663) |c_ULTIMATE.start_main_~data~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1659 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.offset| Int) (v_ArrVal_1664 (Array Int Int)) (v_ArrVal_1663 (Array Int Int)) (v_ArrVal_1660 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1660) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1663) |c_ULTIMATE.start_main_~data~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~data~0#1.base| (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1659) |c_ULTIMATE.start_main_~data~0#1.base|) |c_ULTIMATE.start_main_~data~0#1.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|)) |c_ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_1664) |c_ULTIMATE.start_main_~data~0#1.base|) .cse0)))))) is different from false [2025-02-06 10:18:58,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:58,474 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 51 treesize of output 42 [2025-02-06 10:18:58,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:58,547 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 175 treesize of output 168 [2025-02-06 10:18:58,566 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 29 treesize of output 25 [2025-02-06 10:18:58,577 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 13 treesize of output 9 [2025-02-06 10:18:58,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:58,969 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 105 treesize of output 96 [2025-02-06 10:18:58,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:58,989 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 85 treesize of output 76 [2025-02-06 10:18:59,041 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:59,042 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 481 treesize of output 474 [2025-02-06 10:18:59,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:18:59,122 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 813 treesize of output 782 [2025-02-06 10:18:59,138 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:18:59,154 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 45 treesize of output 41 [2025-02-06 10:18:59,168 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 25 treesize of output 21 [2025-02-06 10:18:59,182 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 21 treesize of output 17 [2025-02-06 10:19:02,145 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-02-06 10:19:02,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364554167] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:19:02,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:19:02,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 39 [2025-02-06 10:19:02,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115022497] [2025-02-06 10:19:02,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:19:02,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-06 10:19:02,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:19:02,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-06 10:19:02,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1162, Unknown=5, NotChecked=216, Total=1560 [2025-02-06 10:19:02,150 INFO L87 Difference]: Start difference. First operand 165 states and 205 transitions. Second operand has 40 states, 39 states have (on average 3.6153846153846154) internal successors, (141), 40 states have internal predecessors, (141), 0 states have call successors, (0), 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:19:06,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-02-06 10:19:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:19:21,956 INFO L93 Difference]: Finished difference Result 283 states and 339 transitions. [2025-02-06 10:19:21,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 10:19:21,958 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.6153846153846154) internal successors, (141), 40 states have internal predecessors, (141), 0 states have call successors, (0), 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 49 [2025-02-06 10:19:21,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:19:21,959 INFO L225 Difference]: With dead ends: 283 [2025-02-06 10:19:21,959 INFO L226 Difference]: Without dead ends: 283 [2025-02-06 10:19:21,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 961 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=649, Invalid=2780, Unknown=5, NotChecked=348, Total=3782 [2025-02-06 10:19:21,960 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 397 mSDsluCounter, 939 mSDsCounter, 0 mSdLazyCounter, 2146 mSolverCounterSat, 44 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2146 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 721 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:19:21,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 1008 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2146 Invalid, 2 Unknown, 721 Unchecked, 14.6s Time] [2025-02-06 10:19:21,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-02-06 10:19:21,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 176. [2025-02-06 10:19:21,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 139 states have (on average 1.618705035971223) internal successors, (225), 175 states have internal predecessors, (225), 0 states have call successors, (0), 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:19:21,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 225 transitions. [2025-02-06 10:19:21,963 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 225 transitions. Word has length 49 [2025-02-06 10:19:21,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:19:21,963 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 225 transitions. [2025-02-06 10:19:21,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.6153846153846154) internal successors, (141), 40 states have internal predecessors, (141), 0 states have call successors, (0), 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:19:21,964 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 225 transitions. [2025-02-06 10:19:21,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 10:19:21,964 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:19:21,964 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-06 10:19:21,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 10:19:22,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:22,170 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2025-02-06 10:19:22,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:19:22,170 INFO L85 PathProgramCache]: Analyzing trace with hash 440262444, now seen corresponding path program 1 times [2025-02-06 10:19:22,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:19:22,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249575400] [2025-02-06 10:19:22,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:22,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:19:22,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 10:19:22,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 10:19:22,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:22,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:19:23,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:19:23,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249575400] [2025-02-06 10:19:23,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249575400] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:19:23,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358785093] [2025-02-06 10:19:23,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:19:23,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:19:23,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:19:23,671 INFO L229 MonitoredProcess]: Starting monitored process 12 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:19:23,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 10:19:23,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 10:19:23,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 10:19:23,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:19:23,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:19:23,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-02-06 10:19:23,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:19:24,080 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:19:24,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-02-06 10:19:24,450 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 10:19:24,451 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:19:24,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-02-06 10:19:24,997 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 11 treesize of output 7 [2025-02-06 10:19:25,214 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 0 case distinctions, treesize of input 76 treesize of output 50 [2025-02-06 10:19:25,248 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 19 treesize of output 11 [2025-02-06 10:19:27,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:27,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 82 [2025-02-06 10:19:27,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:19:27,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 66