./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label35.c --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for ERROR reachability
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/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label35.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7d54fa4bc915c3e337e3a3fd5a20fd6a2b066ccd7f01acca135e0e9b0e83a6b2
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 10:47:11,411 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 10:47:11,468 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-05 10:47:11,471 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 10:47:11,472 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 10:47:11,485 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 10:47:11,486 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 10:47:11,486 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 10:47:11,486 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 10:47:11,486 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 10:47:11,486 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 10:47:11,487 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 10:47:11,487 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 10:47:11,487 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 10:47:11,487 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 10:47:11,487 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 10:47:11,487 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 10:47:11,487 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 10:47:11,487 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 10:47:11,487 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 10:47:11,488 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 10:47:11,488 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 10:47:11,488 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 10:47:11,488 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 10:47:11,488 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 10:47:11,488 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 10:47:11,488 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 10:47:11,488 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 10:47:11,488 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 10:47:11,488 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 10:47:11,489 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 10:47:11,489 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 10:47:11,489 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 10:47:11,489 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 10:47:11,489 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 10:47:11,489 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 10:47:11,489 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 10:47:11,489 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 10:47:11,489 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 10:47:11,489 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 10:47:11,489 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 10:47:11,489 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 10:47:11,489 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 10:47:11,489 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 ! call(reach_error())) )


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 -> 7d54fa4bc915c3e337e3a3fd5a20fd6a2b066ccd7f01acca135e0e9b0e83a6b2
[2025-02-05 10:47:11,692 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 10:47:11,697 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 10:47:11,699 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 10:47:11,700 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 10:47:11,700 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 10:47:11,700 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label35.c
[2025-02-05 10:47:12,794 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/021f56c94/d271f92667bb4e0aa7a39983e5c13ff1/FLAGc97c3de3a
[2025-02-05 10:47:13,233 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 10:47:13,234 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label35.c
[2025-02-05 10:47:13,249 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/021f56c94/d271f92667bb4e0aa7a39983e5c13ff1/FLAGc97c3de3a
[2025-02-05 10:47:13,359 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/021f56c94/d271f92667bb4e0aa7a39983e5c13ff1
[2025-02-05 10:47:13,361 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 10:47:13,362 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 10:47:13,363 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 10:47:13,363 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 10:47:13,365 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 10:47:13,367 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:47:13" (1/1) ...
[2025-02-05 10:47:13,369 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e9afa3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:13, skipping insertion in model container
[2025-02-05 10:47:13,369 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:47:13" (1/1) ...
[2025-02-05 10:47:13,419 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 10:47:13,722 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label35.c[53787,53800]
[2025-02-05 10:47:13,754 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 10:47:13,763 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 10:47:13,870 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label35.c[53787,53800]
[2025-02-05 10:47:13,891 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 10:47:13,904 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 10:47:13,905 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:13 WrapperNode
[2025-02-05 10:47:13,905 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 10:47:13,906 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 10:47:13,907 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 10:47:13,907 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 10:47:13,910 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:13" (1/1) ...
[2025-02-05 10:47:13,937 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:13" (1/1) ...
[2025-02-05 10:47:14,024 INFO  L138                Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769
[2025-02-05 10:47:14,024 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 10:47:14,025 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 10:47:14,025 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 10:47:14,025 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 10:47:14,032 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:13" (1/1) ...
[2025-02-05 10:47:14,032 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:13" (1/1) ...
[2025-02-05 10:47:14,046 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:13" (1/1) ...
[2025-02-05 10:47:14,085 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-05 10:47:14,085 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:13" (1/1) ...
[2025-02-05 10:47:14,085 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:13" (1/1) ...
[2025-02-05 10:47:14,121 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:13" (1/1) ...
[2025-02-05 10:47:14,125 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:13" (1/1) ...
[2025-02-05 10:47:14,128 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:13" (1/1) ...
[2025-02-05 10:47:14,133 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:13" (1/1) ...
[2025-02-05 10:47:14,143 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 10:47:14,145 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 10:47:14,145 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 10:47:14,145 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 10:47:14,146 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:13" (1/1) ...
[2025-02-05 10:47:14,150 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 10:47:14,158 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 10:47:14,173 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-05 10:47:14,176 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-05 10:47:14,192 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 10:47:14,192 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 10:47:14,192 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 10:47:14,192 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 10:47:14,249 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 10:47:14,254 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 10:47:15,602 INFO  L?                        ?]: Removed 147 outVars from TransFormulas that were not future-live.
[2025-02-05 10:47:15,602 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 10:47:15,619 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 10:47:15,620 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 10:47:15,620 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:47:15 BoogieIcfgContainer
[2025-02-05 10:47:15,620 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 10:47:15,622 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 10:47:15,622 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 10:47:15,626 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 10:47:15,626 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:47:13" (1/3) ...
[2025-02-05 10:47:15,626 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60363a0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:47:15, skipping insertion in model container
[2025-02-05 10:47:15,626 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:47:13" (2/3) ...
[2025-02-05 10:47:15,627 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60363a0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:47:15, skipping insertion in model container
[2025-02-05 10:47:15,627 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:47:15" (3/3) ...
[2025-02-05 10:47:15,628 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem03_label35.c
[2025-02-05 10:47:15,639 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 10:47:15,641 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label35.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 10:47:15,694 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 10:47:15,701 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=LoopHeads, 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;@4ab382fb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 10:47:15,702 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 10:47:15,705 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:15,712 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 146
[2025-02-05 10:47:15,712 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:47:15,713 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:47:15,713 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:47:15,716 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:47:15,717 INFO  L85        PathProgramCache]: Analyzing trace with hash 512083111, now seen corresponding path program 1 times
[2025-02-05 10:47:15,721 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:47:15,722 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526042250]
[2025-02-05 10:47:15,722 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:15,722 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:47:15,814 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes.
[2025-02-05 10:47:15,908 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements.
[2025-02-05 10:47:15,909 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:15,909 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:16,361 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-05 10:47:16,361 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:47:16,362 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526042250]
[2025-02-05 10:47:16,363 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526042250] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:47:16,363 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:47:16,364 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 10:47:16,365 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835270651]
[2025-02-05 10:47:16,365 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:47:16,396 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:47:16,397 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:47:16,411 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:47:16,411 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:47:16,414 INFO  L87              Difference]: Start difference. First operand  has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 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 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:17,140 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:47:17,141 INFO  L93              Difference]: Finished difference Result 864 states and 1511 transitions.
[2025-02-05 10:47:17,142 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:47:17,143 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145
[2025-02-05 10:47:17,143 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:47:17,151 INFO  L225             Difference]: With dead ends: 864
[2025-02-05 10:47:17,151 INFO  L226             Difference]: Without dead ends: 468
[2025-02-05 10:47:17,155 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-05 10:47:17,158 INFO  L435           NwaCegarLoop]: 129 mSDtfsCounter, 133 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 10:47:17,160 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 166 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 715 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 10:47:17,171 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 468 states.
[2025-02-05 10:47:17,194 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 454.
[2025-02-05 10:47:17,196 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 454 states, 453 states have (on average 1.6269315673289184) internal successors, (737), 453 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:17,199 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 737 transitions.
[2025-02-05 10:47:17,200 INFO  L78                 Accepts]: Start accepts. Automaton has 454 states and 737 transitions. Word has length 145
[2025-02-05 10:47:17,200 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:47:17,200 INFO  L471      AbstractCegarLoop]: Abstraction has 454 states and 737 transitions.
[2025-02-05 10:47:17,201 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:17,201 INFO  L276                IsEmpty]: Start isEmpty. Operand 454 states and 737 transitions.
[2025-02-05 10:47:17,204 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2025-02-05 10:47:17,204 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:47:17,204 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:47:17,204 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 10:47:17,204 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:47:17,205 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:47:17,205 INFO  L85        PathProgramCache]: Analyzing trace with hash -1755544067, now seen corresponding path program 1 times
[2025-02-05 10:47:17,205 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:47:17,205 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126873210]
[2025-02-05 10:47:17,205 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:17,205 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:47:17,236 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes.
[2025-02-05 10:47:17,244 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements.
[2025-02-05 10:47:17,244 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:17,244 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:17,428 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 10:47:17,428 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:47:17,428 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126873210]
[2025-02-05 10:47:17,428 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126873210] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:47:17,428 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:47:17,428 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 10:47:17,429 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256824942]
[2025-02-05 10:47:17,429 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:47:17,429 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:47:17,430 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:47:17,430 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:47:17,430 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:47:17,430 INFO  L87              Difference]: Start difference. First operand 454 states and 737 transitions. Second operand  has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 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-05 10:47:17,682 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:47:17,682 INFO  L93              Difference]: Finished difference Result 1358 states and 2207 transitions.
[2025-02-05 10:47:17,686 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:47:17,687 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 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 150
[2025-02-05 10:47:17,687 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:47:17,691 INFO  L225             Difference]: With dead ends: 1358
[2025-02-05 10:47:17,691 INFO  L226             Difference]: Without dead ends: 906
[2025-02-05 10:47:17,693 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-05 10:47:17,694 INFO  L435           NwaCegarLoop]: 308 mSDtfsCounter, 366 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-05 10:47:17,695 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 596 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-05 10:47:17,696 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 906 states.
[2025-02-05 10:47:17,729 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 904.
[2025-02-05 10:47:17,730 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 904 states, 903 states have (on average 1.6223698781838316) internal successors, (1465), 903 states have internal predecessors, (1465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:17,732 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1465 transitions.
[2025-02-05 10:47:17,732 INFO  L78                 Accepts]: Start accepts. Automaton has 904 states and 1465 transitions. Word has length 150
[2025-02-05 10:47:17,732 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:47:17,732 INFO  L471      AbstractCegarLoop]: Abstraction has 904 states and 1465 transitions.
[2025-02-05 10:47:17,733 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 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-05 10:47:17,733 INFO  L276                IsEmpty]: Start isEmpty. Operand 904 states and 1465 transitions.
[2025-02-05 10:47:17,735 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2025-02-05 10:47:17,735 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:47:17,735 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:47:17,735 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 10:47:17,735 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:47:17,736 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:47:17,736 INFO  L85        PathProgramCache]: Analyzing trace with hash 2032052366, now seen corresponding path program 1 times
[2025-02-05 10:47:17,736 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:47:17,736 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447846569]
[2025-02-05 10:47:17,736 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:17,736 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:47:17,769 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes.
[2025-02-05 10:47:17,773 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements.
[2025-02-05 10:47:17,773 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:17,773 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:17,903 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 10:47:17,903 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:47:17,903 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447846569]
[2025-02-05 10:47:17,903 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447846569] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:47:17,903 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:47:17,903 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 10:47:17,904 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730377469]
[2025-02-05 10:47:17,904 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:47:17,904 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:47:17,904 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:47:17,904 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:47:17,904 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:47:17,905 INFO  L87              Difference]: Start difference. First operand 904 states and 1465 transitions. Second operand  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:18,599 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:47:18,600 INFO  L93              Difference]: Finished difference Result 2620 states and 4270 transitions.
[2025-02-05 10:47:18,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:47:18,600 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 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 151
[2025-02-05 10:47:18,601 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:47:18,605 INFO  L225             Difference]: With dead ends: 2620
[2025-02-05 10:47:18,606 INFO  L226             Difference]: Without dead ends: 1718
[2025-02-05 10:47:18,606 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-05 10:47:18,607 INFO  L435           NwaCegarLoop]: 165 mSDtfsCounter, 217 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 10:47:18,607 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 198 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 10:47:18,609 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1718 states.
[2025-02-05 10:47:18,628 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1718.
[2025-02-05 10:47:18,630 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1718 states, 1717 states have (on average 1.4041933605125219) internal successors, (2411), 1717 states have internal predecessors, (2411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:18,635 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2411 transitions.
[2025-02-05 10:47:18,635 INFO  L78                 Accepts]: Start accepts. Automaton has 1718 states and 2411 transitions. Word has length 151
[2025-02-05 10:47:18,635 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:47:18,635 INFO  L471      AbstractCegarLoop]: Abstraction has 1718 states and 2411 transitions.
[2025-02-05 10:47:18,635 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 2 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:18,635 INFO  L276                IsEmpty]: Start isEmpty. Operand 1718 states and 2411 transitions.
[2025-02-05 10:47:18,638 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 154
[2025-02-05 10:47:18,638 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:47:18,638 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:47:18,638 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 10:47:18,638 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:47:18,639 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:47:18,639 INFO  L85        PathProgramCache]: Analyzing trace with hash 1565460497, now seen corresponding path program 1 times
[2025-02-05 10:47:18,639 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:47:18,639 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318649041]
[2025-02-05 10:47:18,639 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:18,639 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:47:18,667 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes.
[2025-02-05 10:47:18,672 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements.
[2025-02-05 10:47:18,673 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:18,673 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:18,753 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 10:47:18,754 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:47:18,754 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318649041]
[2025-02-05 10:47:18,754 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318649041] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:47:18,754 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:47:18,754 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 10:47:18,754 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805426749]
[2025-02-05 10:47:18,754 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:47:18,754 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:47:18,754 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:47:18,755 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:47:18,755 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:47:18,755 INFO  L87              Difference]: Start difference. First operand 1718 states and 2411 transitions. Second operand  has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 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-05 10:47:19,394 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:47:19,394 INFO  L93              Difference]: Finished difference Result 5089 states and 7163 transitions.
[2025-02-05 10:47:19,394 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:47:19,395 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 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) Word has length 153
[2025-02-05 10:47:19,395 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:47:19,404 INFO  L225             Difference]: With dead ends: 5089
[2025-02-05 10:47:19,405 INFO  L226             Difference]: Without dead ends: 3373
[2025-02-05 10:47:19,407 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-05 10:47:19,408 INFO  L435           NwaCegarLoop]: 77 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 10:47:19,408 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 91 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 10:47:19,410 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3373 states.
[2025-02-05 10:47:19,504 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 3345.
[2025-02-05 10:47:19,512 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3345 states, 3344 states have (on average 1.3785885167464116) internal successors, (4610), 3344 states have internal predecessors, (4610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:19,532 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3345 states to 3345 states and 4610 transitions.
[2025-02-05 10:47:19,533 INFO  L78                 Accepts]: Start accepts. Automaton has 3345 states and 4610 transitions. Word has length 153
[2025-02-05 10:47:19,533 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:47:19,533 INFO  L471      AbstractCegarLoop]: Abstraction has 3345 states and 4610 transitions.
[2025-02-05 10:47:19,533 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 51.0) internal successors, (153), 2 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-05 10:47:19,533 INFO  L276                IsEmpty]: Start isEmpty. Operand 3345 states and 4610 transitions.
[2025-02-05 10:47:19,540 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 158
[2025-02-05 10:47:19,543 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:47:19,544 INFO  L218           NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:47:19,544 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 10:47:19,544 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:47:19,545 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:47:19,545 INFO  L85        PathProgramCache]: Analyzing trace with hash -1038437157, now seen corresponding path program 1 times
[2025-02-05 10:47:19,545 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:47:19,545 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691078624]
[2025-02-05 10:47:19,545 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:19,545 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:47:19,573 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes.
[2025-02-05 10:47:19,578 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements.
[2025-02-05 10:47:19,578 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:19,578 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:19,770 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 10:47:19,771 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:47:19,771 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691078624]
[2025-02-05 10:47:19,771 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691078624] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:47:19,771 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:47:19,771 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 10:47:19,771 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741484734]
[2025-02-05 10:47:19,771 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:47:19,772 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:47:19,772 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:47:19,772 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:47:19,772 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:47:19,772 INFO  L87              Difference]: Start difference. First operand 3345 states and 4610 transitions. Second operand  has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:20,524 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:47:20,524 INFO  L93              Difference]: Finished difference Result 9981 states and 13760 transitions.
[2025-02-05 10:47:20,524 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:47:20,525 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 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 157
[2025-02-05 10:47:20,525 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:47:20,542 INFO  L225             Difference]: With dead ends: 9981
[2025-02-05 10:47:20,542 INFO  L226             Difference]: Without dead ends: 6638
[2025-02-05 10:47:20,545 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-05 10:47:20,546 INFO  L435           NwaCegarLoop]: 72 mSDtfsCounter, 286 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 10:47:20,547 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 98 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 10:47:20,552 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6638 states.
[2025-02-05 10:47:20,630 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6638 to 6633.
[2025-02-05 10:47:20,638 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6633 states, 6632 states have (on average 1.3525331724969842) internal successors, (8970), 6632 states have internal predecessors, (8970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:20,648 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6633 states to 6633 states and 8970 transitions.
[2025-02-05 10:47:20,649 INFO  L78                 Accepts]: Start accepts. Automaton has 6633 states and 8970 transitions. Word has length 157
[2025-02-05 10:47:20,649 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:47:20,649 INFO  L471      AbstractCegarLoop]: Abstraction has 6633 states and 8970 transitions.
[2025-02-05 10:47:20,649 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 2 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:20,650 INFO  L276                IsEmpty]: Start isEmpty. Operand 6633 states and 8970 transitions.
[2025-02-05 10:47:20,654 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 161
[2025-02-05 10:47:20,654 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:47:20,654 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:47:20,654 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 10:47:20,654 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:47:20,655 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:47:20,655 INFO  L85        PathProgramCache]: Analyzing trace with hash 1763949036, now seen corresponding path program 1 times
[2025-02-05 10:47:20,655 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:47:20,655 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368758193]
[2025-02-05 10:47:20,655 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:20,655 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:47:20,680 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes.
[2025-02-05 10:47:20,694 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements.
[2025-02-05 10:47:20,695 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:20,697 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:20,881 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 10:47:20,881 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:47:20,882 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368758193]
[2025-02-05 10:47:20,882 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368758193] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 10:47:20,882 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358266961]
[2025-02-05 10:47:20,882 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:20,882 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 10:47:20,882 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 10:47:20,890 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-05 10:47:20,891 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-05 10:47:21,003 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes.
[2025-02-05 10:47:21,051 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements.
[2025-02-05 10:47:21,051 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:21,051 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:21,054 INFO  L256         TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 10:47:21,061 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 10:47:21,377 INFO  L134       CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-02-05 10:47:21,377 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 10:47:21,377 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [358266961] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:47:21,377 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 10:47:21,377 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2025-02-05 10:47:21,377 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826825767]
[2025-02-05 10:47:21,377 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:47:21,377 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:47:21,377 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:47:21,378 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:47:21,378 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 10:47:21,378 INFO  L87              Difference]: Start difference. First operand 6633 states and 8970 transitions. Second operand  has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:22,080 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:47:22,084 INFO  L93              Difference]: Finished difference Result 16522 states and 23056 transitions.
[2025-02-05 10:47:22,084 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:47:22,084 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 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 160
[2025-02-05 10:47:22,084 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:47:22,135 INFO  L225             Difference]: With dead ends: 16522
[2025-02-05 10:47:22,135 INFO  L226             Difference]: Without dead ends: 9891
[2025-02-05 10:47:22,152 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 10:47:22,153 INFO  L435           NwaCegarLoop]: 375 mSDtfsCounter, 96 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 10:47:22,153 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 404 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 10:47:22,174 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9891 states.
[2025-02-05 10:47:22,387 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9891 to 9071.
[2025-02-05 10:47:22,412 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9071 states, 9070 states have (on average 1.2981256890848953) internal successors, (11774), 9070 states have internal predecessors, (11774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:22,431 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9071 states to 9071 states and 11774 transitions.
[2025-02-05 10:47:22,431 INFO  L78                 Accepts]: Start accepts. Automaton has 9071 states and 11774 transitions. Word has length 160
[2025-02-05 10:47:22,432 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:47:22,432 INFO  L471      AbstractCegarLoop]: Abstraction has 9071 states and 11774 transitions.
[2025-02-05 10:47:22,433 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:22,433 INFO  L276                IsEmpty]: Start isEmpty. Operand 9071 states and 11774 transitions.
[2025-02-05 10:47:22,439 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 209
[2025-02-05 10:47:22,439 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:47:22,439 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:47:22,446 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-02-05 10:47:22,640 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 10:47:22,640 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:47:22,641 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:47:22,641 INFO  L85        PathProgramCache]: Analyzing trace with hash -881229480, now seen corresponding path program 1 times
[2025-02-05 10:47:22,641 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:47:22,641 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684854485]
[2025-02-05 10:47:22,641 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:22,641 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:47:22,701 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes.
[2025-02-05 10:47:22,713 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements.
[2025-02-05 10:47:22,713 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:22,713 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:23,034 INFO  L134       CoverageAnalysis]: Checked inductivity of 62 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 10:47:23,034 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:47:23,034 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684854485]
[2025-02-05 10:47:23,034 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684854485] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:47:23,034 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:47:23,034 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 10:47:23,034 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871223942]
[2025-02-05 10:47:23,034 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:47:23,035 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:47:23,035 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:47:23,035 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:47:23,035 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:47:23,035 INFO  L87              Difference]: Start difference. First operand 9071 states and 11774 transitions. Second operand  has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:23,869 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:47:23,869 INFO  L93              Difference]: Finished difference Result 22272 states and 28891 transitions.
[2025-02-05 10:47:23,870 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:47:23,870 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 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 208
[2025-02-05 10:47:23,870 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:47:23,910 INFO  L225             Difference]: With dead ends: 22272
[2025-02-05 10:47:23,910 INFO  L226             Difference]: Without dead ends: 13203
[2025-02-05 10:47:23,923 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-05 10:47:23,925 INFO  L435           NwaCegarLoop]: 212 mSDtfsCounter, 178 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 10:47:23,925 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 236 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 10:47:23,938 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13203 states.
[2025-02-05 10:47:24,060 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13203 to 13179.
[2025-02-05 10:47:24,080 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 13179 states, 13178 states have (on average 1.2838063439065108) internal successors, (16918), 13178 states have internal predecessors, (16918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:24,097 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13179 states to 13179 states and 16918 transitions.
[2025-02-05 10:47:24,098 INFO  L78                 Accepts]: Start accepts. Automaton has 13179 states and 16918 transitions. Word has length 208
[2025-02-05 10:47:24,098 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:47:24,099 INFO  L471      AbstractCegarLoop]: Abstraction has 13179 states and 16918 transitions.
[2025-02-05 10:47:24,099 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 2 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:24,099 INFO  L276                IsEmpty]: Start isEmpty. Operand 13179 states and 16918 transitions.
[2025-02-05 10:47:24,106 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 216
[2025-02-05 10:47:24,106 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:47:24,106 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:47:24,107 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 10:47:24,107 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:47:24,107 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:47:24,107 INFO  L85        PathProgramCache]: Analyzing trace with hash -1712679651, now seen corresponding path program 1 times
[2025-02-05 10:47:24,107 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:47:24,107 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075599245]
[2025-02-05 10:47:24,107 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:24,107 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:47:24,135 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes.
[2025-02-05 10:47:24,148 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements.
[2025-02-05 10:47:24,149 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:24,149 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:24,442 INFO  L134       CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 10:47:24,442 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:47:24,443 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075599245]
[2025-02-05 10:47:24,443 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075599245] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 10:47:24,443 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132153247]
[2025-02-05 10:47:24,443 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:24,443 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 10:47:24,443 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 10:47:24,445 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-05 10:47:24,449 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-05 10:47:24,524 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes.
[2025-02-05 10:47:24,580 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements.
[2025-02-05 10:47:24,580 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:24,580 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:24,582 INFO  L256         TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 10:47:24,589 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 10:47:24,739 INFO  L134       CoverageAnalysis]: Checked inductivity of 75 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-02-05 10:47:24,740 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 10:47:24,740 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [132153247] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:47:24,740 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 10:47:24,740 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-02-05 10:47:24,741 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095797507]
[2025-02-05 10:47:24,741 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:47:24,741 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:47:24,741 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:47:24,742 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:47:24,742 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 10:47:24,742 INFO  L87              Difference]: Start difference. First operand 13179 states and 16918 transitions. Second operand  has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 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-05 10:47:25,458 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:47:25,458 INFO  L93              Difference]: Finished difference Result 39405 states and 50587 transitions.
[2025-02-05 10:47:25,458 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:47:25,459 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 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) Word has length 215
[2025-02-05 10:47:25,459 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:47:25,502 INFO  L225             Difference]: With dead ends: 39405
[2025-02-05 10:47:25,502 INFO  L226             Difference]: Without dead ends: 26228
[2025-02-05 10:47:25,517 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 214 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 10:47:25,518 INFO  L435           NwaCegarLoop]: 175 mSDtfsCounter, 119 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 10:47:25,518 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 208 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 10:47:25,536 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26228 states.
[2025-02-05 10:47:25,784 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26228 to 26223.
[2025-02-05 10:47:25,819 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 26223 states, 26222 states have (on average 1.2433071466707346) internal successors, (32602), 26222 states have internal predecessors, (32602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:25,848 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26223 states to 26223 states and 32602 transitions.
[2025-02-05 10:47:25,849 INFO  L78                 Accepts]: Start accepts. Automaton has 26223 states and 32602 transitions. Word has length 215
[2025-02-05 10:47:25,849 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:47:25,849 INFO  L471      AbstractCegarLoop]: Abstraction has 26223 states and 32602 transitions.
[2025-02-05 10:47:25,850 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 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-05 10:47:25,850 INFO  L276                IsEmpty]: Start isEmpty. Operand 26223 states and 32602 transitions.
[2025-02-05 10:47:25,863 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 234
[2025-02-05 10:47:25,863 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:47:25,864 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:47:25,870 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-05 10:47:26,068 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 10:47:26,068 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:47:26,068 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:47:26,069 INFO  L85        PathProgramCache]: Analyzing trace with hash 174835320, now seen corresponding path program 1 times
[2025-02-05 10:47:26,069 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:47:26,069 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264794425]
[2025-02-05 10:47:26,069 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:26,069 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:47:26,094 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes.
[2025-02-05 10:47:26,103 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements.
[2025-02-05 10:47:26,103 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:26,104 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:26,310 INFO  L134       CoverageAnalysis]: Checked inductivity of 105 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-02-05 10:47:26,311 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:47:26,311 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264794425]
[2025-02-05 10:47:26,311 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264794425] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:47:26,311 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:47:26,311 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 10:47:26,311 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599390575]
[2025-02-05 10:47:26,311 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:47:26,311 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 10:47:26,311 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:47:26,312 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 10:47:26,312 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 10:47:26,312 INFO  L87              Difference]: Start difference. First operand 26223 states and 32602 transitions. Second operand  has 4 states, 4 states have (on average 57.0) internal successors, (228), 3 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-05 10:47:27,211 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:47:27,213 INFO  L93              Difference]: Finished difference Result 65377 states and 81736 transitions.
[2025-02-05 10:47:27,213 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 10:47:27,214 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 57.0) internal successors, (228), 3 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 233
[2025-02-05 10:47:27,214 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:47:27,278 INFO  L225             Difference]: With dead ends: 65377
[2025-02-05 10:47:27,279 INFO  L226             Difference]: Without dead ends: 39156
[2025-02-05 10:47:27,309 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-05 10:47:27,310 INFO  L435           NwaCegarLoop]: 37 mSDtfsCounter, 464 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 10:47:27,310 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 58 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 10:47:27,339 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39156 states.
[2025-02-05 10:47:27,820 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39156 to 39152.
[2025-02-05 10:47:27,849 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 39152 states, 39151 states have (on average 1.1940435748767593) internal successors, (46748), 39151 states have internal predecessors, (46748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:27,888 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39152 states to 39152 states and 46748 transitions.
[2025-02-05 10:47:27,888 INFO  L78                 Accepts]: Start accepts. Automaton has 39152 states and 46748 transitions. Word has length 233
[2025-02-05 10:47:27,890 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:47:27,890 INFO  L471      AbstractCegarLoop]: Abstraction has 39152 states and 46748 transitions.
[2025-02-05 10:47:27,890 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 57.0) internal successors, (228), 3 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-05 10:47:27,890 INFO  L276                IsEmpty]: Start isEmpty. Operand 39152 states and 46748 transitions.
[2025-02-05 10:47:27,905 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 247
[2025-02-05 10:47:27,905 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:47:27,906 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:47:27,906 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 10:47:27,906 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:47:27,906 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:47:27,906 INFO  L85        PathProgramCache]: Analyzing trace with hash 1983911998, now seen corresponding path program 1 times
[2025-02-05 10:47:27,907 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:47:27,907 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532037891]
[2025-02-05 10:47:27,907 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:27,907 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:47:27,940 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes.
[2025-02-05 10:47:27,945 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements.
[2025-02-05 10:47:27,945 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:27,945 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:28,065 INFO  L134       CoverageAnalysis]: Checked inductivity of 125 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked.
[2025-02-05 10:47:28,066 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:47:28,066 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532037891]
[2025-02-05 10:47:28,066 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532037891] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:47:28,066 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:47:28,066 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 10:47:28,066 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037343942]
[2025-02-05 10:47:28,066 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:47:28,066 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:47:28,067 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:47:28,067 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:47:28,067 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:47:28,067 INFO  L87              Difference]: Start difference. First operand 39152 states and 46748 transitions. Second operand  has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:28,979 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:47:28,980 INFO  L93              Difference]: Finished difference Result 98923 states and 117989 transitions.
[2025-02-05 10:47:28,980 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:47:28,980 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 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 246
[2025-02-05 10:47:28,980 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:47:29,057 INFO  L225             Difference]: With dead ends: 98923
[2025-02-05 10:47:29,058 INFO  L226             Difference]: Without dead ends: 59773
[2025-02-05 10:47:29,080 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-05 10:47:29,081 INFO  L435           NwaCegarLoop]: 66 mSDtfsCounter, 207 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 10:47:29,081 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 79 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 10:47:29,123 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 59773 states.
[2025-02-05 10:47:29,679 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 59773 to 59767.
[2025-02-05 10:47:29,724 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 59767 states, 59766 states have (on average 1.1886691429909981) internal successors, (71042), 59766 states have internal predecessors, (71042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:29,786 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 59767 states to 59767 states and 71042 transitions.
[2025-02-05 10:47:29,787 INFO  L78                 Accepts]: Start accepts. Automaton has 59767 states and 71042 transitions. Word has length 246
[2025-02-05 10:47:29,788 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:47:29,788 INFO  L471      AbstractCegarLoop]: Abstraction has 59767 states and 71042 transitions.
[2025-02-05 10:47:29,788 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 2 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:29,788 INFO  L276                IsEmpty]: Start isEmpty. Operand 59767 states and 71042 transitions.
[2025-02-05 10:47:29,805 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 248
[2025-02-05 10:47:29,805 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:47:29,806 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:47:29,806 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 10:47:29,806 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:47:29,807 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:47:29,807 INFO  L85        PathProgramCache]: Analyzing trace with hash 527730661, now seen corresponding path program 1 times
[2025-02-05 10:47:29,807 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:47:29,807 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862023379]
[2025-02-05 10:47:29,807 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:29,807 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:47:29,832 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes.
[2025-02-05 10:47:29,841 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements.
[2025-02-05 10:47:29,841 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:29,841 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:30,211 INFO  L134       CoverageAnalysis]: Checked inductivity of 102 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 10:47:30,212 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:47:30,212 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862023379]
[2025-02-05 10:47:30,212 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862023379] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:47:30,212 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:47:30,212 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 10:47:30,212 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388554672]
[2025-02-05 10:47:30,212 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:47:30,213 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 10:47:30,214 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:47:30,214 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 10:47:30,214 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 10:47:30,214 INFO  L87              Difference]: Start difference. First operand 59767 states and 71042 transitions. Second operand  has 4 states, 4 states have (on average 61.75) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:31,636 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:47:31,637 INFO  L93              Difference]: Finished difference Result 136490 states and 162453 transitions.
[2025-02-05 10:47:31,637 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 10:47:31,637 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 61.75) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 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 247
[2025-02-05 10:47:31,637 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:47:31,721 INFO  L225             Difference]: With dead ends: 136490
[2025-02-05 10:47:31,721 INFO  L226             Difference]: Without dead ends: 76725
[2025-02-05 10:47:31,749 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-05 10:47:31,750 INFO  L435           NwaCegarLoop]: 58 mSDtfsCounter, 353 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-05 10:47:31,750 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 86 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-05 10:47:31,792 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 76725 states.
[2025-02-05 10:47:32,572 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 76725 to 76616.
[2025-02-05 10:47:32,614 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 76616 states, 76615 states have (on average 1.1606473928081968) internal successors, (88923), 76615 states have internal predecessors, (88923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:32,699 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 76616 states to 76616 states and 88923 transitions.
[2025-02-05 10:47:32,700 INFO  L78                 Accepts]: Start accepts. Automaton has 76616 states and 88923 transitions. Word has length 247
[2025-02-05 10:47:32,701 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:47:32,701 INFO  L471      AbstractCegarLoop]: Abstraction has 76616 states and 88923 transitions.
[2025-02-05 10:47:32,701 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 61.75) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:32,701 INFO  L276                IsEmpty]: Start isEmpty. Operand 76616 states and 88923 transitions.
[2025-02-05 10:47:32,718 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 254
[2025-02-05 10:47:32,718 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:47:32,718 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:47:32,719 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 10:47:32,719 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:47:32,719 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:47:32,719 INFO  L85        PathProgramCache]: Analyzing trace with hash -1475792829, now seen corresponding path program 1 times
[2025-02-05 10:47:32,719 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:47:32,719 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032388584]
[2025-02-05 10:47:32,719 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:32,720 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:47:32,744 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes.
[2025-02-05 10:47:32,750 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements.
[2025-02-05 10:47:32,750 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:32,750 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:33,099 INFO  L134       CoverageAnalysis]: Checked inductivity of 145 backedges. 68 proven. 6 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked.
[2025-02-05 10:47:33,100 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:47:33,100 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032388584]
[2025-02-05 10:47:33,100 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032388584] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 10:47:33,100 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070816866]
[2025-02-05 10:47:33,100 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:33,100 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 10:47:33,100 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 10:47:33,102 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-05 10:47:33,109 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-05 10:47:33,174 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes.
[2025-02-05 10:47:33,270 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements.
[2025-02-05 10:47:33,270 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:33,271 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:33,272 INFO  L256         TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 10:47:33,276 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 10:47:33,413 INFO  L134       CoverageAnalysis]: Checked inductivity of 145 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2025-02-05 10:47:33,413 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 10:47:33,413 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070816866] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:47:33,413 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 10:47:33,413 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-02-05 10:47:33,413 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791577345]
[2025-02-05 10:47:33,413 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:47:33,414 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:47:33,415 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:47:33,415 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:47:33,415 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 10:47:33,415 INFO  L87              Difference]: Start difference. First operand 76616 states and 88923 transitions. Second operand  has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:34,192 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:47:34,192 INFO  L93              Difference]: Finished difference Result 153254 states and 177884 transitions.
[2025-02-05 10:47:34,193 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:47:34,193 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 253
[2025-02-05 10:47:34,193 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:47:34,289 INFO  L225             Difference]: With dead ends: 153254
[2025-02-05 10:47:34,289 INFO  L226             Difference]: Without dead ends: 76640
[2025-02-05 10:47:34,340 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 10:47:34,341 INFO  L435           NwaCegarLoop]: 281 mSDtfsCounter, 119 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 608 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 10:47:34,341 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 290 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 608 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 10:47:34,385 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 76640 states.
[2025-02-05 10:47:35,073 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 76640 to 76210.
[2025-02-05 10:47:35,126 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 76210 states, 76209 states have (on average 1.1483026939075438) internal successors, (87511), 76209 states have internal predecessors, (87511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:35,206 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 76210 states to 76210 states and 87511 transitions.
[2025-02-05 10:47:35,207 INFO  L78                 Accepts]: Start accepts. Automaton has 76210 states and 87511 transitions. Word has length 253
[2025-02-05 10:47:35,207 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:47:35,207 INFO  L471      AbstractCegarLoop]: Abstraction has 76210 states and 87511 transitions.
[2025-02-05 10:47:35,208 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:35,208 INFO  L276                IsEmpty]: Start isEmpty. Operand 76210 states and 87511 transitions.
[2025-02-05 10:47:35,225 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 273
[2025-02-05 10:47:35,225 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:47:35,225 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:47:35,232 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-05 10:47:35,430 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 10:47:35,430 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:47:35,430 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:47:35,430 INFO  L85        PathProgramCache]: Analyzing trace with hash -411818618, now seen corresponding path program 1 times
[2025-02-05 10:47:35,430 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:47:35,430 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718346384]
[2025-02-05 10:47:35,431 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:35,431 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:47:35,458 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes.
[2025-02-05 10:47:35,464 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements.
[2025-02-05 10:47:35,464 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:35,464 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:35,876 INFO  L134       CoverageAnalysis]: Checked inductivity of 208 backedges. 93 proven. 6 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked.
[2025-02-05 10:47:35,876 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:47:35,876 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718346384]
[2025-02-05 10:47:35,876 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718346384] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 10:47:35,876 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634808179]
[2025-02-05 10:47:35,877 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:35,877 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 10:47:35,877 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 10:47:35,883 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-05 10:47:35,889 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-05 10:47:35,977 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes.
[2025-02-05 10:47:36,055 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements.
[2025-02-05 10:47:36,056 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:36,056 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:36,058 INFO  L256         TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 10:47:36,063 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 10:47:36,204 INFO  L134       CoverageAnalysis]: Checked inductivity of 208 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 10:47:36,204 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 10:47:36,205 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [634808179] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:47:36,205 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 10:47:36,205 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-02-05 10:47:36,205 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019051727]
[2025-02-05 10:47:36,205 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:47:36,205 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:47:36,205 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:47:36,206 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:47:36,206 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 10:47:36,206 INFO  L87              Difference]: Start difference. First operand 76210 states and 87511 transitions. Second operand  has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:37,219 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:47:37,220 INFO  L93              Difference]: Finished difference Result 152462 states and 175100 transitions.
[2025-02-05 10:47:37,220 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:47:37,220 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 272
[2025-02-05 10:47:37,221 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:47:37,308 INFO  L225             Difference]: With dead ends: 152462
[2025-02-05 10:47:37,308 INFO  L226             Difference]: Without dead ends: 76254
[2025-02-05 10:47:37,347 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 10:47:37,348 INFO  L435           NwaCegarLoop]: 350 mSDtfsCounter, 80 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 10:47:37,348 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 365 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 10:47:37,401 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 76254 states.
[2025-02-05 10:47:38,296 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 76254 to 76210.
[2025-02-05 10:47:38,341 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 76210 states, 76209 states have (on average 1.143841278589143) internal successors, (87171), 76209 states have internal predecessors, (87171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:38,432 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 76210 states to 76210 states and 87171 transitions.
[2025-02-05 10:47:38,434 INFO  L78                 Accepts]: Start accepts. Automaton has 76210 states and 87171 transitions. Word has length 272
[2025-02-05 10:47:38,434 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:47:38,434 INFO  L471      AbstractCegarLoop]: Abstraction has 76210 states and 87171 transitions.
[2025-02-05 10:47:38,434 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:38,434 INFO  L276                IsEmpty]: Start isEmpty. Operand 76210 states and 87171 transitions.
[2025-02-05 10:47:38,459 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 291
[2025-02-05 10:47:38,460 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:47:38,460 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:47:38,467 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-05 10:47:38,660 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,SelfDestructingSolverStorable12
[2025-02-05 10:47:38,661 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:47:38,661 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:47:38,661 INFO  L85        PathProgramCache]: Analyzing trace with hash 951124131, now seen corresponding path program 1 times
[2025-02-05 10:47:38,661 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:47:38,661 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733172218]
[2025-02-05 10:47:38,661 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:38,661 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:47:38,692 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 290 statements into 1 equivalence classes.
[2025-02-05 10:47:38,707 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 290 of 290 statements.
[2025-02-05 10:47:38,707 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:38,707 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:39,034 INFO  L134       CoverageAnalysis]: Checked inductivity of 164 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2025-02-05 10:47:39,034 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:47:39,034 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733172218]
[2025-02-05 10:47:39,034 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733172218] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:47:39,035 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 10:47:39,035 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 10:47:39,035 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217334974]
[2025-02-05 10:47:39,035 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:47:39,035 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:47:39,035 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:47:39,036 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:47:39,036 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 10:47:39,036 INFO  L87              Difference]: Start difference. First operand 76210 states and 87171 transitions. Second operand  has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:39,831 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:47:39,832 INFO  L93              Difference]: Finished difference Result 160375 states and 183380 transitions.
[2025-02-05 10:47:39,832 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:47:39,832 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 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 290
[2025-02-05 10:47:39,833 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:47:40,114 INFO  L225             Difference]: With dead ends: 160375
[2025-02-05 10:47:40,115 INFO  L226             Difference]: Without dead ends: 84167
[2025-02-05 10:47:40,146 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-05 10:47:40,147 INFO  L435           NwaCegarLoop]: 354 mSDtfsCounter, 81 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 10:47:40,147 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 370 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 10:47:40,205 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 84167 states.
[2025-02-05 10:47:41,054 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 84167 to 84167.
[2025-02-05 10:47:41,105 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 84167 states, 84166 states have (on average 1.135779293301333) internal successors, (95594), 84166 states have internal predecessors, (95594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:41,190 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 84167 states to 84167 states and 95594 transitions.
[2025-02-05 10:47:41,192 INFO  L78                 Accepts]: Start accepts. Automaton has 84167 states and 95594 transitions. Word has length 290
[2025-02-05 10:47:41,192 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:47:41,192 INFO  L471      AbstractCegarLoop]: Abstraction has 84167 states and 95594 transitions.
[2025-02-05 10:47:41,192 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:41,192 INFO  L276                IsEmpty]: Start isEmpty. Operand 84167 states and 95594 transitions.
[2025-02-05 10:47:41,214 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 296
[2025-02-05 10:47:41,215 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:47:41,215 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:47:41,215 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 10:47:41,215 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:47:41,215 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:47:41,216 INFO  L85        PathProgramCache]: Analyzing trace with hash 466190375, now seen corresponding path program 1 times
[2025-02-05 10:47:41,216 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:47:41,216 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464411927]
[2025-02-05 10:47:41,216 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:41,216 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:47:41,242 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes.
[2025-02-05 10:47:41,247 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements.
[2025-02-05 10:47:41,248 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:41,248 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:41,592 INFO  L134       CoverageAnalysis]: Checked inductivity of 263 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked.
[2025-02-05 10:47:41,593 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:47:41,593 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464411927]
[2025-02-05 10:47:41,593 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464411927] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 10:47:41,593 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301295136]
[2025-02-05 10:47:41,593 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:41,593 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 10:47:41,593 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 10:47:41,595 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-05 10:47:41,596 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-05 10:47:41,655 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes.
[2025-02-05 10:47:41,720 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements.
[2025-02-05 10:47:41,720 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:41,720 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:41,722 INFO  L256         TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-02-05 10:47:41,725 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 10:47:41,764 INFO  L134       CoverageAnalysis]: Checked inductivity of 263 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2025-02-05 10:47:41,764 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 10:47:41,764 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301295136] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:47:41,764 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 10:47:41,764 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-02-05 10:47:41,764 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50398949]
[2025-02-05 10:47:41,764 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:47:41,765 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:47:41,765 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:47:41,765 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:47:41,765 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 10:47:41,765 INFO  L87              Difference]: Start difference. First operand 84167 states and 95594 transitions. Second operand  has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:42,539 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:47:42,540 INFO  L93              Difference]: Finished difference Result 163377 states and 185544 transitions.
[2025-02-05 10:47:42,540 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:47:42,540 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 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 295
[2025-02-05 10:47:42,540 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:47:42,800 INFO  L225             Difference]: With dead ends: 163377
[2025-02-05 10:47:42,800 INFO  L226             Difference]: Without dead ends: 79212
[2025-02-05 10:47:42,837 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 294 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 10:47:42,838 INFO  L435           NwaCegarLoop]: 317 mSDtfsCounter, 217 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 10:47:42,838 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 332 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 10:47:42,885 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 79212 states.
[2025-02-05 10:47:43,578 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 79212 to 79200.
[2025-02-05 10:47:43,629 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 79200 states, 79199 states have (on average 1.1005820780565412) internal successors, (87165), 79199 states have internal predecessors, (87165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:43,746 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 79200 states to 79200 states and 87165 transitions.
[2025-02-05 10:47:43,748 INFO  L78                 Accepts]: Start accepts. Automaton has 79200 states and 87165 transitions. Word has length 295
[2025-02-05 10:47:43,749 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:47:43,749 INFO  L471      AbstractCegarLoop]: Abstraction has 79200 states and 87165 transitions.
[2025-02-05 10:47:43,749 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:43,749 INFO  L276                IsEmpty]: Start isEmpty. Operand 79200 states and 87165 transitions.
[2025-02-05 10:47:43,778 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 313
[2025-02-05 10:47:43,778 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:47:43,778 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 10:47:43,785 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-05 10:47:43,979 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,SelfDestructingSolverStorable14
[2025-02-05 10:47:43,979 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:47:43,980 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:47:43,980 INFO  L85        PathProgramCache]: Analyzing trace with hash -324839118, now seen corresponding path program 1 times
[2025-02-05 10:47:43,980 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:47:43,980 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531473757]
[2025-02-05 10:47:43,980 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:43,980 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:47:44,026 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes.
[2025-02-05 10:47:44,034 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements.
[2025-02-05 10:47:44,034 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:44,034 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:44,357 INFO  L134       CoverageAnalysis]: Checked inductivity of 297 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked.
[2025-02-05 10:47:44,358 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:47:44,358 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531473757]
[2025-02-05 10:47:44,358 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531473757] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 10:47:44,358 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174589580]
[2025-02-05 10:47:44,358 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:44,358 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 10:47:44,358 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 10:47:44,360 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-05 10:47:44,362 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-05 10:47:44,590 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes.
[2025-02-05 10:47:44,660 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements.
[2025-02-05 10:47:44,660 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:44,660 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:44,663 INFO  L256         TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 10:47:44,672 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 10:47:44,817 INFO  L134       CoverageAnalysis]: Checked inductivity of 297 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked.
[2025-02-05 10:47:44,817 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 10:47:44,817 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [174589580] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:47:44,817 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 10:47:44,817 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-02-05 10:47:44,818 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86464091]
[2025-02-05 10:47:44,818 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:47:44,818 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:47:44,818 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:47:44,818 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:47:44,819 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 10:47:44,819 INFO  L87              Difference]: Start difference. First operand 79200 states and 87165 transitions. Second operand  has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:45,721 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:47:45,721 INFO  L93              Difference]: Finished difference Result 199236 states and 219344 transitions.
[2025-02-05 10:47:45,722 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:47:45,722 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 312
[2025-02-05 10:47:45,722 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:47:45,858 INFO  L225             Difference]: With dead ends: 199236
[2025-02-05 10:47:45,858 INFO  L226             Difference]: Without dead ends: 120038
[2025-02-05 10:47:45,912 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 311 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 10:47:45,912 INFO  L435           NwaCegarLoop]: 146 mSDtfsCounter, 98 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 10:47:45,913 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 165 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 10:47:45,992 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 120038 states.
[2025-02-05 10:47:47,029 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 120038 to 119210.
[2025-02-05 10:47:47,114 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 119210 states, 119209 states have (on average 1.0890704560897249) internal successors, (129827), 119209 states have internal predecessors, (129827), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:47,239 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 119210 states to 119210 states and 129827 transitions.
[2025-02-05 10:47:47,242 INFO  L78                 Accepts]: Start accepts. Automaton has 119210 states and 129827 transitions. Word has length 312
[2025-02-05 10:47:47,242 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:47:47,242 INFO  L471      AbstractCegarLoop]: Abstraction has 119210 states and 129827 transitions.
[2025-02-05 10:47:47,242 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:47,242 INFO  L276                IsEmpty]: Start isEmpty. Operand 119210 states and 129827 transitions.
[2025-02-05 10:47:47,283 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 352
[2025-02-05 10:47:47,283 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:47:47,284 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:47:47,290 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-05 10:47:47,484 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,SelfDestructingSolverStorable15
[2025-02-05 10:47:47,485 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:47:47,485 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:47:47,485 INFO  L85        PathProgramCache]: Analyzing trace with hash -1782104103, now seen corresponding path program 1 times
[2025-02-05 10:47:47,485 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:47:47,485 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140638207]
[2025-02-05 10:47:47,485 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:47,485 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:47:47,518 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes.
[2025-02-05 10:47:47,523 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements.
[2025-02-05 10:47:47,524 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:47,524 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:48,064 INFO  L134       CoverageAnalysis]: Checked inductivity of 320 backedges. 102 proven. 6 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked.
[2025-02-05 10:47:48,064 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:47:48,064 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140638207]
[2025-02-05 10:47:48,064 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140638207] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 10:47:48,064 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92143880]
[2025-02-05 10:47:48,064 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:48,065 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 10:47:48,065 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 10:47:48,066 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-05 10:47:48,068 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-05 10:47:48,153 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 351 statements into 1 equivalence classes.
[2025-02-05 10:47:48,240 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 351 of 351 statements.
[2025-02-05 10:47:48,241 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:48,241 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:48,244 INFO  L256         TraceCheckSpWp]: Trace formula consists of 616 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-02-05 10:47:48,248 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 10:47:48,366 INFO  L134       CoverageAnalysis]: Checked inductivity of 320 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked.
[2025-02-05 10:47:48,367 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 10:47:48,367 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [92143880] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:47:48,367 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 10:47:48,367 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-02-05 10:47:48,367 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897858816]
[2025-02-05 10:47:48,367 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:47:48,367 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:47:48,368 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:47:48,368 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:47:48,368 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 10:47:48,368 INFO  L87              Difference]: Start difference. First operand 119210 states and 129827 transitions. Second operand  has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:49,563 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:47:49,563 INFO  L93              Difference]: Finished difference Result 227046 states and 247172 transitions.
[2025-02-05 10:47:49,564 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:47:49,564 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 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 351
[2025-02-05 10:47:49,564 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:47:49,688 INFO  L225             Difference]: With dead ends: 227046
[2025-02-05 10:47:49,689 INFO  L226             Difference]: Without dead ends: 107838
[2025-02-05 10:47:49,727 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 10:47:49,728 INFO  L435           NwaCegarLoop]: 291 mSDtfsCounter, 121 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 10:47:49,728 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 306 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 10:47:49,791 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 107838 states.
[2025-02-05 10:47:50,632 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 107838 to 97673.
[2025-02-05 10:47:50,700 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 97673 states, 97672 states have (on average 1.071965353427799) internal successors, (104701), 97672 states have internal predecessors, (104701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:50,794 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 97673 states to 97673 states and 104701 transitions.
[2025-02-05 10:47:50,797 INFO  L78                 Accepts]: Start accepts. Automaton has 97673 states and 104701 transitions. Word has length 351
[2025-02-05 10:47:50,797 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:47:50,797 INFO  L471      AbstractCegarLoop]: Abstraction has 97673 states and 104701 transitions.
[2025-02-05 10:47:50,797 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:50,797 INFO  L276                IsEmpty]: Start isEmpty. Operand 97673 states and 104701 transitions.
[2025-02-05 10:47:50,827 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 374
[2025-02-05 10:47:50,827 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:47:50,827 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:47:50,833 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2025-02-05 10:47:51,028 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 10:47:51,028 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:47:51,029 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:47:51,029 INFO  L85        PathProgramCache]: Analyzing trace with hash -1393738971, now seen corresponding path program 1 times
[2025-02-05 10:47:51,029 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:47:51,029 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815339007]
[2025-02-05 10:47:51,029 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:51,029 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:47:51,062 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes.
[2025-02-05 10:47:51,068 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements.
[2025-02-05 10:47:51,068 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:51,068 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:51,503 INFO  L134       CoverageAnalysis]: Checked inductivity of 471 backedges. 141 proven. 6 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked.
[2025-02-05 10:47:51,503 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:47:51,503 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815339007]
[2025-02-05 10:47:51,503 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815339007] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 10:47:51,503 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377721265]
[2025-02-05 10:47:51,503 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:51,504 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 10:47:51,504 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 10:47:51,505 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-05 10:47:51,507 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-05 10:47:51,573 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes.
[2025-02-05 10:47:51,659 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements.
[2025-02-05 10:47:51,659 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:51,659 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:51,663 INFO  L256         TraceCheckSpWp]: Trace formula consists of 734 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 10:47:51,670 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 10:47:51,774 INFO  L134       CoverageAnalysis]: Checked inductivity of 471 backedges. 394 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked.
[2025-02-05 10:47:51,774 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 10:47:51,774 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377721265] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:47:51,774 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 10:47:51,774 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-02-05 10:47:51,774 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219212903]
[2025-02-05 10:47:51,774 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:47:51,775 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:47:51,775 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:47:51,775 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:47:51,775 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 10:47:51,775 INFO  L87              Difference]: Start difference. First operand 97673 states and 104701 transitions. Second operand  has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:52,879 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:47:52,879 INFO  L93              Difference]: Finished difference Result 187204 states and 200759 transitions.
[2025-02-05 10:47:52,879 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:47:52,880 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 373
[2025-02-05 10:47:52,880 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:47:52,997 INFO  L225             Difference]: With dead ends: 187204
[2025-02-05 10:47:52,998 INFO  L226             Difference]: Without dead ends: 89533
[2025-02-05 10:47:53,041 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 10:47:53,042 INFO  L435           NwaCegarLoop]: 72 mSDtfsCounter, 168 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 10:47:53,042 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 83 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 10:47:53,109 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 89533 states.
[2025-02-05 10:47:54,169 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 89533 to 83845.
[2025-02-05 10:47:54,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 83845 states, 83844 states have (on average 1.0572730308668479) internal successors, (88646), 83844 states have internal predecessors, (88646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:54,312 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 83845 states to 83845 states and 88646 transitions.
[2025-02-05 10:47:54,315 INFO  L78                 Accepts]: Start accepts. Automaton has 83845 states and 88646 transitions. Word has length 373
[2025-02-05 10:47:54,316 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:47:54,316 INFO  L471      AbstractCegarLoop]: Abstraction has 83845 states and 88646 transitions.
[2025-02-05 10:47:54,316 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:54,316 INFO  L276                IsEmpty]: Start isEmpty. Operand 83845 states and 88646 transitions.
[2025-02-05 10:47:54,347 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 390
[2025-02-05 10:47:54,347 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:47:54,347 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:47:54,354 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-05 10:47:54,548 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,SelfDestructingSolverStorable17
[2025-02-05 10:47:54,548 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:47:54,549 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:47:54,549 INFO  L85        PathProgramCache]: Analyzing trace with hash 1422193856, now seen corresponding path program 1 times
[2025-02-05 10:47:54,549 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:47:54,550 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116949048]
[2025-02-05 10:47:54,550 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:54,550 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:47:54,586 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes.
[2025-02-05 10:47:54,593 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements.
[2025-02-05 10:47:54,593 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:54,594 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:54,849 INFO  L134       CoverageAnalysis]: Checked inductivity of 399 backedges. 109 proven. 6 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked.
[2025-02-05 10:47:54,849 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:47:54,849 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116949048]
[2025-02-05 10:47:54,849 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116949048] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 10:47:54,849 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491265821]
[2025-02-05 10:47:54,849 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:54,850 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 10:47:54,850 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 10:47:54,852 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-05 10:47:54,853 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-05 10:47:55,092 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes.
[2025-02-05 10:47:55,178 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements.
[2025-02-05 10:47:55,178 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:55,178 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:55,181 INFO  L256         TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-02-05 10:47:55,185 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 10:47:55,273 INFO  L134       CoverageAnalysis]: Checked inductivity of 399 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked.
[2025-02-05 10:47:55,273 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 10:47:55,273 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [491265821] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:47:55,273 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 10:47:55,274 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4
[2025-02-05 10:47:55,275 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257689575]
[2025-02-05 10:47:55,275 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:47:55,276 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:47:55,276 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:47:55,276 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:47:55,276 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 10:47:55,276 INFO  L87              Difference]: Start difference. First operand 83845 states and 88646 transitions. Second operand  has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:55,835 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:47:55,835 INFO  L93              Difference]: Finished difference Result 167680 states and 177282 transitions.
[2025-02-05 10:47:55,836 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:47:55,836 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 389
[2025-02-05 10:47:55,836 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:47:55,929 INFO  L225             Difference]: With dead ends: 167680
[2025-02-05 10:47:55,929 INFO  L226             Difference]: Without dead ends: 83837
[2025-02-05 10:47:55,976 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 10:47:55,977 INFO  L435           NwaCegarLoop]: 29 mSDtfsCounter, 274 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-05 10:47:55,977 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 29 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-05 10:47:56,038 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 83837 states.
[2025-02-05 10:47:56,802 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 83837 to 83833.
[2025-02-05 10:47:56,862 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 83833 states, 83832 states have (on average 1.0571858001717722) internal successors, (88626), 83832 states have internal predecessors, (88626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:56,943 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 83833 states to 83833 states and 88626 transitions.
[2025-02-05 10:47:56,946 INFO  L78                 Accepts]: Start accepts. Automaton has 83833 states and 88626 transitions. Word has length 389
[2025-02-05 10:47:56,947 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:47:56,947 INFO  L471      AbstractCegarLoop]: Abstraction has 83833 states and 88626 transitions.
[2025-02-05 10:47:56,947 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 75.0) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:56,947 INFO  L276                IsEmpty]: Start isEmpty. Operand 83833 states and 88626 transitions.
[2025-02-05 10:47:56,974 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 405
[2025-02-05 10:47:56,974 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:47:56,974 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:47:56,980 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-05 10:47:57,174 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 10:47:57,175 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:47:57,175 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:47:57,175 INFO  L85        PathProgramCache]: Analyzing trace with hash -145463382, now seen corresponding path program 1 times
[2025-02-05 10:47:57,175 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:47:57,175 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325301183]
[2025-02-05 10:47:57,175 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:57,175 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:47:57,216 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes.
[2025-02-05 10:47:57,224 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements.
[2025-02-05 10:47:57,224 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:57,224 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:57,754 INFO  L134       CoverageAnalysis]: Checked inductivity of 469 backedges. 130 proven. 6 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked.
[2025-02-05 10:47:57,754 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:47:57,754 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325301183]
[2025-02-05 10:47:57,754 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325301183] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 10:47:57,754 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908767367]
[2025-02-05 10:47:57,754 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:47:57,755 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 10:47:57,755 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 10:47:57,758 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-05 10:47:57,759 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-05 10:47:57,850 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes.
[2025-02-05 10:47:57,965 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements.
[2025-02-05 10:47:57,965 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:47:57,965 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:47:57,968 INFO  L256         TraceCheckSpWp]: Trace formula consists of 755 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-02-05 10:47:57,973 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 10:47:57,989 INFO  L134       CoverageAnalysis]: Checked inductivity of 469 backedges. 269 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked.
[2025-02-05 10:47:57,989 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 10:47:57,989 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908767367] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:47:57,989 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 10:47:57,989 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-02-05 10:47:57,989 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857634723]
[2025-02-05 10:47:57,990 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:47:57,990 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 10:47:57,990 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:47:57,990 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 10:47:57,990 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 10:47:57,990 INFO  L87              Difference]: Start difference. First operand 83833 states and 88626 transitions. Second operand  has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:47:58,863 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:47:58,863 INFO  L93              Difference]: Finished difference Result 230504 states and 243585 transitions.
[2025-02-05 10:47:58,864 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 10:47:58,864 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 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 404
[2025-02-05 10:47:58,864 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:47:59,017 INFO  L225             Difference]: With dead ends: 230504
[2025-02-05 10:47:59,017 INFO  L226             Difference]: Without dead ends: 146673
[2025-02-05 10:47:59,052 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 10:47:59,053 INFO  L435           NwaCegarLoop]: 603 mSDtfsCounter, 298 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-05 10:47:59,053 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 863 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-05 10:47:59,131 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 146673 states.
[2025-02-05 10:48:00,236 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 146673 to 143821.
[2025-02-05 10:48:00,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 143821 states, 143820 states have (on average 1.0534765679321374) internal successors, (151511), 143820 states have internal predecessors, (151511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:48:00,839 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 143821 states to 143821 states and 151511 transitions.
[2025-02-05 10:48:00,843 INFO  L78                 Accepts]: Start accepts. Automaton has 143821 states and 151511 transitions. Word has length 404
[2025-02-05 10:48:00,843 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 10:48:00,843 INFO  L471      AbstractCegarLoop]: Abstraction has 143821 states and 151511 transitions.
[2025-02-05 10:48:00,843 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:48:00,843 INFO  L276                IsEmpty]: Start isEmpty. Operand 143821 states and 151511 transitions.
[2025-02-05 10:48:00,886 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 420
[2025-02-05 10:48:00,886 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 10:48:00,886 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 10:48:00,893 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-05 10:48:01,090 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 10:48:01,090 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 10:48:01,091 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 10:48:01,091 INFO  L85        PathProgramCache]: Analyzing trace with hash -1609784448, now seen corresponding path program 1 times
[2025-02-05 10:48:01,092 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 10:48:01,092 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171483688]
[2025-02-05 10:48:01,092 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:48:01,092 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 10:48:01,128 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes.
[2025-02-05 10:48:01,134 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements.
[2025-02-05 10:48:01,134 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:48:01,134 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:48:01,406 INFO  L134       CoverageAnalysis]: Checked inductivity of 492 backedges. 123 proven. 6 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked.
[2025-02-05 10:48:01,407 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 10:48:01,407 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171483688]
[2025-02-05 10:48:01,407 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171483688] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 10:48:01,407 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4543991]
[2025-02-05 10:48:01,407 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 10:48:01,407 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 10:48:01,407 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 10:48:01,413 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-05 10:48:01,417 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-05 10:48:01,492 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes.
[2025-02-05 10:48:01,581 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements.
[2025-02-05 10:48:01,581 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 10:48:01,581 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 10:48:01,584 INFO  L256         TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-02-05 10:48:01,591 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 10:48:01,675 INFO  L134       CoverageAnalysis]: Checked inductivity of 492 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 363 trivial. 0 not checked.
[2025-02-05 10:48:01,675 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 10:48:01,675 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [4543991] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 10:48:01,675 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 10:48:01,675 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5
[2025-02-05 10:48:01,675 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161044207]
[2025-02-05 10:48:01,675 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 10:48:01,676 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 10:48:01,676 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 10:48:01,676 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 10:48:01,676 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-05 10:48:01,677 INFO  L87              Difference]: Start difference. First operand 143821 states and 151511 transitions. Second operand  has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 10:48:03,344 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 10:48:03,344 INFO  L93              Difference]: Finished difference Result 363467 states and 383054 transitions.
[2025-02-05 10:48:03,344 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 10:48:03,344 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 45.75) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 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 419
[2025-02-05 10:48:03,345 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 10:48:03,636 INFO  L225             Difference]: With dead ends: 363467
[2025-02-05 10:48:03,636 INFO  L226             Difference]: Without dead ends: 219648