./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 15fe42cb945ebd9019cc38134c29264613097f232589ff55d01d33d66b19d85f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:04:59,406 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:04:59,449 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:04:59,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:04:59,457 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:04:59,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:04:59,472 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:04:59,472 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:04:59,472 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:04:59,472 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:04:59,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:04:59,473 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:04:59,473 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:04:59,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:04:59,473 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:04:59,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:04:59,473 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:04:59,473 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:04:59,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:04:59,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:04:59,474 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:04:59,474 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:04:59,474 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:04:59,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:04:59,474 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:04:59,474 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:04:59,474 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:04:59,474 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:04:59,474 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:04:59,474 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:04:59,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:04:59,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:04:59,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:04:59,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:04:59,475 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:04:59,475 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:04:59,475 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:04:59,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:04:59,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:04:59,475 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:04:59,475 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:04:59,476 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:04:59,476 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 -> 15fe42cb945ebd9019cc38134c29264613097f232589ff55d01d33d66b19d85f [2025-02-06 10:04:59,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:04:59,717 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:04:59,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:04:59,721 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:04:59,721 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:04:59,722 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.i [2025-02-06 10:05:00,848 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c67134a89/38c3d2e3223a45d381259faf2d0a2aed/FLAG8392cd886 [2025-02-06 10:05:01,097 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:05:01,098 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrcspn-alloca-1.i [2025-02-06 10:05:01,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c67134a89/38c3d2e3223a45d381259faf2d0a2aed/FLAG8392cd886 [2025-02-06 10:05:01,123 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c67134a89/38c3d2e3223a45d381259faf2d0a2aed [2025-02-06 10:05:01,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:05:01,126 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:05:01,127 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:05:01,127 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:05:01,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:05:01,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:05:01" (1/1) ... [2025-02-06 10:05:01,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f121fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01, skipping insertion in model container [2025-02-06 10:05:01,132 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:05:01" (1/1) ... [2025-02-06 10:05:01,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:05:01,366 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 10:05:01,366 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-02-06 10:05:01,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:05:01,379 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:05:01,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:05:01,422 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:05:01,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01 WrapperNode [2025-02-06 10:05:01,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:05:01,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:05:01,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:05:01,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:05:01,429 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:05:01" (1/1) ... [2025-02-06 10:05:01,437 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:05:01" (1/1) ... [2025-02-06 10:05:01,451 INFO L138 Inliner]: procedures = 117, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99 [2025-02-06 10:05:01,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:05:01,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:05:01,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:05:01,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:05:01,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01" (1/1) ... [2025-02-06 10:05:01,458 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01" (1/1) ... [2025-02-06 10:05:01,459 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01" (1/1) ... [2025-02-06 10:05:01,466 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [4, 5]. 56 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 4 writes are split as follows [2, 2]. [2025-02-06 10:05:01,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01" (1/1) ... [2025-02-06 10:05:01,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01" (1/1) ... [2025-02-06 10:05:01,473 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01" (1/1) ... [2025-02-06 10:05:01,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01" (1/1) ... [2025-02-06 10:05:01,474 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01" (1/1) ... [2025-02-06 10:05:01,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01" (1/1) ... [2025-02-06 10:05:01,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:05:01,481 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:05:01,481 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:05:01,481 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:05:01,482 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01" (1/1) ... [2025-02-06 10:05:01,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:05:01,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:01,505 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:05:01,507 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:05:01,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:05:01,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:05:01,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:05:01,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:05:01,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-06 10:05:01,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:05:01,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:05:01,524 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:05:01,601 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:05:01,602 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:05:01,765 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L554: havoc main_#t~ret18#1;call ULTIMATE.dealloc(main_#t~malloc12#1.base, main_#t~malloc12#1.offset);havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;call ULTIMATE.dealloc(main_#t~malloc13#1.base, main_#t~malloc13#1.offset);havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset; [2025-02-06 10:05:01,774 INFO L? ?]: Removed 64 outVars from TransFormulas that were not future-live. [2025-02-06 10:05:01,774 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:05:01,784 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:05:01,785 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:05:01,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:05:01 BoogieIcfgContainer [2025-02-06 10:05:01,785 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:05:01,786 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:05:01,786 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:05:01,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:05:01,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:05:01" (1/3) ... [2025-02-06 10:05:01,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b886df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:05:01, skipping insertion in model container [2025-02-06 10:05:01,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:05:01" (2/3) ... [2025-02-06 10:05:01,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b886df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:05:01, skipping insertion in model container [2025-02-06 10:05:01,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:05:01" (3/3) ... [2025-02-06 10:05:01,791 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrcspn-alloca-1.i [2025-02-06 10:05:01,801 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:05:01,802 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrcspn-alloca-1.i that has 1 procedures, 52 locations, 1 initial locations, 4 loop locations, and 19 error locations. [2025-02-06 10:05:01,835 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:05:01,846 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;@5a7ed7fe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:05:01,847 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-02-06 10:05:01,850 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 32 states have (on average 1.90625) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 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:05:01,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:05:01,855 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:01,856 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:01,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:01,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:01,862 INFO L85 PathProgramCache]: Analyzing trace with hash 565758687, now seen corresponding path program 1 times [2025-02-06 10:05:01,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:01,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006865329] [2025-02-06 10:05:01,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:01,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:01,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:05:01,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:05:01,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:01,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:02,053 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:05:02,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:02,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006865329] [2025-02-06 10:05:02,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006865329] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:02,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:02,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:05:02,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657166702] [2025-02-06 10:05:02,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:02,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:05:02,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:02,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:05:02,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:02,075 INFO L87 Difference]: Start difference. First operand has 52 states, 32 states have (on average 1.90625) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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:05:02,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:02,104 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2025-02-06 10:05:02,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:05:02,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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:05:02,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:02,112 INFO L225 Difference]: With dead ends: 62 [2025-02-06 10:05:02,112 INFO L226 Difference]: Without dead ends: 60 [2025-02-06 10:05:02,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:02,118 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 9 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:02,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 114 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:02,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-06 10:05:02,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2025-02-06 10:05:02,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 52 states have internal predecessors, (61), 0 states have call successors, (0), 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:05:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2025-02-06 10:05:02,143 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 7 [2025-02-06 10:05:02,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:02,143 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2025-02-06 10:05:02,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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:05:02,144 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2025-02-06 10:05:02,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:05:02,144 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:02,144 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:02,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:05:02,144 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:02,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:02,145 INFO L85 PathProgramCache]: Analyzing trace with hash 566682208, now seen corresponding path program 1 times [2025-02-06 10:05:02,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:02,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592420746] [2025-02-06 10:05:02,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:02,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:02,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:05:02,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:05:02,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:02,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:02,276 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:05:02,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:02,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592420746] [2025-02-06 10:05:02,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592420746] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:02,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:02,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:05:02,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978713615] [2025-02-06 10:05:02,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:02,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:05:02,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:02,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:05:02,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:05:02,278 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 3 states, 2 states have (on average 3.5) 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:05:02,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:02,319 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2025-02-06 10:05:02,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:05:02,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) 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:05:02,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:02,320 INFO L225 Difference]: With dead ends: 51 [2025-02-06 10:05:02,320 INFO L226 Difference]: Without dead ends: 51 [2025-02-06 10:05:02,320 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:05:02,321 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 13 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:02,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 69 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:02,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-02-06 10:05:02,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-02-06 10:05:02,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 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:05:02,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2025-02-06 10:05:02,324 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 7 [2025-02-06 10:05:02,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:02,325 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2025-02-06 10:05:02,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) 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:05:02,325 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2025-02-06 10:05:02,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-06 10:05:02,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:02,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:02,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:05:02,325 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:02,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:02,326 INFO L85 PathProgramCache]: Analyzing trace with hash 566682209, now seen corresponding path program 1 times [2025-02-06 10:05:02,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:02,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534189710] [2025-02-06 10:05:02,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:02,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:02,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 10:05:02,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 10:05:02,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:02,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:02,550 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:05:02,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:02,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534189710] [2025-02-06 10:05:02,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534189710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:02,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:02,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:05:02,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602006950] [2025-02-06 10:05:02,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:02,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:05:02,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:02,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:05:02,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:05:02,553 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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:05:02,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:02,626 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2025-02-06 10:05:02,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:05:02,627 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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:05:02,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:02,628 INFO L225 Difference]: With dead ends: 54 [2025-02-06 10:05:02,628 INFO L226 Difference]: Without dead ends: 54 [2025-02-06 10:05:02,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:05:02,629 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 19 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:02,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 117 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:02,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-06 10:05:02,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2025-02-06 10:05:02,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 52 states have internal predecessors, (62), 0 states have call successors, (0), 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:05:02,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2025-02-06 10:05:02,632 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 7 [2025-02-06 10:05:02,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:02,632 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2025-02-06 10:05:02,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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:05:02,632 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2025-02-06 10:05:02,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:05:02,633 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:02,633 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:02,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:05:02,633 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:02,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:02,633 INFO L85 PathProgramCache]: Analyzing trace with hash 358645079, now seen corresponding path program 1 times [2025-02-06 10:05:02,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:02,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780260253] [2025-02-06 10:05:02,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:02,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:02,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:05:02,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:05:02,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:02,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:02,758 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:05:02,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:02,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780260253] [2025-02-06 10:05:02,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780260253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:02,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:02,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:05:02,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365628347] [2025-02-06 10:05:02,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:02,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:05:02,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:02,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:05:02,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:02,760 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:02,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:02,775 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2025-02-06 10:05:02,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:05:02,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 10:05:02,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:02,776 INFO L225 Difference]: With dead ends: 59 [2025-02-06 10:05:02,776 INFO L226 Difference]: Without dead ends: 59 [2025-02-06 10:05:02,777 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:02,777 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 11 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:02,777 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 99 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:02,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-06 10:05:02,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2025-02-06 10:05:02,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 40 states have (on average 1.725) internal successors, (69), 56 states have internal predecessors, (69), 0 states have call successors, (0), 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:05:02,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2025-02-06 10:05:02,780 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 8 [2025-02-06 10:05:02,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:02,780 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2025-02-06 10:05:02,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:02,780 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2025-02-06 10:05:02,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:05:02,781 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:02,781 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:02,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:05:02,781 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:02,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:02,781 INFO L85 PathProgramCache]: Analyzing trace with hash 358645238, now seen corresponding path program 1 times [2025-02-06 10:05:02,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:02,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183419] [2025-02-06 10:05:02,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:02,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:02,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:05:02,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:05:02,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:02,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:02,816 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:05:02,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:02,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183419] [2025-02-06 10:05:02,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:02,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:02,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:05:02,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910384717] [2025-02-06 10:05:02,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:02,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:05:02,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:02,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:05:02,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:02,817 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:02,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:02,837 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2025-02-06 10:05:02,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:05:02,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 10:05:02,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:02,838 INFO L225 Difference]: With dead ends: 73 [2025-02-06 10:05:02,838 INFO L226 Difference]: Without dead ends: 73 [2025-02-06 10:05:02,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:02,838 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 8 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:02,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 141 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:02,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-02-06 10:05:02,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2025-02-06 10:05:02,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 50 states have (on average 1.64) internal successors, (82), 66 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:02,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2025-02-06 10:05:02,843 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 8 [2025-02-06 10:05:02,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:02,844 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2025-02-06 10:05:02,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:02,845 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2025-02-06 10:05:02,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:05:02,845 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:02,845 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:02,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:05:02,845 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:02,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:02,846 INFO L85 PathProgramCache]: Analyzing trace with hash 359568759, now seen corresponding path program 1 times [2025-02-06 10:05:02,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:02,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526408616] [2025-02-06 10:05:02,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:02,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:02,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:05:02,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:05:02,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:02,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:02,947 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:05:02,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:02,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526408616] [2025-02-06 10:05:02,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526408616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:02,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:02,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:05:02,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624653627] [2025-02-06 10:05:02,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:02,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:05:02,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:02,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:05:02,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:05:02,951 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:03,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:03,011 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2025-02-06 10:05:03,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:05:03,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 10:05:03,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:03,012 INFO L225 Difference]: With dead ends: 66 [2025-02-06 10:05:03,013 INFO L226 Difference]: Without dead ends: 66 [2025-02-06 10:05:03,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:05:03,013 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 25 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:03,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 132 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:03,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-02-06 10:05:03,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2025-02-06 10:05:03,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.58) internal successors, (79), 64 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:03,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2025-02-06 10:05:03,020 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 8 [2025-02-06 10:05:03,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:03,021 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2025-02-06 10:05:03,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:03,021 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2025-02-06 10:05:03,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:05:03,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:03,021 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:03,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:05:03,022 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:03,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:03,022 INFO L85 PathProgramCache]: Analyzing trace with hash 359568760, now seen corresponding path program 1 times [2025-02-06 10:05:03,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:03,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174789596] [2025-02-06 10:05:03,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:03,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:03,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:05:03,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:05:03,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:03,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:03,154 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:05:03,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:03,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174789596] [2025-02-06 10:05:03,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174789596] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:03,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:03,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:05:03,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059151684] [2025-02-06 10:05:03,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:03,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:05:03,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:03,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:05:03,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:05:03,156 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:03,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:03,230 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2025-02-06 10:05:03,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:05:03,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 10:05:03,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:03,231 INFO L225 Difference]: With dead ends: 71 [2025-02-06 10:05:03,231 INFO L226 Difference]: Without dead ends: 71 [2025-02-06 10:05:03,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:05:03,232 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 29 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:03,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 126 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:03,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-06 10:05:03,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2025-02-06 10:05:03,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.5740740740740742) internal successors, (85), 68 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:05:03,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2025-02-06 10:05:03,235 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 8 [2025-02-06 10:05:03,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:03,235 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2025-02-06 10:05:03,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:03,235 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2025-02-06 10:05:03,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-06 10:05:03,235 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:03,235 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:03,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:05:03,236 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:03,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:03,236 INFO L85 PathProgramCache]: Analyzing trace with hash 387274230, now seen corresponding path program 1 times [2025-02-06 10:05:03,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:03,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064388963] [2025-02-06 10:05:03,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:03,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:03,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 10:05:03,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 10:05:03,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:03,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:03,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:03,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064388963] [2025-02-06 10:05:03,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064388963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:03,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:03,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:05:03,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764530822] [2025-02-06 10:05:03,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:03,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:05:03,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:03,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:05:03,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:05:03,333 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:03,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:03,359 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2025-02-06 10:05:03,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:05:03,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-02-06 10:05:03,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:03,360 INFO L225 Difference]: With dead ends: 79 [2025-02-06 10:05:03,360 INFO L226 Difference]: Without dead ends: 79 [2025-02-06 10:05:03,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:05:03,360 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 28 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:03,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 84 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:03,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-06 10:05:03,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2025-02-06 10:05:03,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.5740740740740742) internal successors, (85), 68 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:05:03,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2025-02-06 10:05:03,364 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 8 [2025-02-06 10:05:03,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:03,364 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2025-02-06 10:05:03,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:03,364 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2025-02-06 10:05:03,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 10:05:03,364 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:03,364 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:03,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:05:03,365 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:03,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:03,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1766904454, now seen corresponding path program 1 times [2025-02-06 10:05:03,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:03,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888360630] [2025-02-06 10:05:03,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:03,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:03,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 10:05:03,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 10:05:03,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:03,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:03,424 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:05:03,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:03,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888360630] [2025-02-06 10:05:03,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888360630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:03,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:03,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:05:03,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528439464] [2025-02-06 10:05:03,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:03,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:05:03,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:03,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:05:03,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:03,426 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:03,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:03,460 INFO L93 Difference]: Finished difference Result 74 states and 89 transitions. [2025-02-06 10:05:03,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:05:03,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 10:05:03,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:03,461 INFO L225 Difference]: With dead ends: 74 [2025-02-06 10:05:03,461 INFO L226 Difference]: Without dead ends: 74 [2025-02-06 10:05:03,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:03,462 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 5 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:03,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 119 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:03,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-06 10:05:03,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2025-02-06 10:05:03,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 57 states have (on average 1.5614035087719298) internal successors, (89), 71 states have internal predecessors, (89), 0 states have call successors, (0), 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:05:03,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2025-02-06 10:05:03,470 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 9 [2025-02-06 10:05:03,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:03,470 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2025-02-06 10:05:03,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:03,471 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2025-02-06 10:05:03,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 10:05:03,471 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:03,472 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:03,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:05:03,472 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:03,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:03,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1738275303, now seen corresponding path program 1 times [2025-02-06 10:05:03,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:03,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518015218] [2025-02-06 10:05:03,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:03,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:03,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 10:05:03,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 10:05:03,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:03,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:03,557 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:05:03,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:03,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518015218] [2025-02-06 10:05:03,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518015218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:03,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:03,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:05:03,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201760325] [2025-02-06 10:05:03,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:03,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:05:03,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:03,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:05:03,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:05:03,558 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:03,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:03,580 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2025-02-06 10:05:03,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:05:03,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 10:05:03,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:03,580 INFO L225 Difference]: With dead ends: 71 [2025-02-06 10:05:03,580 INFO L226 Difference]: Without dead ends: 71 [2025-02-06 10:05:03,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:05:03,581 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 18 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:03,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 108 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:03,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-06 10:05:03,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2025-02-06 10:05:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 54 states have (on average 1.5555555555555556) internal successors, (84), 67 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:03,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2025-02-06 10:05:03,588 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 9 [2025-02-06 10:05:03,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:03,588 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2025-02-06 10:05:03,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:03,589 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2025-02-06 10:05:03,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-06 10:05:03,589 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:03,589 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:03,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:05:03,589 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:03,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:03,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1486754118, now seen corresponding path program 1 times [2025-02-06 10:05:03,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:03,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509726669] [2025-02-06 10:05:03,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:03,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:03,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:05:03,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:05:03,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:03,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:03,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:03,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509726669] [2025-02-06 10:05:03,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509726669] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:03,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022584027] [2025-02-06 10:05:03,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:03,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:03,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:03,773 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:05:03,774 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:05:03,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 10:05:03,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 10:05:03,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:03,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:03,817 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-06 10:05:03,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:03,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:05:03,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 7 [2025-02-06 10:05:03,888 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:05:04,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:04,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:04,132 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:05:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:04,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2022584027] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:04,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:04,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 13 [2025-02-06 10:05:04,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675310598] [2025-02-06 10:05:04,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:04,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 10:05:04,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:04,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 10:05:04,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:05:04,149 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:04,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:04,310 INFO L93 Difference]: Finished difference Result 71 states and 88 transitions. [2025-02-06 10:05:04,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:05:04,310 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-02-06 10:05:04,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:04,311 INFO L225 Difference]: With dead ends: 71 [2025-02-06 10:05:04,311 INFO L226 Difference]: Without dead ends: 71 [2025-02-06 10:05:04,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:05:04,311 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 16 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:04,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 245 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:04,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-06 10:05:04,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2025-02-06 10:05:04,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 52 states have (on average 1.5384615384615385) internal successors, (80), 64 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:04,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 80 transitions. [2025-02-06 10:05:04,313 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 80 transitions. Word has length 10 [2025-02-06 10:05:04,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:04,313 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 80 transitions. [2025-02-06 10:05:04,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:04,313 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 80 transitions. [2025-02-06 10:05:04,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:05:04,315 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:04,315 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:04,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 10:05:04,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-06 10:05:04,520 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:04,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:04,520 INFO L85 PathProgramCache]: Analyzing trace with hash 264485117, now seen corresponding path program 1 times [2025-02-06 10:05:04,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:04,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208111549] [2025-02-06 10:05:04,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:04,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:04,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:05:04,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:05:04,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:04,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:04,700 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:04,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:04,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208111549] [2025-02-06 10:05:04,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208111549] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:04,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917537442] [2025-02-06 10:05:04,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:04,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:04,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:04,702 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:05:04,704 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:05:04,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:05:04,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:05:04,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:04,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:04,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 10:05:04,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:04,765 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 7 [2025-02-06 10:05:04,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-02-06 10:05:04,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:04,908 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:05,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917537442] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:05,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:05,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-02-06 10:05:05,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139366789] [2025-02-06 10:05:05,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:05,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 10:05:05,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:05,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 10:05:05,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:05:05,087 INFO L87 Difference]: Start difference. First operand 65 states and 80 transitions. Second operand has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:05,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:05,282 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2025-02-06 10:05:05,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:05:05,282 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 10:05:05,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:05,282 INFO L225 Difference]: With dead ends: 68 [2025-02-06 10:05:05,282 INFO L226 Difference]: Without dead ends: 68 [2025-02-06 10:05:05,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=414, Unknown=0, NotChecked=0, Total=600 [2025-02-06 10:05:05,283 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 21 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:05,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 259 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:05,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-06 10:05:05,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2025-02-06 10:05:05,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 48 states have (on average 1.5) internal successors, (72), 59 states have internal predecessors, (72), 0 states have call successors, (0), 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:05:05,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2025-02-06 10:05:05,285 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 11 [2025-02-06 10:05:05,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:05,285 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2025-02-06 10:05:05,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.631578947368421) internal successors, (31), 20 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:05,285 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2025-02-06 10:05:05,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-06 10:05:05,285 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:05,285 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:05,291 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:05:05,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:05,486 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:05,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:05,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1155257533, now seen corresponding path program 1 times [2025-02-06 10:05:05,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:05,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415081506] [2025-02-06 10:05:05,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:05,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:05,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:05:05,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:05:05,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:05,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:05,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:05,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:05,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415081506] [2025-02-06 10:05:05,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415081506] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:05,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [8433465] [2025-02-06 10:05:05,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:05,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:05,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:05,655 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:05:05,656 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:05:05,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 10:05:05,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 10:05:05,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:05,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:05,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-06 10:05:05,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:05,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:05:05,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 7 [2025-02-06 10:05:05,726 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:05:05,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:05,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:05,838 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:05:05,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:05,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [8433465] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:05,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-06 10:05:05,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 12 [2025-02-06 10:05:05,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240385388] [2025-02-06 10:05:05,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:05,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:05:05,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:05,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:05:05,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-02-06 10:05:05,860 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:05,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:05,929 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2025-02-06 10:05:05,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:05:05,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-06 10:05:05,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:05,929 INFO L225 Difference]: With dead ends: 59 [2025-02-06 10:05:05,929 INFO L226 Difference]: Without dead ends: 59 [2025-02-06 10:05:05,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-02-06 10:05:05,930 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 13 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:05,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 133 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:05,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-06 10:05:05,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2025-02-06 10:05:05,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.4878048780487805) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 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:05:05,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2025-02-06 10:05:05,931 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 11 [2025-02-06 10:05:05,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:05,931 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2025-02-06 10:05:05,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:05,931 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2025-02-06 10:05:05,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:05:05,931 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:05,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:05,941 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:05:06,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:06,132 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:06,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:06,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1268574706, now seen corresponding path program 1 times [2025-02-06 10:05:06,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:06,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929018922] [2025-02-06 10:05:06,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:06,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:06,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:05:06,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:05:06,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:06,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:06,163 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:05:06,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:06,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929018922] [2025-02-06 10:05:06,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929018922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:06,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:06,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:05:06,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255620933] [2025-02-06 10:05:06,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:06,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:05:06,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:06,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:05:06,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:06,164 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:06,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:06,192 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2025-02-06 10:05:06,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:05:06,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-06 10:05:06,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:06,193 INFO L225 Difference]: With dead ends: 50 [2025-02-06 10:05:06,193 INFO L226 Difference]: Without dead ends: 50 [2025-02-06 10:05:06,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:06,193 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 31 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:06,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 60 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:06,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-06 10:05:06,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-06 10:05:06,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 41 states have (on average 1.4390243902439024) internal successors, (59), 49 states have internal predecessors, (59), 0 states have call successors, (0), 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:05:06,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 59 transitions. [2025-02-06 10:05:06,195 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 59 transitions. Word has length 12 [2025-02-06 10:05:06,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:06,195 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 59 transitions. [2025-02-06 10:05:06,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:06,195 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2025-02-06 10:05:06,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:05:06,195 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:06,195 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:06,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 10:05:06,195 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:06,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:06,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1268574707, now seen corresponding path program 1 times [2025-02-06 10:05:06,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:06,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372123960] [2025-02-06 10:05:06,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:06,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:06,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:05:06,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:05:06,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:06,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:06,267 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:05:06,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:06,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372123960] [2025-02-06 10:05:06,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372123960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:06,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:06,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:05:06,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401818052] [2025-02-06 10:05:06,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:06,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:05:06,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:06,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:05:06,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:05:06,268 INFO L87 Difference]: Start difference. First operand 50 states and 59 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:06,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:06,327 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2025-02-06 10:05:06,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:05:06,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-06 10:05:06,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:06,328 INFO L225 Difference]: With dead ends: 80 [2025-02-06 10:05:06,328 INFO L226 Difference]: Without dead ends: 80 [2025-02-06 10:05:06,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:05:06,328 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 41 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:06,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 105 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:06,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-02-06 10:05:06,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 54. [2025-02-06 10:05:06,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 53 states have internal predecessors, (64), 0 states have call successors, (0), 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:05:06,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2025-02-06 10:05:06,330 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 12 [2025-02-06 10:05:06,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:06,330 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2025-02-06 10:05:06,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:06,330 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2025-02-06 10:05:06,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-06 10:05:06,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:06,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:06,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 10:05:06,330 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:06,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:06,333 INFO L85 PathProgramCache]: Analyzing trace with hash -27954641, now seen corresponding path program 1 times [2025-02-06 10:05:06,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:06,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406294666] [2025-02-06 10:05:06,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:06,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:06,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-06 10:05:06,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-06 10:05:06,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:06,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:06,437 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:05:06,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:06,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406294666] [2025-02-06 10:05:06,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406294666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:06,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:06,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:05:06,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179701187] [2025-02-06 10:05:06,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:06,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 10:05:06,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:06,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 10:05:06,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:06,438 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:06,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:06,460 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2025-02-06 10:05:06,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 10:05:06,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-06 10:05:06,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:06,460 INFO L225 Difference]: With dead ends: 53 [2025-02-06 10:05:06,461 INFO L226 Difference]: Without dead ends: 50 [2025-02-06 10:05:06,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 10:05:06,461 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 31 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:06,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 62 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:06,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-06 10:05:06,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-06 10:05:06,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 42 states have (on average 1.380952380952381) internal successors, (58), 49 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:05:06,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2025-02-06 10:05:06,462 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 16 [2025-02-06 10:05:06,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:06,462 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2025-02-06 10:05:06,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:06,462 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2025-02-06 10:05:06,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 10:05:06,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:06,463 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:06,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 10:05:06,463 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:06,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:06,463 INFO L85 PathProgramCache]: Analyzing trace with hash -864868942, now seen corresponding path program 1 times [2025-02-06 10:05:06,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:06,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560436002] [2025-02-06 10:05:06,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:06,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:06,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:05:06,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:05:06,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:06,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:06,500 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:05:06,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:06,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560436002] [2025-02-06 10:05:06,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560436002] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:06,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:06,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 10:05:06,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141546335] [2025-02-06 10:05:06,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:06,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 10:05:06,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:06,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 10:05:06,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 10:05:06,502 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:06,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:06,536 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2025-02-06 10:05:06,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 10:05:06,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-06 10:05:06,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:06,536 INFO L225 Difference]: With dead ends: 47 [2025-02-06 10:05:06,536 INFO L226 Difference]: Without dead ends: 47 [2025-02-06 10:05:06,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:05:06,537 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 36 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:06,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 62 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:06,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-06 10:05:06,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-06 10:05:06,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 46 states have internal predecessors, (55), 0 states have call successors, (0), 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:05:06,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2025-02-06 10:05:06,539 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 17 [2025-02-06 10:05:06,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:06,539 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2025-02-06 10:05:06,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:06,539 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2025-02-06 10:05:06,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 10:05:06,540 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:06,540 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:06,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 10:05:06,540 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:06,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:06,540 INFO L85 PathProgramCache]: Analyzing trace with hash -864868941, now seen corresponding path program 1 times [2025-02-06 10:05:06,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:06,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998521472] [2025-02-06 10:05:06,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:06,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:06,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:05:06,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:05:06,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:06,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:06,665 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:05:06,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:06,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998521472] [2025-02-06 10:05:06,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998521472] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:06,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:06,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 10:05:06,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857936818] [2025-02-06 10:05:06,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:06,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:05:06,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:06,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:05:06,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:05:06,666 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:06,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:06,732 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2025-02-06 10:05:06,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:05:06,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-06 10:05:06,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:06,733 INFO L225 Difference]: With dead ends: 59 [2025-02-06 10:05:06,733 INFO L226 Difference]: Without dead ends: 59 [2025-02-06 10:05:06,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:05:06,734 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 53 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:06,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 78 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:06,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-02-06 10:05:06,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2025-02-06 10:05:06,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.3) internal successors, (65), 54 states have internal predecessors, (65), 0 states have call successors, (0), 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:05:06,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2025-02-06 10:05:06,735 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 17 [2025-02-06 10:05:06,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:06,735 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2025-02-06 10:05:06,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:06,735 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2025-02-06 10:05:06,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 10:05:06,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:06,736 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] [2025-02-06 10:05:06,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 10:05:06,736 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:06,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:06,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1446067361, now seen corresponding path program 1 times [2025-02-06 10:05:06,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:06,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220381442] [2025-02-06 10:05:06,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:06,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:06,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 10:05:06,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 10:05:06,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:06,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:06,759 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:05:06,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:06,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220381442] [2025-02-06 10:05:06,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220381442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:06,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:06,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:05:06,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453570392] [2025-02-06 10:05:06,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:06,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:05:06,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:06,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:05:06,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:05:06,761 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:06,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:06,767 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2025-02-06 10:05:06,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:05:06,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-06 10:05:06,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:06,767 INFO L225 Difference]: With dead ends: 57 [2025-02-06 10:05:06,768 INFO L226 Difference]: Without dead ends: 57 [2025-02-06 10:05:06,768 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:05:06,768 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:06,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:06,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-02-06 10:05:06,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-02-06 10:05:06,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.2884615384615385) internal successors, (67), 56 states have internal predecessors, (67), 0 states have call successors, (0), 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:05:06,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2025-02-06 10:05:06,771 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 22 [2025-02-06 10:05:06,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:06,771 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2025-02-06 10:05:06,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:06,771 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2025-02-06 10:05:06,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:05:06,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:06,773 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:05:06,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 10:05:06,774 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:06,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:06,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1925758685, now seen corresponding path program 1 times [2025-02-06 10:05:06,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:06,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166649619] [2025-02-06 10:05:06,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:06,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:06,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:05:06,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:05:06,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:06,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:06,883 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:05:06,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:06,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166649619] [2025-02-06 10:05:06,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166649619] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:06,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:06,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:05:06,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531858594] [2025-02-06 10:05:06,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:06,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:05:06,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:06,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:05:06,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:05:06,885 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:06,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:06,913 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2025-02-06 10:05:06,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:05:06,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-06 10:05:06,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:06,914 INFO L225 Difference]: With dead ends: 67 [2025-02-06 10:05:06,914 INFO L226 Difference]: Without dead ends: 52 [2025-02-06 10:05:06,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:05:06,914 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:06,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 159 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:06,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-02-06 10:05:06,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-02-06 10:05:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 51 states have internal predecessors, (60), 0 states have call successors, (0), 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:05:06,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2025-02-06 10:05:06,915 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 24 [2025-02-06 10:05:06,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:06,915 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2025-02-06 10:05:06,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:06,916 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2025-02-06 10:05:06,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:05:06,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:06,916 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:05:06,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 10:05:06,916 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:06,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:06,916 INFO L85 PathProgramCache]: Analyzing trace with hash 331152322, now seen corresponding path program 1 times [2025-02-06 10:05:06,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:06,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041358785] [2025-02-06 10:05:06,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:06,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:06,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:05:06,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:05:06,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:06,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:07,066 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:05:07,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:07,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041358785] [2025-02-06 10:05:07,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041358785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:07,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:07,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 10:05:07,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904911413] [2025-02-06 10:05:07,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:07,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:05:07,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:07,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:05:07,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:05:07,068 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:07,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:07,111 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2025-02-06 10:05:07,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:05:07,112 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-06 10:05:07,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:07,112 INFO L225 Difference]: With dead ends: 68 [2025-02-06 10:05:07,112 INFO L226 Difference]: Without dead ends: 58 [2025-02-06 10:05:07,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:05:07,113 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 24 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:07,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 141 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:05:07,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-06 10:05:07,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2025-02-06 10:05:07,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.2653061224489797) internal successors, (62), 53 states have internal predecessors, (62), 0 states have call successors, (0), 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:05:07,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2025-02-06 10:05:07,115 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 24 [2025-02-06 10:05:07,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:07,115 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2025-02-06 10:05:07,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:07,116 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2025-02-06 10:05:07,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:05:07,116 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:07,116 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:05:07,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 10:05:07,116 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:07,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:07,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1154681993, now seen corresponding path program 1 times [2025-02-06 10:05:07,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:07,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345542349] [2025-02-06 10:05:07,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:07,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:07,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:05:07,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:05:07,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:07,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:07,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:07,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345542349] [2025-02-06 10:05:07,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345542349] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:07,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:07,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 10:05:07,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607863842] [2025-02-06 10:05:07,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:07,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 10:05:07,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:07,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 10:05:07,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 10:05:07,285 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 9 states, 9 states have (on average 3.0) 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:05:07,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:07,360 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2025-02-06 10:05:07,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:05:07,360 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) 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:05:07,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:07,361 INFO L225 Difference]: With dead ends: 75 [2025-02-06 10:05:07,361 INFO L226 Difference]: Without dead ends: 75 [2025-02-06 10:05:07,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-06 10:05:07,362 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:07,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 181 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:07,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-06 10:05:07,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2025-02-06 10:05:07,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 68 states have (on average 1.2205882352941178) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:07,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2025-02-06 10:05:07,363 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 27 [2025-02-06 10:05:07,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:07,363 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2025-02-06 10:05:07,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) 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:05:07,364 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2025-02-06 10:05:07,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:05:07,364 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:07,364 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:05:07,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 10:05:07,364 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:07,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:07,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1180325733, now seen corresponding path program 1 times [2025-02-06 10:05:07,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:07,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858303135] [2025-02-06 10:05:07,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:07,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:07,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:05:07,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:05:07,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:07,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:07,510 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:05:07,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:07,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858303135] [2025-02-06 10:05:07,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858303135] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:07,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201952528] [2025-02-06 10:05:07,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:07,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:07,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:07,513 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:05:07,516 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:05:07,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:05:07,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:05:07,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:07,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:07,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-06 10:05:07,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:07,661 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:05:07,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:07,757 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 5 treesize of output 3 [2025-02-06 10:05:07,776 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:05:07,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201952528] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:07,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:07,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2025-02-06 10:05:07,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553433587] [2025-02-06 10:05:07,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:07,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 10:05:07,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:07,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 10:05:07,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-02-06 10:05:07,778 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 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:05:07,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:07,872 INFO L93 Difference]: Finished difference Result 146 states and 163 transitions. [2025-02-06 10:05:07,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 10:05:07,872 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 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:05:07,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:07,873 INFO L225 Difference]: With dead ends: 146 [2025-02-06 10:05:07,873 INFO L226 Difference]: Without dead ends: 146 [2025-02-06 10:05:07,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-02-06 10:05:07,874 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 86 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:07,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 172 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:07,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-02-06 10:05:07,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 104. [2025-02-06 10:05:07,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.2) internal successors, (120), 103 states have internal predecessors, (120), 0 states have call successors, (0), 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:05:07,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2025-02-06 10:05:07,876 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 27 [2025-02-06 10:05:07,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:07,876 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2025-02-06 10:05:07,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.0625) internal successors, (65), 17 states have internal predecessors, (65), 0 states have call successors, (0), 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:05:07,876 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2025-02-06 10:05:07,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-06 10:05:07,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:07,877 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:05:07,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 10:05:08,077 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:05:08,077 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:08,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:08,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1087675240, now seen corresponding path program 1 times [2025-02-06 10:05:08,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:08,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028057122] [2025-02-06 10:05:08,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:08,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:08,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-06 10:05:08,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-06 10:05:08,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:08,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:08,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:08,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:08,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028057122] [2025-02-06 10:05:08,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028057122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:05:08,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:05:08,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 10:05:08,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384471432] [2025-02-06 10:05:08,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:05:08,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 10:05:08,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:08,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 10:05:08,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-06 10:05:08,259 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) 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:05:08,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:08,345 INFO L93 Difference]: Finished difference Result 137 states and 154 transitions. [2025-02-06 10:05:08,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 10:05:08,345 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) 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:05:08,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:08,345 INFO L225 Difference]: With dead ends: 137 [2025-02-06 10:05:08,345 INFO L226 Difference]: Without dead ends: 137 [2025-02-06 10:05:08,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2025-02-06 10:05:08,346 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:08,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 193 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:08,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-02-06 10:05:08,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 105. [2025-02-06 10:05:08,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 101 states have (on average 1.2079207920792079) internal successors, (122), 104 states have internal predecessors, (122), 0 states have call successors, (0), 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:05:08,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 122 transitions. [2025-02-06 10:05:08,348 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 122 transitions. Word has length 27 [2025-02-06 10:05:08,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:08,348 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 122 transitions. [2025-02-06 10:05:08,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) 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:05:08,348 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 122 transitions. [2025-02-06 10:05:08,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-06 10:05:08,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:08,349 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:05:08,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 10:05:08,349 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:08,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:08,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1678370021, now seen corresponding path program 1 times [2025-02-06 10:05:08,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:08,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73130175] [2025-02-06 10:05:08,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:08,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:08,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:05:08,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:05:08,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:08,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:08,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:08,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:08,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73130175] [2025-02-06 10:05:08,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73130175] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:08,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325843036] [2025-02-06 10:05:08,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:05:08,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:08,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:08,507 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:05:08,509 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:05:08,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 10:05:08,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 10:05:08,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:08,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:08,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 10:05:08,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:08,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:08,710 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:08,795 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:05:08,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:08,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325843036] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:08,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:08,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2025-02-06 10:05:08,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758782490] [2025-02-06 10:05:08,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:08,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 10:05:08,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:08,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 10:05:08,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2025-02-06 10:05:08,867 INFO L87 Difference]: Start difference. First operand 105 states and 122 transitions. Second operand has 23 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:09,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:09,043 INFO L93 Difference]: Finished difference Result 124 states and 142 transitions. [2025-02-06 10:05:09,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 10:05:09,046 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2025-02-06 10:05:09,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:09,046 INFO L225 Difference]: With dead ends: 124 [2025-02-06 10:05:09,046 INFO L226 Difference]: Without dead ends: 124 [2025-02-06 10:05:09,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2025-02-06 10:05:09,047 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 103 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:09,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 353 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:09,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2025-02-06 10:05:09,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 103. [2025-02-06 10:05:09,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 101 states have (on average 1.1683168316831682) internal successors, (118), 102 states have internal predecessors, (118), 0 states have call successors, (0), 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:05:09,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2025-02-06 10:05:09,049 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 30 [2025-02-06 10:05:09,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:09,050 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2025-02-06 10:05:09,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.6363636363636362) internal successors, (80), 23 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:09,050 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2025-02-06 10:05:09,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-02-06 10:05:09,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:09,050 INFO L218 NwaCegarLoop]: trace histogram [3, 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:05:09,058 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:05:09,250 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,SelfDestructingSolverStorable24 [2025-02-06 10:05:09,251 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:09,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:09,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1420401231, now seen corresponding path program 2 times [2025-02-06 10:05:09,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:09,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851783079] [2025-02-06 10:05:09,251 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:05:09,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:09,261 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-06 10:05:09,273 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 10:05:09,274 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:05:09,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:09,556 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:09,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:09,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851783079] [2025-02-06 10:05:09,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851783079] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:09,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685106152] [2025-02-06 10:05:09,556 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:05:09,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:09,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:09,558 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:05:09,559 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:05:09,601 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-06 10:05:09,618 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 10:05:09,618 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:05:09,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:09,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 10:05:09,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:09,667 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 13 treesize of output 9 [2025-02-06 10:05:09,716 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:09,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:09,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2025-02-06 10:05:09,740 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 16 treesize of output 12 [2025-02-06 10:05:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:09,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685106152] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:09,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:09,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 22 [2025-02-06 10:05:09,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695825889] [2025-02-06 10:05:09,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:09,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 10:05:09,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:09,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 10:05:09,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2025-02-06 10:05:09,780 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 0 states have call successors, (0), 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:05:10,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:10,023 INFO L93 Difference]: Finished difference Result 156 states and 176 transitions. [2025-02-06 10:05:10,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 10:05:10,023 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 0 states have call successors, (0), 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 37 [2025-02-06 10:05:10,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:10,024 INFO L225 Difference]: With dead ends: 156 [2025-02-06 10:05:10,024 INFO L226 Difference]: Without dead ends: 156 [2025-02-06 10:05:10,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2025-02-06 10:05:10,025 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 68 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:10,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 443 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:10,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-02-06 10:05:10,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 149. [2025-02-06 10:05:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 147 states have (on average 1.1564625850340136) internal successors, (170), 148 states have internal predecessors, (170), 0 states have call successors, (0), 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:05:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 170 transitions. [2025-02-06 10:05:10,027 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 170 transitions. Word has length 37 [2025-02-06 10:05:10,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:10,027 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 170 transitions. [2025-02-06 10:05:10,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 22 states have internal predecessors, (65), 0 states have call successors, (0), 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:05:10,028 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 170 transitions. [2025-02-06 10:05:10,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 10:05:10,028 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:10,028 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:10,034 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:05:10,228 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,SelfDestructingSolverStorable25 [2025-02-06 10:05:10,228 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:10,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:10,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1444503153, now seen corresponding path program 2 times [2025-02-06 10:05:10,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:10,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327234369] [2025-02-06 10:05:10,229 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:05:10,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:10,236 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-06 10:05:10,248 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:05:10,248 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:05:10,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:10,468 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:10,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:10,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327234369] [2025-02-06 10:05:10,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327234369] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:10,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775133105] [2025-02-06 10:05:10,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:05:10,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:10,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:10,471 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:05:10,472 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:05:10,518 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-06 10:05:10,535 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:05:10,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:05:10,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:10,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-02-06 10:05:10,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:10,579 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 13 treesize of output 9 [2025-02-06 10:05:10,713 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:10,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:10,820 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:05:10,822 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 16 treesize of output 12 [2025-02-06 10:05:10,867 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:10,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775133105] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:10,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:10,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 15, 15] total 28 [2025-02-06 10:05:10,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160918031] [2025-02-06 10:05:10,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:10,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 10:05:10,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:10,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 10:05:10,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2025-02-06 10:05:10,869 INFO L87 Difference]: Start difference. First operand 149 states and 170 transitions. Second operand has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 28 states have internal predecessors, (81), 0 states have call successors, (0), 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:05:11,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:11,031 INFO L93 Difference]: Finished difference Result 241 states and 270 transitions. [2025-02-06 10:05:11,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:05:11,032 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 28 states have internal predecessors, (81), 0 states have call successors, (0), 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 39 [2025-02-06 10:05:11,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:11,032 INFO L225 Difference]: With dead ends: 241 [2025-02-06 10:05:11,032 INFO L226 Difference]: Without dead ends: 191 [2025-02-06 10:05:11,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=111, Invalid=881, Unknown=0, NotChecked=0, Total=992 [2025-02-06 10:05:11,033 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:11,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 433 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:11,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-02-06 10:05:11,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 186. [2025-02-06 10:05:11,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 184 states have (on average 1.141304347826087) internal successors, (210), 185 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:05:11,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 210 transitions. [2025-02-06 10:05:11,040 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 210 transitions. Word has length 39 [2025-02-06 10:05:11,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:11,040 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 210 transitions. [2025-02-06 10:05:11,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.892857142857143) internal successors, (81), 28 states have internal predecessors, (81), 0 states have call successors, (0), 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:05:11,040 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 210 transitions. [2025-02-06 10:05:11,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 10:05:11,040 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:11,040 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:11,047 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:05:11,240 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:05:11,241 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:11,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:11,241 INFO L85 PathProgramCache]: Analyzing trace with hash -84953362, now seen corresponding path program 3 times [2025-02-06 10:05:11,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:11,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817848628] [2025-02-06 10:05:11,241 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:05:11,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:11,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-02-06 10:05:11,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:05:11,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:05:11,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:11,511 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:11,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:11,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817848628] [2025-02-06 10:05:11,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817848628] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:11,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394438283] [2025-02-06 10:05:11,511 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:05:11,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:11,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:11,513 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:05:11,514 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:05:11,559 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 40 statements into 3 equivalence classes. [2025-02-06 10:05:11,609 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:05:11,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:05:11,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:11,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 10:05:11,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:11,716 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:11,857 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 7 treesize of output 5 [2025-02-06 10:05:11,889 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:11,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394438283] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:11,890 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:11,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 23 [2025-02-06 10:05:11,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966366962] [2025-02-06 10:05:11,890 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:11,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 10:05:11,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:11,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 10:05:11,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=0, NotChecked=0, Total=552 [2025-02-06 10:05:11,893 INFO L87 Difference]: Start difference. First operand 186 states and 210 transitions. Second operand has 24 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 24 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:12,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:12,117 INFO L93 Difference]: Finished difference Result 235 states and 266 transitions. [2025-02-06 10:05:12,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 10:05:12,118 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 24 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-02-06 10:05:12,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:12,118 INFO L225 Difference]: With dead ends: 235 [2025-02-06 10:05:12,118 INFO L226 Difference]: Without dead ends: 235 [2025-02-06 10:05:12,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2025-02-06 10:05:12,119 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 130 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:12,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 343 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:05:12,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-02-06 10:05:12,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 207. [2025-02-06 10:05:12,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 205 states have (on average 1.146341463414634) internal successors, (235), 206 states have internal predecessors, (235), 0 states have call successors, (0), 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:05:12,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 235 transitions. [2025-02-06 10:05:12,128 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 235 transitions. Word has length 40 [2025-02-06 10:05:12,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:12,128 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 235 transitions. [2025-02-06 10:05:12,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.9130434782608696) internal successors, (90), 24 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:12,128 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 235 transitions. [2025-02-06 10:05:12,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-06 10:05:12,128 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:12,128 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:12,135 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-06 10:05:12,329 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:05:12,329 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:12,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:12,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1937455414, now seen corresponding path program 3 times [2025-02-06 10:05:12,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:12,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849156976] [2025-02-06 10:05:12,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:05:12,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:12,336 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 3 equivalence classes. [2025-02-06 10:05:12,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:05:12,343 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:05:12,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:12,539 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:12,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:12,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849156976] [2025-02-06 10:05:12,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849156976] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:12,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441541815] [2025-02-06 10:05:12,539 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:05:12,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:12,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:12,543 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:05:12,543 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:05:12,591 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 42 statements into 3 equivalence classes. [2025-02-06 10:05:12,614 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 42 of 42 statements. [2025-02-06 10:05:12,615 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-06 10:05:12,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:12,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 10:05:12,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:12,721 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:12,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:12,866 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 7 treesize of output 5 [2025-02-06 10:05:12,894 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:05:12,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441541815] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:12,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:12,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-02-06 10:05:12,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613205304] [2025-02-06 10:05:12,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:12,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-06 10:05:12,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:12,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-06 10:05:12,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-02-06 10:05:12,896 INFO L87 Difference]: Start difference. First operand 207 states and 235 transitions. Second operand has 20 states, 19 states have (on average 5.0) internal successors, (95), 20 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:13,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:13,041 INFO L93 Difference]: Finished difference Result 328 states and 371 transitions. [2025-02-06 10:05:13,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:05:13,041 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.0) internal successors, (95), 20 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2025-02-06 10:05:13,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:13,042 INFO L225 Difference]: With dead ends: 328 [2025-02-06 10:05:13,042 INFO L226 Difference]: Without dead ends: 328 [2025-02-06 10:05:13,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 70 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2025-02-06 10:05:13,043 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 81 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:13,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 295 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:05:13,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-02-06 10:05:13,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 269. [2025-02-06 10:05:13,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 267 states have (on average 1.146067415730337) internal successors, (306), 268 states have internal predecessors, (306), 0 states have call successors, (0), 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:05:13,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 306 transitions. [2025-02-06 10:05:13,054 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 306 transitions. Word has length 42 [2025-02-06 10:05:13,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:13,054 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 306 transitions. [2025-02-06 10:05:13,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.0) internal successors, (95), 20 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:13,054 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 306 transitions. [2025-02-06 10:05:13,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-06 10:05:13,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:13,055 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 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:05:13,061 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-06 10:05:13,255 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:05:13,256 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:13,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:13,256 INFO L85 PathProgramCache]: Analyzing trace with hash -695539832, now seen corresponding path program 4 times [2025-02-06 10:05:13,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:13,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7977377] [2025-02-06 10:05:13,256 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:05:13,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:13,264 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-02-06 10:05:13,277 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 39 of 47 statements. [2025-02-06 10:05:13,277 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:05:13,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:13,682 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:13,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:13,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7977377] [2025-02-06 10:05:13,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7977377] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:13,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360977871] [2025-02-06 10:05:13,683 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:05:13,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:13,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:13,685 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:05:13,687 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:05:13,737 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 47 statements into 2 equivalence classes. [2025-02-06 10:05:13,752 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 39 of 47 statements. [2025-02-06 10:05:13,752 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:05:13,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:13,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-02-06 10:05:13,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:13,835 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 14 treesize of output 10 [2025-02-06 10:05:14,108 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:14,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:14,178 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 44 treesize of output 38 [2025-02-06 10:05:14,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:05:14,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 34 [2025-02-06 10:05:14,311 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:14,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360977871] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:14,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:14,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 34 [2025-02-06 10:05:14,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074553097] [2025-02-06 10:05:14,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:14,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-06 10:05:14,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:14,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-06 10:05:14,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=964, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 10:05:14,313 INFO L87 Difference]: Start difference. First operand 269 states and 306 transitions. Second operand has 34 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 34 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:14,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:14,853 INFO L93 Difference]: Finished difference Result 416 states and 466 transitions. [2025-02-06 10:05:14,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-06 10:05:14,854 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 34 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2025-02-06 10:05:14,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:14,855 INFO L225 Difference]: With dead ends: 416 [2025-02-06 10:05:14,855 INFO L226 Difference]: Without dead ends: 390 [2025-02-06 10:05:14,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 802 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=372, Invalid=2280, Unknown=0, NotChecked=0, Total=2652 [2025-02-06 10:05:14,856 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 63 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:14,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 312 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:05:14,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-02-06 10:05:14,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 358. [2025-02-06 10:05:14,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 356 states have (on average 1.148876404494382) internal successors, (409), 357 states have internal predecessors, (409), 0 states have call successors, (0), 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:05:14,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 409 transitions. [2025-02-06 10:05:14,864 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 409 transitions. Word has length 47 [2025-02-06 10:05:14,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:14,864 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 409 transitions. [2025-02-06 10:05:14,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 34 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:14,864 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 409 transitions. [2025-02-06 10:05:14,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-06 10:05:14,864 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:14,865 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:14,871 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:05:15,066 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:05:15,067 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:15,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:15,067 INFO L85 PathProgramCache]: Analyzing trace with hash 301043845, now seen corresponding path program 5 times [2025-02-06 10:05:15,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:15,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117542893] [2025-02-06 10:05:15,067 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:05:15,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:15,075 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 4 equivalence classes. [2025-02-06 10:05:15,086 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 10:05:15,086 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-06 10:05:15,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:15,291 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:15,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:15,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117542893] [2025-02-06 10:05:15,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117542893] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:15,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427828998] [2025-02-06 10:05:15,292 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:05:15,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:15,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:15,294 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:05:15,295 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:05:15,346 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 4 equivalence classes. [2025-02-06 10:05:15,369 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 10:05:15,369 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-06 10:05:15,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:15,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-06 10:05:15,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:15,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 1 [2025-02-06 10:05:15,539 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:15,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:15,813 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:15,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427828998] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:15,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:15,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2025-02-06 10:05:15,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903576674] [2025-02-06 10:05:15,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:15,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-06 10:05:15,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:15,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-06 10:05:15,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1046, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 10:05:15,815 INFO L87 Difference]: Start difference. First operand 358 states and 409 transitions. Second operand has 35 states, 34 states have (on average 4.0588235294117645) internal successors, (138), 35 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:05:16,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:16,134 INFO L93 Difference]: Finished difference Result 431 states and 493 transitions. [2025-02-06 10:05:16,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 10:05:16,134 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.0588235294117645) internal successors, (138), 35 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) Word has length 50 [2025-02-06 10:05:16,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:16,135 INFO L225 Difference]: With dead ends: 431 [2025-02-06 10:05:16,135 INFO L226 Difference]: Without dead ends: 431 [2025-02-06 10:05:16,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=214, Invalid=1426, Unknown=0, NotChecked=0, Total=1640 [2025-02-06 10:05:16,136 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 92 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:16,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 640 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:05:16,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-02-06 10:05:16,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 386. [2025-02-06 10:05:16,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 384 states have (on average 1.1536458333333333) internal successors, (443), 385 states have internal predecessors, (443), 0 states have call successors, (0), 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:05:16,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 443 transitions. [2025-02-06 10:05:16,143 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 443 transitions. Word has length 50 [2025-02-06 10:05:16,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:16,143 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 443 transitions. [2025-02-06 10:05:16,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.0588235294117645) internal successors, (138), 35 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:05:16,143 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 443 transitions. [2025-02-06 10:05:16,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-06 10:05:16,147 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:16,147 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:16,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-06 10:05:16,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-02-06 10:05:16,348 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:16,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:16,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1765351850, now seen corresponding path program 4 times [2025-02-06 10:05:16,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:16,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326247081] [2025-02-06 10:05:16,348 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:05:16,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:16,353 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-02-06 10:05:16,359 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 50 of 54 statements. [2025-02-06 10:05:16,359 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:05:16,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:16,757 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:05:16,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:16,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326247081] [2025-02-06 10:05:16,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326247081] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:16,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300362567] [2025-02-06 10:05:16,757 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:05:16,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:16,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:16,760 INFO L229 MonitoredProcess]: Starting monitored process 13 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:05:16,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 10:05:16,815 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 54 statements into 2 equivalence classes. [2025-02-06 10:05:16,832 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 50 of 54 statements. [2025-02-06 10:05:16,832 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:05:16,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:16,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-02-06 10:05:16,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:16,864 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 14 treesize of output 10 [2025-02-06 10:05:18,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:05:18,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 83 treesize of output 125 [2025-02-06 10:05:19,214 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:05:19,215 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:20,145 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 44 treesize of output 38 [2025-02-06 10:05:20,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 58 [2025-02-06 10:05:20,155 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 5 treesize of output 3 [2025-02-06 10:05:20,172 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:05:20,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300362567] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:20,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:20,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 28, 21] total 56 [2025-02-06 10:05:20,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210559356] [2025-02-06 10:05:20,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:20,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-02-06 10:05:20,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:20,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-02-06 10:05:20,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=619, Invalid=2573, Unknown=0, NotChecked=0, Total=3192 [2025-02-06 10:05:20,174 INFO L87 Difference]: Start difference. First operand 386 states and 443 transitions. Second operand has 57 states, 56 states have (on average 2.3214285714285716) internal successors, (130), 57 states have internal predecessors, (130), 0 states have call successors, (0), 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:05:23,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:23,708 INFO L93 Difference]: Finished difference Result 934 states and 1070 transitions. [2025-02-06 10:05:23,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-02-06 10:05:23,708 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.3214285714285716) internal successors, (130), 57 states have internal predecessors, (130), 0 states have call successors, (0), 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 54 [2025-02-06 10:05:23,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:23,710 INFO L225 Difference]: With dead ends: 934 [2025-02-06 10:05:23,710 INFO L226 Difference]: Without dead ends: 437 [2025-02-06 10:05:23,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 59 SyntacticMatches, 6 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3493 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3040, Invalid=10070, Unknown=0, NotChecked=0, Total=13110 [2025-02-06 10:05:23,713 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 135 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:23,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 512 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 10:05:23,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2025-02-06 10:05:23,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 112. [2025-02-06 10:05:23,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.1261261261261262) internal successors, (125), 111 states have internal predecessors, (125), 0 states have call successors, (0), 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:05:23,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2025-02-06 10:05:23,720 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 54 [2025-02-06 10:05:23,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:23,721 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2025-02-06 10:05:23,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.3214285714285716) internal successors, (130), 57 states have internal predecessors, (130), 0 states have call successors, (0), 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:05:23,721 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2025-02-06 10:05:23,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-06 10:05:23,721 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:23,721 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:23,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-06 10:05:23,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:23,927 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:23,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:23,928 INFO L85 PathProgramCache]: Analyzing trace with hash 826566161, now seen corresponding path program 6 times [2025-02-06 10:05:23,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:23,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277480810] [2025-02-06 10:05:23,928 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:05:23,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:23,935 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 57 statements into 5 equivalence classes. [2025-02-06 10:05:23,960 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 10:05:23,961 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-06 10:05:23,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:24,264 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:24,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:24,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277480810] [2025-02-06 10:05:24,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277480810] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:24,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639785506] [2025-02-06 10:05:24,264 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:05:24,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:24,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:24,266 INFO L229 MonitoredProcess]: Starting monitored process 14 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:05:24,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 10:05:24,324 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 57 statements into 5 equivalence classes. [2025-02-06 10:05:24,407 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 57 of 57 statements. [2025-02-06 10:05:24,407 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-02-06 10:05:24,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:24,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-02-06 10:05:24,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:24,477 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 13 treesize of output 9 [2025-02-06 10:05:24,589 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:24,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:24,629 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:05:24,630 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 16 treesize of output 12 [2025-02-06 10:05:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 17 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:24,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639785506] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:24,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:24,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 31 [2025-02-06 10:05:24,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225607278] [2025-02-06 10:05:24,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:24,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 10:05:24,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:24,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 10:05:24,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=836, Unknown=0, NotChecked=0, Total=930 [2025-02-06 10:05:24,669 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand has 31 states, 31 states have (on average 3.2580645161290325) internal successors, (101), 31 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:25,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:25,023 INFO L93 Difference]: Finished difference Result 197 states and 217 transitions. [2025-02-06 10:05:25,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 10:05:25,024 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.2580645161290325) internal successors, (101), 31 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2025-02-06 10:05:25,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:25,024 INFO L225 Difference]: With dead ends: 197 [2025-02-06 10:05:25,024 INFO L226 Difference]: Without dead ends: 122 [2025-02-06 10:05:25,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=188, Invalid=1704, Unknown=0, NotChecked=0, Total=1892 [2025-02-06 10:05:25,025 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 118 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:25,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 562 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:05:25,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-02-06 10:05:25,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2025-02-06 10:05:25,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.1196581196581197) internal successors, (131), 117 states have internal predecessors, (131), 0 states have call successors, (0), 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:05:25,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 131 transitions. [2025-02-06 10:05:25,027 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 131 transitions. Word has length 57 [2025-02-06 10:05:25,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:25,027 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 131 transitions. [2025-02-06 10:05:25,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.2580645161290325) internal successors, (101), 31 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:25,027 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 131 transitions. [2025-02-06 10:05:25,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-02-06 10:05:25,027 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:25,027 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:25,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-06 10:05:25,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:25,228 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:25,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:25,228 INFO L85 PathProgramCache]: Analyzing trace with hash 545109710, now seen corresponding path program 7 times [2025-02-06 10:05:25,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:25,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431993586] [2025-02-06 10:05:25,228 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 10:05:25,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:25,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 10:05:25,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 10:05:25,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:25,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:25,560 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 5 proven. 67 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:25,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:25,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431993586] [2025-02-06 10:05:25,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431993586] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:25,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977580514] [2025-02-06 10:05:25,561 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 10:05:25,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:25,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:25,563 INFO L229 MonitoredProcess]: Starting monitored process 15 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:05:25,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-06 10:05:25,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-02-06 10:05:25,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-02-06 10:05:25,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:05:25,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:25,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-02-06 10:05:25,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:25,821 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:25,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:25,991 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 5 treesize of output 3 [2025-02-06 10:05:26,037 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 12 proven. 60 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:26,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977580514] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:26,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:26,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 31 [2025-02-06 10:05:26,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118916693] [2025-02-06 10:05:26,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:26,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-06 10:05:26,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:26,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-06 10:05:26,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=872, Unknown=0, NotChecked=0, Total=992 [2025-02-06 10:05:26,039 INFO L87 Difference]: Start difference. First operand 118 states and 131 transitions. Second operand has 32 states, 31 states have (on average 4.193548387096774) internal successors, (130), 32 states have internal predecessors, (130), 0 states have call successors, (0), 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:05:26,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:26,310 INFO L93 Difference]: Finished difference Result 152 states and 169 transitions. [2025-02-06 10:05:26,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 10:05:26,311 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 4.193548387096774) internal successors, (130), 32 states have internal predecessors, (130), 0 states have call successors, (0), 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 60 [2025-02-06 10:05:26,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:26,311 INFO L225 Difference]: With dead ends: 152 [2025-02-06 10:05:26,311 INFO L226 Difference]: Without dead ends: 152 [2025-02-06 10:05:26,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=1291, Unknown=0, NotChecked=0, Total=1482 [2025-02-06 10:05:26,312 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 238 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:26,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 462 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:05:26,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-02-06 10:05:26,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 132. [2025-02-06 10:05:26,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.1221374045801527) internal successors, (147), 131 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:05:26,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 147 transitions. [2025-02-06 10:05:26,314 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 147 transitions. Word has length 60 [2025-02-06 10:05:26,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:26,314 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 147 transitions. [2025-02-06 10:05:26,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 4.193548387096774) internal successors, (130), 32 states have internal predecessors, (130), 0 states have call successors, (0), 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:05:26,314 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 147 transitions. [2025-02-06 10:05:26,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-06 10:05:26,314 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:26,315 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:26,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-02-06 10:05:26,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-02-06 10:05:26,519 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:26,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:26,520 INFO L85 PathProgramCache]: Analyzing trace with hash -115913816, now seen corresponding path program 8 times [2025-02-06 10:05:26,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:26,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229151783] [2025-02-06 10:05:26,520 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:05:26,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:26,526 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-02-06 10:05:26,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 10:05:26,534 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:05:26,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:26,860 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 22 proven. 80 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:26,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:26,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229151783] [2025-02-06 10:05:26,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229151783] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:26,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087151950] [2025-02-06 10:05:26,860 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:05:26,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:26,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:26,862 INFO L229 MonitoredProcess]: Starting monitored process 16 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:05:26,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-06 10:05:26,938 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 67 statements into 2 equivalence classes. [2025-02-06 10:05:26,969 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 10:05:26,969 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:05:26,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:26,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-02-06 10:05:26,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:27,047 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 13 treesize of output 9 [2025-02-06 10:05:27,110 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 22 proven. 80 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:27,110 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:27,142 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:05:27,143 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 16 treesize of output 12 [2025-02-06 10:05:27,183 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 22 proven. 80 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:27,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087151950] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:27,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:27,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 31 [2025-02-06 10:05:27,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956467474] [2025-02-06 10:05:27,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:27,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-02-06 10:05:27,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:27,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-02-06 10:05:27,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=839, Unknown=0, NotChecked=0, Total=930 [2025-02-06 10:05:27,184 INFO L87 Difference]: Start difference. First operand 132 states and 147 transitions. Second operand has 31 states, 31 states have (on average 3.3548387096774195) internal successors, (104), 31 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:27,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:27,680 INFO L93 Difference]: Finished difference Result 233 states and 257 transitions. [2025-02-06 10:05:27,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-06 10:05:27,681 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.3548387096774195) internal successors, (104), 31 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2025-02-06 10:05:27,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:27,681 INFO L225 Difference]: With dead ends: 233 [2025-02-06 10:05:27,681 INFO L226 Difference]: Without dead ends: 142 [2025-02-06 10:05:27,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=1962, Unknown=0, NotChecked=0, Total=2162 [2025-02-06 10:05:27,682 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 87 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:27,682 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 707 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:05:27,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-02-06 10:05:27,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2025-02-06 10:05:27,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.1167883211678833) internal successors, (153), 137 states have internal predecessors, (153), 0 states have call successors, (0), 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:05:27,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 153 transitions. [2025-02-06 10:05:27,684 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 153 transitions. Word has length 67 [2025-02-06 10:05:27,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:27,684 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 153 transitions. [2025-02-06 10:05:27,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.3548387096774195) internal successors, (104), 31 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:05:27,684 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 153 transitions. [2025-02-06 10:05:27,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-02-06 10:05:27,685 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:27,685 INFO L218 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:27,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-02-06 10:05:27,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-02-06 10:05:27,886 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:27,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:27,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1506055205, now seen corresponding path program 9 times [2025-02-06 10:05:27,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:27,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476680843] [2025-02-06 10:05:27,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:05:27,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:27,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 70 statements into 6 equivalence classes. [2025-02-06 10:05:27,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 10:05:27,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 10:05:27,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:28,238 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 12 proven. 103 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:28,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:28,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476680843] [2025-02-06 10:05:28,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476680843] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:28,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773257053] [2025-02-06 10:05:28,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 10:05:28,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:28,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:28,241 INFO L229 MonitoredProcess]: Starting monitored process 17 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:05:28,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-06 10:05:28,305 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 70 statements into 6 equivalence classes. [2025-02-06 10:05:28,367 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 10:05:28,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-02-06 10:05:28,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:28,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-02-06 10:05:28,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:28,489 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 22 proven. 93 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:28,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:28,691 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 7 treesize of output 5 [2025-02-06 10:05:28,742 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 22 proven. 93 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:28,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773257053] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:28,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:28,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 35 [2025-02-06 10:05:28,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333642402] [2025-02-06 10:05:28,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:28,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-06 10:05:28,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:28,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-06 10:05:28,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 10:05:28,744 INFO L87 Difference]: Start difference. First operand 138 states and 153 transitions. Second operand has 36 states, 35 states have (on average 4.285714285714286) internal successors, (150), 36 states have internal predecessors, (150), 0 states have call successors, (0), 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:05:29,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:29,006 INFO L93 Difference]: Finished difference Result 174 states and 193 transitions. [2025-02-06 10:05:29,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-02-06 10:05:29,007 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 4.285714285714286) internal successors, (150), 36 states have internal predecessors, (150), 0 states have call successors, (0), 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 70 [2025-02-06 10:05:29,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:29,007 INFO L225 Difference]: With dead ends: 174 [2025-02-06 10:05:29,007 INFO L226 Difference]: Without dead ends: 174 [2025-02-06 10:05:29,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 115 SyntacticMatches, 6 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=287, Invalid=1605, Unknown=0, NotChecked=0, Total=1892 [2025-02-06 10:05:29,008 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 263 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:29,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 339 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 10:05:29,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-02-06 10:05:29,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 152. [2025-02-06 10:05:29,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.119205298013245) internal successors, (169), 151 states have internal predecessors, (169), 0 states have call successors, (0), 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:05:29,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 169 transitions. [2025-02-06 10:05:29,010 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 169 transitions. Word has length 70 [2025-02-06 10:05:29,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:29,010 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 169 transitions. [2025-02-06 10:05:29,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 4.285714285714286) internal successors, (150), 36 states have internal predecessors, (150), 0 states have call successors, (0), 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:05:29,010 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 169 transitions. [2025-02-06 10:05:29,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-02-06 10:05:29,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:29,011 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:29,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-02-06 10:05:29,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:29,215 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:29,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:29,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1772876175, now seen corresponding path program 10 times [2025-02-06 10:05:29,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:29,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409364276] [2025-02-06 10:05:29,215 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:05:29,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:29,222 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 77 statements into 2 equivalence classes. [2025-02-06 10:05:29,229 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 63 of 77 statements. [2025-02-06 10:05:29,229 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:05:29,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:30,297 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 117 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:30,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:30,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409364276] [2025-02-06 10:05:30,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409364276] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:30,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003054165] [2025-02-06 10:05:30,297 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-06 10:05:30,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:30,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:30,299 INFO L229 MonitoredProcess]: Starting monitored process 18 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:05:30,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-06 10:05:30,362 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 77 statements into 2 equivalence classes. [2025-02-06 10:05:30,385 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 63 of 77 statements. [2025-02-06 10:05:30,385 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-06 10:05:30,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:30,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 86 conjuncts are in the unsatisfiable core [2025-02-06 10:05:30,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:30,585 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 14 treesize of output 10 [2025-02-06 10:05:31,712 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 107 proven. 45 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:31,712 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:31,888 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 89 treesize of output 77 [2025-02-06 10:05:31,891 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:05:31,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 89 treesize of output 67 [2025-02-06 10:05:32,293 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 117 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:32,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003054165] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:32,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:32,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 67 [2025-02-06 10:05:32,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995135303] [2025-02-06 10:05:32,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:32,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2025-02-06 10:05:32,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:32,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2025-02-06 10:05:32,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=3861, Unknown=0, NotChecked=0, Total=4422 [2025-02-06 10:05:32,295 INFO L87 Difference]: Start difference. First operand 152 states and 169 transitions. Second operand has 67 states, 67 states have (on average 2.1940298507462686) internal successors, (147), 67 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:05:33,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:33,524 INFO L93 Difference]: Finished difference Result 274 states and 302 transitions. [2025-02-06 10:05:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-02-06 10:05:33,524 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.1940298507462686) internal successors, (147), 67 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) Word has length 77 [2025-02-06 10:05:33,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:33,525 INFO L225 Difference]: With dead ends: 274 [2025-02-06 10:05:33,525 INFO L226 Difference]: Without dead ends: 162 [2025-02-06 10:05:33,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 120 SyntacticMatches, 3 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3626 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1299, Invalid=9003, Unknown=0, NotChecked=0, Total=10302 [2025-02-06 10:05:33,527 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 62 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 994 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:33,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 378 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 994 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 10:05:33,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-06 10:05:33,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 158. [2025-02-06 10:05:33,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.1146496815286624) internal successors, (175), 157 states have internal predecessors, (175), 0 states have call successors, (0), 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:05:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 175 transitions. [2025-02-06 10:05:33,529 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 175 transitions. Word has length 77 [2025-02-06 10:05:33,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:33,529 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 175 transitions. [2025-02-06 10:05:33,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.1940298507462686) internal successors, (147), 67 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:05:33,529 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 175 transitions. [2025-02-06 10:05:33,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-02-06 10:05:33,530 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:33,530 INFO L218 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:33,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-06 10:05:33,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:33,730 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:33,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:33,731 INFO L85 PathProgramCache]: Analyzing trace with hash -927818066, now seen corresponding path program 11 times [2025-02-06 10:05:33,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:33,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493146051] [2025-02-06 10:05:33,731 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:05:33,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:33,738 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 80 statements into 7 equivalence classes. [2025-02-06 10:05:33,745 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 10:05:33,746 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-02-06 10:05:33,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:34,066 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 35 proven. 133 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:34,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:34,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493146051] [2025-02-06 10:05:34,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493146051] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:34,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486421840] [2025-02-06 10:05:34,067 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-06 10:05:34,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:34,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:34,068 INFO L229 MonitoredProcess]: Starting monitored process 19 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:05:34,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-06 10:05:34,139 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 80 statements into 7 equivalence classes. [2025-02-06 10:05:34,175 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 10:05:34,175 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-02-06 10:05:34,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:34,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-02-06 10:05:34,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:34,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 1 [2025-02-06 10:05:34,427 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 35 proven. 133 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:34,427 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:34,906 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 35 proven. 133 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:34,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486421840] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:34,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:34,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 45 [2025-02-06 10:05:34,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613741129] [2025-02-06 10:05:34,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:34,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-02-06 10:05:34,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:34,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-02-06 10:05:34,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1824, Unknown=0, NotChecked=0, Total=2070 [2025-02-06 10:05:34,908 INFO L87 Difference]: Start difference. First operand 158 states and 175 transitions. Second operand has 46 states, 45 states have (on average 4.288888888888889) internal successors, (193), 46 states have internal predecessors, (193), 0 states have call successors, (0), 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:05:35,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:05:35,368 INFO L93 Difference]: Finished difference Result 196 states and 217 transitions. [2025-02-06 10:05:35,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 10:05:35,369 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 4.288888888888889) internal successors, (193), 46 states have internal predecessors, (193), 0 states have call successors, (0), 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 80 [2025-02-06 10:05:35,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:05:35,372 INFO L225 Difference]: With dead ends: 196 [2025-02-06 10:05:35,372 INFO L226 Difference]: Without dead ends: 196 [2025-02-06 10:05:35,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=355, Invalid=2615, Unknown=0, NotChecked=0, Total=2970 [2025-02-06 10:05:35,373 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 129 mSDsluCounter, 1063 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:05:35,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1118 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:05:35,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-02-06 10:05:35,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 172. [2025-02-06 10:05:35,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.1169590643274854) internal successors, (191), 171 states have internal predecessors, (191), 0 states have call successors, (0), 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:05:35,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 191 transitions. [2025-02-06 10:05:35,375 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 191 transitions. Word has length 80 [2025-02-06 10:05:35,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:05:35,375 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 191 transitions. [2025-02-06 10:05:35,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 4.288888888888889) internal successors, (193), 46 states have internal predecessors, (193), 0 states have call successors, (0), 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:05:35,375 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 191 transitions. [2025-02-06 10:05:35,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-06 10:05:35,377 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:05:35,377 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:05:35,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-02-06 10:05:35,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-02-06 10:05:35,578 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:05:35,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:05:35,578 INFO L85 PathProgramCache]: Analyzing trace with hash -2098739256, now seen corresponding path program 12 times [2025-02-06 10:05:35,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:05:35,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906467453] [2025-02-06 10:05:35,579 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:05:35,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:05:35,590 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 87 statements into 8 equivalence classes. [2025-02-06 10:05:35,626 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 10:05:35,626 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-02-06 10:05:35,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:36,108 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 32 proven. 180 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:36,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:05:36,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906467453] [2025-02-06 10:05:36,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906467453] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:05:36,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1849984758] [2025-02-06 10:05:36,108 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-06 10:05:36,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:05:36,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:05:36,110 INFO L229 MonitoredProcess]: Starting monitored process 20 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:05:36,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-06 10:05:36,197 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 87 statements into 8 equivalence classes. [2025-02-06 10:05:36,268 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 87 of 87 statements. [2025-02-06 10:05:36,268 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-02-06 10:05:36,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:05:36,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-02-06 10:05:36,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:05:36,377 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 14 treesize of output 10 [2025-02-06 10:05:37,428 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:05:37,428 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 18 treesize of output 19 [2025-02-06 10:05:37,596 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 35 proven. 177 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:37,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:05:38,420 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 13 treesize of output 11 [2025-02-06 10:05:38,426 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 22 treesize of output 20 [2025-02-06 10:05:38,430 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 7 treesize of output 5 [2025-02-06 10:05:38,514 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 35 proven. 177 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:05:38,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1849984758] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:05:38,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:05:38,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 56 [2025-02-06 10:05:38,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039415312] [2025-02-06 10:05:38,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:05:38,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-02-06 10:05:38,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:05:38,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-02-06 10:05:38,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=2831, Unknown=0, NotChecked=0, Total=3080 [2025-02-06 10:05:38,515 INFO L87 Difference]: Start difference. First operand 172 states and 191 transitions. Second operand has 56 states, 56 states have (on average 4.071428571428571) internal successors, (228), 56 states have internal predecessors, (228), 0 states have call successors, (0), 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:06:26,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:26,811 INFO L93 Difference]: Finished difference Result 346 states and 382 transitions. [2025-02-06 10:06:26,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-02-06 10:06:26,811 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 4.071428571428571) internal successors, (228), 56 states have internal predecessors, (228), 0 states have call successors, (0), 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 87 [2025-02-06 10:06:26,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:26,812 INFO L225 Difference]: With dead ends: 346 [2025-02-06 10:06:26,812 INFO L226 Difference]: Without dead ends: 223 [2025-02-06 10:06:26,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 134 SyntacticMatches, 7 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2887 ImplicationChecksByTransitivity, 48.9s TimeCoverageRelationStatistics Valid=1286, Invalid=8611, Unknown=3, NotChecked=0, Total=9900 [2025-02-06 10:06:26,813 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 922 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 922 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 1637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:26,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [922 Valid, 917 Invalid, 1637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 10:06:26,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-02-06 10:06:26,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 192. [2025-02-06 10:06:26,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 191 states have (on average 1.1151832460732984) internal successors, (213), 191 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:06:26,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 213 transitions. [2025-02-06 10:06:26,815 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 213 transitions. Word has length 87 [2025-02-06 10:06:26,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:26,815 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 213 transitions. [2025-02-06 10:06:26,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 4.071428571428571) internal successors, (228), 56 states have internal predecessors, (228), 0 states have call successors, (0), 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:06:26,815 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 213 transitions. [2025-02-06 10:06:26,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-06 10:06:26,816 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:26,816 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:26,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-02-06 10:06:27,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:27,016 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:06:27,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:27,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1802985169, now seen corresponding path program 13 times [2025-02-06 10:06:27,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:27,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025054261] [2025-02-06 10:06:27,017 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 10:06:27,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:27,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 10:06:27,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 10:06:27,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:27,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 37 proven. 245 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:06:27,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:27,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025054261] [2025-02-06 10:06:27,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025054261] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:27,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818964006] [2025-02-06 10:06:27,586 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-06 10:06:27,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:27,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:27,588 INFO L229 MonitoredProcess]: Starting monitored process 21 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:06:27,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-06 10:06:27,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-06 10:06:27,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-06 10:06:27,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:06:27,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:27,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 93 conjuncts are in the unsatisfiable core [2025-02-06 10:06:27,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:27,865 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 13 treesize of output 9 [2025-02-06 10:06:27,975 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 37 proven. 245 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:06:27,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:28,030 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:06:28,032 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 16 treesize of output 12 [2025-02-06 10:06:28,093 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 37 proven. 245 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:06:28,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818964006] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:28,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:28,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 40 [2025-02-06 10:06:28,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588634718] [2025-02-06 10:06:28,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:28,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-06 10:06:28,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:28,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-06 10:06:28,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2025-02-06 10:06:28,095 INFO L87 Difference]: Start difference. First operand 192 states and 213 transitions. Second operand has 40 states, 40 states have (on average 3.575) internal successors, (143), 40 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:06:29,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:29,069 INFO L93 Difference]: Finished difference Result 341 states and 377 transitions. [2025-02-06 10:06:29,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-02-06 10:06:29,069 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 3.575) internal successors, (143), 40 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) Word has length 97 [2025-02-06 10:06:29,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:29,070 INFO L225 Difference]: With dead ends: 341 [2025-02-06 10:06:29,070 INFO L226 Difference]: Without dead ends: 202 [2025-02-06 10:06:29,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=281, Invalid=3879, Unknown=0, NotChecked=0, Total=4160 [2025-02-06 10:06:29,070 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 133 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 1992 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1429 SdHoareTripleChecker+Invalid, 2001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:29,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1429 Invalid, 2001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1992 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 10:06:29,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-02-06 10:06:29,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 198. [2025-02-06 10:06:29,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 1.1116751269035532) internal successors, (219), 197 states have internal predecessors, (219), 0 states have call successors, (0), 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:06:29,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 219 transitions. [2025-02-06 10:06:29,073 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 219 transitions. Word has length 97 [2025-02-06 10:06:29,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:29,073 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 219 transitions. [2025-02-06 10:06:29,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 3.575) internal successors, (143), 40 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:06:29,073 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 219 transitions. [2025-02-06 10:06:29,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-02-06 10:06:29,074 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:29,074 INFO L218 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:06:29,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-02-06 10:06:29,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-02-06 10:06:29,274 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2025-02-06 10:06:29,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:06:29,275 INFO L85 PathProgramCache]: Analyzing trace with hash -849318258, now seen corresponding path program 14 times [2025-02-06 10:06:29,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:06:29,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718062764] [2025-02-06 10:06:29,275 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:06:29,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:06:29,283 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-02-06 10:06:29,292 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 10:06:29,292 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:06:29,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:29,807 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 51 proven. 253 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:06:29,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:06:29,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718062764] [2025-02-06 10:06:29,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718062764] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:06:29,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857335904] [2025-02-06 10:06:29,807 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:06:29,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:06:29,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:06:29,809 INFO L229 MonitoredProcess]: Starting monitored process 22 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:06:29,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-02-06 10:06:29,908 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-02-06 10:06:29,946 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-02-06 10:06:29,946 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:06:29,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:06:29,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 92 conjuncts are in the unsatisfiable core [2025-02-06 10:06:29,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:06:29,956 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:06:30,452 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 70 proven. 234 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:06:30,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:06:31,255 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 70 proven. 234 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:06:31,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857335904] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:06:31,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:06:31,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 55 [2025-02-06 10:06:31,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655900916] [2025-02-06 10:06:31,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:06:31,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-02-06 10:06:31,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:06:31,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-02-06 10:06:31,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=2735, Unknown=0, NotChecked=0, Total=3080 [2025-02-06 10:06:31,257 INFO L87 Difference]: Start difference. First operand 198 states and 219 transitions. Second operand has 56 states, 55 states have (on average 4.290909090909091) internal successors, (236), 56 states have internal predecessors, (236), 0 states have call successors, (0), 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:06:32,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:06:32,097 INFO L93 Difference]: Finished difference Result 240 states and 265 transitions. [2025-02-06 10:06:32,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-06 10:06:32,098 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 4.290909090909091) internal successors, (236), 56 states have internal predecessors, (236), 0 states have call successors, (0), 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 100 [2025-02-06 10:06:32,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:06:32,098 INFO L225 Difference]: With dead ends: 240 [2025-02-06 10:06:32,098 INFO L226 Difference]: Without dead ends: 240 [2025-02-06 10:06:32,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=497, Invalid=4059, Unknown=0, NotChecked=0, Total=4556 [2025-02-06 10:06:32,099 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 204 mSDsluCounter, 1666 mSDsCounter, 0 mSdLazyCounter, 1847 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 10:06:32,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1733 Invalid, 1848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1847 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 10:06:32,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-02-06 10:06:32,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 212. [2025-02-06 10:06:32,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 211 states have (on average 1.113744075829384) internal successors, (235), 211 states have internal predecessors, (235), 0 states have call successors, (0), 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:06:32,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 235 transitions. [2025-02-06 10:06:32,102 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 235 transitions. Word has length 100 [2025-02-06 10:06:32,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:06:32,102 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 235 transitions. [2025-02-06 10:06:32,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 4.290909090909091) internal successors, (236), 56 states have internal predecessors, (236), 0 states have call successors, (0), 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:06:32,102 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 235 transitions. [2025-02-06 10:06:32,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-06 10:06:32,104 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:06:32,104 INFO L218 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]