./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label11.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/Problem17_label11.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 d617eb63717df2c143c72a2b28226809849fdb6b46ba3b8819c6be91e87f3a08
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 12:01:45,331 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 12:01:45,368 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-05 12:01:45,371 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 12:01:45,372 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 12:01:45,386 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 12:01:45,386 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 12:01:45,387 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 12:01:45,387 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 12:01:45,387 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 12:01:45,387 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 12:01:45,387 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 12:01:45,387 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 12:01:45,388 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 12:01:45,388 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 12:01:45,388 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 12:01:45,388 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 12:01:45,389 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 12:01:45,389 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 12:01:45,389 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 12:01:45,389 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 12:01:45,389 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 12:01:45,389 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 12:01:45,390 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 12:01:45,390 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 12:01:45,390 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 12:01:45,390 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 12:01:45,390 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 12:01:45,390 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 12:01:45,390 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 12:01:45,391 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 12:01:45,391 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 12:01:45,391 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 12:01:45,391 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 12:01:45,391 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 12:01:45,391 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 12:01:45,391 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 12:01:45,391 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 12:01:45,391 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 12:01:45,391 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 12:01:45,391 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 12:01:45,391 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 12:01:45,391 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 12:01:45,391 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 -> d617eb63717df2c143c72a2b28226809849fdb6b46ba3b8819c6be91e87f3a08
[2025-02-05 12:01:45,645 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 12:01:45,656 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 12:01:45,658 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 12:01:45,659 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 12:01:45,660 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 12:01:45,661 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label11.c
[2025-02-05 12:01:46,940 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f99d1c6c/a489e9c4952b4268934a24300f78c731/FLAG42fed150a
[2025-02-05 12:01:47,316 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 12:01:47,316 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label11.c
[2025-02-05 12:01:47,336 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f99d1c6c/a489e9c4952b4268934a24300f78c731/FLAG42fed150a
[2025-02-05 12:01:47,351 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f99d1c6c/a489e9c4952b4268934a24300f78c731
[2025-02-05 12:01:47,353 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 12:01:47,354 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 12:01:47,355 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 12:01:47,356 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 12:01:47,359 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 12:01:47,359 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:01:47" (1/1) ...
[2025-02-05 12:01:47,360 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11563375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:47, skipping insertion in model container
[2025-02-05 12:01:47,360 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:01:47" (1/1) ...
[2025-02-05 12:01:47,415 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 12:01:47,590 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/Problem17_label11.c[8243,8256]
[2025-02-05 12:01:47,942 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 12:01:47,949 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 12:01:47,970 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/Problem17_label11.c[8243,8256]
[2025-02-05 12:01:48,171 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 12:01:48,185 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 12:01:48,186 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:48 WrapperNode
[2025-02-05 12:01:48,187 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 12:01:48,188 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 12:01:48,188 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 12:01:48,188 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 12:01:48,193 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:48" (1/1) ...
[2025-02-05 12:01:48,232 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:48" (1/1) ...
[2025-02-05 12:01:48,392 INFO  L138                Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610
[2025-02-05 12:01:48,393 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 12:01:48,394 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 12:01:48,395 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 12:01:48,395 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 12:01:48,401 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:48" (1/1) ...
[2025-02-05 12:01:48,402 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:48" (1/1) ...
[2025-02-05 12:01:48,499 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:48" (1/1) ...
[2025-02-05 12:01:48,605 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 12:01:48,605 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:48" (1/1) ...
[2025-02-05 12:01:48,605 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:48" (1/1) ...
[2025-02-05 12:01:48,709 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:48" (1/1) ...
[2025-02-05 12:01:48,733 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:48" (1/1) ...
[2025-02-05 12:01:48,759 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:48" (1/1) ...
[2025-02-05 12:01:48,782 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:48" (1/1) ...
[2025-02-05 12:01:48,836 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 12:01:48,841 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 12:01:48,841 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 12:01:48,841 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 12:01:48,843 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:48" (1/1) ...
[2025-02-05 12:01:48,853 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 12:01:48,870 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:01:48,911 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 12:01:48,924 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 12:01:48,954 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 12:01:48,954 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 12:01:48,954 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 12:01:48,954 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 12:01:49,043 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 12:01:49,044 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 12:01:51,711 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1;
[2025-02-05 12:01:51,827 INFO  L?                        ?]: Removed 372 outVars from TransFormulas that were not future-live.
[2025-02-05 12:01:51,827 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 12:01:51,856 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 12:01:51,857 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 12:01:51,860 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:01:51 BoogieIcfgContainer
[2025-02-05 12:01:51,860 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 12:01:51,862 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 12:01:51,862 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 12:01:51,895 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 12:01:51,901 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:01:47" (1/3) ...
[2025-02-05 12:01:51,902 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd5d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:01:51, skipping insertion in model container
[2025-02-05 12:01:51,902 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:01:48" (2/3) ...
[2025-02-05 12:01:51,902 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd5d7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:01:51, skipping insertion in model container
[2025-02-05 12:01:51,902 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:01:51" (3/3) ...
[2025-02-05 12:01:51,903 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem17_label11.c
[2025-02-05 12:01:51,916 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 12:01:51,917 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label11.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 12:01:51,984 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 12:01:51,994 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;@184b470c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 12:01:51,995 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 12:01:52,000 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states 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 12:01:52,005 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2025-02-05 12:01:52,005 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:01:52,006 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]
[2025-02-05 12:01:52,006 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:01:52,010 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:01:52,010 INFO  L85        PathProgramCache]: Analyzing trace with hash 1549564339, now seen corresponding path program 1 times
[2025-02-05 12:01:52,015 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:01:52,016 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380648904]
[2025-02-05 12:01:52,016 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:01:52,017 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:01:52,068 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes.
[2025-02-05 12:01:52,094 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements.
[2025-02-05 12:01:52,094 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:01:52,094 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:01:52,250 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 12:01:52,250 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:01:52,250 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380648904]
[2025-02-05 12:01:52,251 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380648904] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:01:52,251 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:01:52,251 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 12:01:52,252 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874721405]
[2025-02-05 12:01:52,253 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:01:52,255 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:01:52,256 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:01:52,267 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:01:52,268 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:01:52,270 INFO  L87              Difference]: Start difference. First operand  has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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 12:01:54,263 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:01:54,264 INFO  L93              Difference]: Finished difference Result 1680 states and 3071 transitions.
[2025-02-05 12:01:54,265 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:01:54,266 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 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 56
[2025-02-05 12:01:54,267 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:01:54,277 INFO  L225             Difference]: With dead ends: 1680
[2025-02-05 12:01:54,278 INFO  L226             Difference]: Without dead ends: 1011
[2025-02-05 12:01:54,282 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 12:01:54,284 INFO  L435           NwaCegarLoop]: 167 mSDtfsCounter, 525 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 358 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 1958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 358 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-02-05 12:01:54,284 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 220 Invalid, 1958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [358 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-02-05 12:01:54,297 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1011 states.
[2025-02-05 12:01:54,344 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 996.
[2025-02-05 12:01:54,347 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 996 states, 995 states have (on average 1.735678391959799) internal successors, (1727), 995 states have internal predecessors, (1727), 0 states have call successors, (0), 0 states 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 12:01:54,352 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1727 transitions.
[2025-02-05 12:01:54,354 INFO  L78                 Accepts]: Start accepts. Automaton has 996 states and 1727 transitions. Word has length 56
[2025-02-05 12:01:54,354 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:01:54,354 INFO  L471      AbstractCegarLoop]: Abstraction has 996 states and 1727 transitions.
[2025-02-05 12:01:54,355 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 2 states have internal predecessors, (56), 0 states have call successors, (0), 0 states 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 12:01:54,355 INFO  L276                IsEmpty]: Start isEmpty. Operand 996 states and 1727 transitions.
[2025-02-05 12:01:54,357 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 122
[2025-02-05 12:01:54,357 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:01:54,357 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:01:54,358 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 12:01:54,358 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:01:54,358 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:01:54,358 INFO  L85        PathProgramCache]: Analyzing trace with hash 1006634778, now seen corresponding path program 1 times
[2025-02-05 12:01:54,359 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:01:54,359 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044899759]
[2025-02-05 12:01:54,359 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:01:54,359 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:01:54,375 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes.
[2025-02-05 12:01:54,407 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements.
[2025-02-05 12:01:54,408 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:01:54,408 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:01:54,643 INFO  L134       CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:01:54,643 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:01:54,643 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044899759]
[2025-02-05 12:01:54,644 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044899759] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:01:54,644 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:01:54,644 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 12:01:54,644 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629507019]
[2025-02-05 12:01:54,644 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:01:54,645 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:01:54,645 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:01:54,646 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:01:54,646 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:01:54,646 INFO  L87              Difference]: Start difference. First operand 996 states and 1727 transitions. Second operand  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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 12:01:56,279 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:01:56,280 INFO  L93              Difference]: Finished difference Result 2848 states and 4983 transitions.
[2025-02-05 12:01:56,280 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:01:56,280 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 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 121
[2025-02-05 12:01:56,280 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:01:56,287 INFO  L225             Difference]: With dead ends: 2848
[2025-02-05 12:01:56,287 INFO  L226             Difference]: Without dead ends: 1854
[2025-02-05 12:01:56,289 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 12:01:56,290 INFO  L435           NwaCegarLoop]: 514 mSDtfsCounter, 394 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-02-05 12:01:56,290 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 589 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-02-05 12:01:56,292 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1854 states.
[2025-02-05 12:01:56,373 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1854 to 1854.
[2025-02-05 12:01:56,376 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1854 states, 1853 states have (on average 1.4020507285483002) internal successors, (2598), 1853 states have internal predecessors, (2598), 0 states have call successors, (0), 0 states 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 12:01:56,381 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2598 transitions.
[2025-02-05 12:01:56,381 INFO  L78                 Accepts]: Start accepts. Automaton has 1854 states and 2598 transitions. Word has length 121
[2025-02-05 12:01:56,383 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:01:56,383 INFO  L471      AbstractCegarLoop]: Abstraction has 1854 states and 2598 transitions.
[2025-02-05 12:01:56,383 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states 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 12:01:56,383 INFO  L276                IsEmpty]: Start isEmpty. Operand 1854 states and 2598 transitions.
[2025-02-05 12:01:56,387 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2025-02-05 12:01:56,389 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:01:56,389 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, 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 12:01:56,389 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 12:01:56,390 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:01:56,391 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:01:56,391 INFO  L85        PathProgramCache]: Analyzing trace with hash -315722149, now seen corresponding path program 1 times
[2025-02-05 12:01:56,391 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:01:56,391 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115318975]
[2025-02-05 12:01:56,391 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:01:56,391 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:01:56,414 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes.
[2025-02-05 12:01:56,449 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements.
[2025-02-05 12:01:56,452 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:01:56,453 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:01:56,732 INFO  L134       CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:01:56,732 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:01:56,732 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115318975]
[2025-02-05 12:01:56,732 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115318975] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:01:56,732 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:01:56,732 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:01:56,732 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922084699]
[2025-02-05 12:01:56,732 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:01:56,733 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:01:56,733 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:01:56,733 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:01:56,733 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:01:56,733 INFO  L87              Difference]: Start difference. First operand 1854 states and 2598 transitions. Second operand  has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states 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 12:01:58,761 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:01:58,761 INFO  L93              Difference]: Finished difference Result 5418 states and 7597 transitions.
[2025-02-05 12:01:58,762 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:01:58,762 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 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 126
[2025-02-05 12:01:58,762 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:01:58,770 INFO  L225             Difference]: With dead ends: 5418
[2025-02-05 12:01:58,770 INFO  L226             Difference]: Without dead ends: 2713
[2025-02-05 12:01:58,773 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 12:01:58,773 INFO  L435           NwaCegarLoop]: 806 mSDtfsCounter, 451 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 451 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 1677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 420 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-02-05 12:01:58,774 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [451 Valid, 874 Invalid, 1677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [420 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-02-05 12:01:58,776 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2713 states.
[2025-02-05 12:01:58,809 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2710.
[2025-02-05 12:01:58,812 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2710 states, 2709 states have (on average 1.2694721299372462) internal successors, (3439), 2709 states have internal predecessors, (3439), 0 states have call successors, (0), 0 states 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 12:01:58,818 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2710 states to 2710 states and 3439 transitions.
[2025-02-05 12:01:58,818 INFO  L78                 Accepts]: Start accepts. Automaton has 2710 states and 3439 transitions. Word has length 126
[2025-02-05 12:01:58,818 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:01:58,818 INFO  L471      AbstractCegarLoop]: Abstraction has 2710 states and 3439 transitions.
[2025-02-05 12:01:58,818 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states 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 12:01:58,818 INFO  L276                IsEmpty]: Start isEmpty. Operand 2710 states and 3439 transitions.
[2025-02-05 12:01:58,821 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 209
[2025-02-05 12:01:58,821 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:01:58,821 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:01:58,821 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 12:01:58,821 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:01:58,822 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:01:58,822 INFO  L85        PathProgramCache]: Analyzing trace with hash -1559210344, now seen corresponding path program 1 times
[2025-02-05 12:01:58,822 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:01:58,822 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534224359]
[2025-02-05 12:01:58,822 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:01:58,822 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:01:58,847 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes.
[2025-02-05 12:01:58,868 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements.
[2025-02-05 12:01:58,868 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:01:58,868 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:01:59,080 INFO  L134       CoverageAnalysis]: Checked inductivity of 175 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:01:59,082 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:01:59,082 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534224359]
[2025-02-05 12:01:59,082 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534224359] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:01:59,082 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:01:59,082 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:01:59,083 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498169907]
[2025-02-05 12:01:59,083 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:01:59,083 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:01:59,083 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:01:59,084 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:01:59,084 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:01:59,084 INFO  L87              Difference]: Start difference. First operand 2710 states and 3439 transitions. Second operand  has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 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 12:02:00,410 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:00,411 INFO  L93              Difference]: Finished difference Result 7123 states and 9245 transitions.
[2025-02-05 12:02:00,411 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:02:00,411 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 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 12:02:00,411 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:00,424 INFO  L225             Difference]: With dead ends: 7123
[2025-02-05 12:02:00,425 INFO  L226             Difference]: Without dead ends: 4415
[2025-02-05 12:02:00,428 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 12:02:00,431 INFO  L435           NwaCegarLoop]: 728 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:00,431 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 786 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-05 12:02:00,437 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4415 states.
[2025-02-05 12:02:00,531 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4415 to 4415.
[2025-02-05 12:02:00,536 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4415 states, 4414 states have (on average 1.2417308563661078) internal successors, (5481), 4414 states have internal predecessors, (5481), 0 states have call successors, (0), 0 states 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 12:02:00,542 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4415 states to 4415 states and 5481 transitions.
[2025-02-05 12:02:00,543 INFO  L78                 Accepts]: Start accepts. Automaton has 4415 states and 5481 transitions. Word has length 208
[2025-02-05 12:02:00,543 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:00,543 INFO  L471      AbstractCegarLoop]: Abstraction has 4415 states and 5481 transitions.
[2025-02-05 12:02:00,544 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 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 12:02:00,544 INFO  L276                IsEmpty]: Start isEmpty. Operand 4415 states and 5481 transitions.
[2025-02-05 12:02:00,546 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 286
[2025-02-05 12:02:00,547 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:00,547 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:02:00,548 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 12:02:00,548 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:00,548 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:00,548 INFO  L85        PathProgramCache]: Analyzing trace with hash -62047765, now seen corresponding path program 1 times
[2025-02-05 12:02:00,549 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:00,549 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785733832]
[2025-02-05 12:02:00,549 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:00,549 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:00,576 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes.
[2025-02-05 12:02:00,610 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements.
[2025-02-05 12:02:00,610 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:00,610 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:00,933 INFO  L134       CoverageAnalysis]: Checked inductivity of 372 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked.
[2025-02-05 12:02:00,934 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:00,934 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785733832]
[2025-02-05 12:02:00,935 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785733832] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:02:00,935 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499075873]
[2025-02-05 12:02:00,935 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:00,935 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:02:00,935 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:02:00,939 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 12:02:00,942 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 12:02:00,989 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes.
[2025-02-05 12:02:01,040 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements.
[2025-02-05 12:02:01,040 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:01,040 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:01,043 INFO  L256         TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 4 conjuncts are in the unsatisfiable core
[2025-02-05 12:02:01,049 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 12:02:01,335 INFO  L134       CoverageAnalysis]: Checked inductivity of 372 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked.
[2025-02-05 12:02:01,336 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 12:02:01,620 INFO  L134       CoverageAnalysis]: Checked inductivity of 372 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked.
[2025-02-05 12:02:01,620 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [499075873] provided 1 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:02:01,620 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-02-05 12:02:01,620 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5
[2025-02-05 12:02:01,621 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307792423]
[2025-02-05 12:02:01,621 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:02:01,621 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:02:01,621 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:01,622 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:02:01,622 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 12:02:01,622 INFO  L87              Difference]: Start difference. First operand 4415 states and 5481 transitions. Second operand  has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states 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 12:02:04,260 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:04,261 INFO  L93              Difference]: Finished difference Result 16522 states and 20523 transitions.
[2025-02-05 12:02:04,261 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:02:04,261 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 285
[2025-02-05 12:02:04,262 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:04,287 INFO  L225             Difference]: With dead ends: 16522
[2025-02-05 12:02:04,287 INFO  L226             Difference]: Without dead ends: 11683
[2025-02-05 12:02:04,293 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 571 GetRequests, 567 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 12:02:04,294 INFO  L435           NwaCegarLoop]: 86 mSDtfsCounter, 929 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 2346 mSolverCounterSat, 826 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 3172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 826 IncrementalHoareTripleChecker+Valid, 2346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:04,294 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 189 Invalid, 3172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [826 Valid, 2346 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2025-02-05 12:02:04,303 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 11683 states.
[2025-02-05 12:02:04,497 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 11683 to 11679.
[2025-02-05 12:02:04,525 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 11679 states, 11678 states have (on average 1.1909573557115944) internal successors, (13908), 11678 states have internal predecessors, (13908), 0 states have call successors, (0), 0 states 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 12:02:04,558 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11679 states to 11679 states and 13908 transitions.
[2025-02-05 12:02:04,562 INFO  L78                 Accepts]: Start accepts. Automaton has 11679 states and 13908 transitions. Word has length 285
[2025-02-05 12:02:04,562 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:04,562 INFO  L471      AbstractCegarLoop]: Abstraction has 11679 states and 13908 transitions.
[2025-02-05 12:02:04,563 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states 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 12:02:04,563 INFO  L276                IsEmpty]: Start isEmpty. Operand 11679 states and 13908 transitions.
[2025-02-05 12:02:04,572 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 289
[2025-02-05 12:02:04,572 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:04,573 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:02:04,614 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 12:02:04,773 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:02:04,774 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:04,775 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:04,775 INFO  L85        PathProgramCache]: Analyzing trace with hash -196498666, now seen corresponding path program 1 times
[2025-02-05 12:02:04,775 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:04,775 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348179163]
[2025-02-05 12:02:04,775 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:04,775 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:04,814 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 288 statements into 1 equivalence classes.
[2025-02-05 12:02:04,854 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 288 of 288 statements.
[2025-02-05 12:02:04,857 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:04,857 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:05,093 INFO  L134       CoverageAnalysis]: Checked inductivity of 375 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked.
[2025-02-05 12:02:05,093 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:05,093 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348179163]
[2025-02-05 12:02:05,093 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348179163] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:02:05,093 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:02:05,094 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:02:05,094 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592730762]
[2025-02-05 12:02:05,094 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:02:05,094 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:02:05,094 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:05,095 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:02:05,095 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:05,095 INFO  L87              Difference]: Start difference. First operand 11679 states and 13908 transitions. Second operand  has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 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 12:02:06,752 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:06,753 INFO  L93              Difference]: Finished difference Result 30622 states and 36789 transitions.
[2025-02-05 12:02:06,753 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:02:06,753 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 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 288
[2025-02-05 12:02:06,754 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:06,787 INFO  L225             Difference]: With dead ends: 30622
[2025-02-05 12:02:06,788 INFO  L226             Difference]: Without dead ends: 16787
[2025-02-05 12:02:06,800 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 12:02:06,800 INFO  L435           NwaCegarLoop]: 667 mSDtfsCounter, 481 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:06,801 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 712 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-02-05 12:02:06,812 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16787 states.
[2025-02-05 12:02:07,038 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16787 to 16779.
[2025-02-05 12:02:07,061 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 16779 states, 16778 states have (on average 1.1798188103468827) internal successors, (19795), 16778 states have internal predecessors, (19795), 0 states have call successors, (0), 0 states 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 12:02:07,086 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16779 states to 16779 states and 19795 transitions.
[2025-02-05 12:02:07,086 INFO  L78                 Accepts]: Start accepts. Automaton has 16779 states and 19795 transitions. Word has length 288
[2025-02-05 12:02:07,087 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:07,087 INFO  L471      AbstractCegarLoop]: Abstraction has 16779 states and 19795 transitions.
[2025-02-05 12:02:07,087 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 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 12:02:07,087 INFO  L276                IsEmpty]: Start isEmpty. Operand 16779 states and 19795 transitions.
[2025-02-05 12:02:07,091 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 312
[2025-02-05 12:02:07,091 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:07,092 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 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 12:02:07,092 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 12:02:07,092 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:07,092 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:07,093 INFO  L85        PathProgramCache]: Analyzing trace with hash 1451860945, now seen corresponding path program 1 times
[2025-02-05 12:02:07,093 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:07,093 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433200649]
[2025-02-05 12:02:07,093 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:07,093 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:07,115 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes.
[2025-02-05 12:02:07,134 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements.
[2025-02-05 12:02:07,134 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:07,134 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:07,350 INFO  L134       CoverageAnalysis]: Checked inductivity of 376 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked.
[2025-02-05 12:02:07,350 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:07,350 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433200649]
[2025-02-05 12:02:07,350 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433200649] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:02:07,350 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:02:07,350 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:02:07,351 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506617041]
[2025-02-05 12:02:07,351 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:02:07,351 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:02:07,351 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:07,352 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:02:07,352 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:07,355 INFO  L87              Difference]: Start difference. First operand 16779 states and 19795 transitions. Second operand  has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states 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 12:02:08,944 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:08,945 INFO  L93              Difference]: Finished difference Result 43357 states and 51236 transitions.
[2025-02-05 12:02:08,945 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:02:08,946 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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 311
[2025-02-05 12:02:08,947 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:08,996 INFO  L225             Difference]: With dead ends: 43357
[2025-02-05 12:02:08,997 INFO  L226             Difference]: Without dead ends: 26580
[2025-02-05 12:02:09,010 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 12:02:09,012 INFO  L435           NwaCegarLoop]: 245 mSDtfsCounter, 439 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1244 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 1467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 1244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:09,013 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 290 Invalid, 1467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 1244 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-05 12:02:09,037 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26580 states.
[2025-02-05 12:02:09,267 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26580 to 24861.
[2025-02-05 12:02:09,302 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 24861 states, 24860 states have (on average 1.1731295253419147) internal successors, (29164), 24860 states have internal predecessors, (29164), 0 states have call successors, (0), 0 states 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 12:02:09,330 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24861 states to 24861 states and 29164 transitions.
[2025-02-05 12:02:09,331 INFO  L78                 Accepts]: Start accepts. Automaton has 24861 states and 29164 transitions. Word has length 311
[2025-02-05 12:02:09,331 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:09,331 INFO  L471      AbstractCegarLoop]: Abstraction has 24861 states and 29164 transitions.
[2025-02-05 12:02:09,332 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states 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 12:02:09,332 INFO  L276                IsEmpty]: Start isEmpty. Operand 24861 states and 29164 transitions.
[2025-02-05 12:02:09,335 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 317
[2025-02-05 12:02:09,335 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:09,335 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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]
[2025-02-05 12:02:09,335 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 12:02:09,336 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:09,336 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:09,336 INFO  L85        PathProgramCache]: Analyzing trace with hash -2144384006, now seen corresponding path program 1 times
[2025-02-05 12:02:09,336 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:09,337 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038243694]
[2025-02-05 12:02:09,337 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:09,337 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:09,358 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes.
[2025-02-05 12:02:09,377 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements.
[2025-02-05 12:02:09,377 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:09,377 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:09,823 INFO  L134       CoverageAnalysis]: Checked inductivity of 386 backedges. 314 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:02:09,823 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:09,824 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038243694]
[2025-02-05 12:02:09,824 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038243694] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:02:09,824 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183703638]
[2025-02-05 12:02:09,824 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:09,824 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:02:09,824 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:02:09,828 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 12:02:09,829 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 12:02:09,892 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 316 statements into 1 equivalence classes.
[2025-02-05 12:02:09,939 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 316 of 316 statements.
[2025-02-05 12:02:09,940 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:09,940 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:09,942 INFO  L256         TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 5 conjuncts are in the unsatisfiable core
[2025-02-05 12:02:09,952 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 12:02:10,397 INFO  L134       CoverageAnalysis]: Checked inductivity of 386 backedges. 250 proven. 82 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked.
[2025-02-05 12:02:10,398 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 12:02:11,430 INFO  L134       CoverageAnalysis]: Checked inductivity of 386 backedges. 250 proven. 82 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked.
[2025-02-05 12:02:11,433 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [183703638] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-05 12:02:11,433 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-05 12:02:11,433 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9
[2025-02-05 12:02:11,433 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459633445]
[2025-02-05 12:02:11,433 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-05 12:02:11,435 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-02-05 12:02:11,435 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:11,435 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-02-05 12:02:11,435 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2025-02-05 12:02:11,436 INFO  L87              Difference]: Start difference. First operand 24861 states and 29164 transitions. Second operand  has 9 states, 9 states have (on average 85.22222222222223) internal successors, (767), 9 states have internal predecessors, (767), 0 states have call successors, (0), 0 states 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 12:02:22,739 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:22,739 INFO  L93              Difference]: Finished difference Result 117539 states and 135783 transitions.
[2025-02-05 12:02:22,739 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2025-02-05 12:02:22,740 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 85.22222222222223) internal successors, (767), 9 states have internal predecessors, (767), 0 states have call successors, (0), 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 316
[2025-02-05 12:02:22,741 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:22,989 INFO  L225             Difference]: With dead ends: 117539
[2025-02-05 12:02:22,989 INFO  L226             Difference]: Without dead ends: 87576
[2025-02-05 12:02:23,017 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 661 GetRequests, 641 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462
[2025-02-05 12:02:23,018 INFO  L435           NwaCegarLoop]: 132 mSDtfsCounter, 8788 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 13790 mSolverCounterSat, 2440 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8788 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 16230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2440 IncrementalHoareTripleChecker+Valid, 13790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:23,018 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [8788 Valid, 653 Invalid, 16230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2440 Valid, 13790 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time]
[2025-02-05 12:02:23,086 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 87576 states.
[2025-02-05 12:02:24,050 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 87576 to 81513.
[2025-02-05 12:02:24,121 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 81513 states, 81512 states have (on average 1.137660712533124) internal successors, (92733), 81512 states have internal predecessors, (92733), 0 states have call successors, (0), 0 states 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 12:02:24,226 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 81513 states to 81513 states and 92733 transitions.
[2025-02-05 12:02:24,226 INFO  L78                 Accepts]: Start accepts. Automaton has 81513 states and 92733 transitions. Word has length 316
[2025-02-05 12:02:24,228 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:24,228 INFO  L471      AbstractCegarLoop]: Abstraction has 81513 states and 92733 transitions.
[2025-02-05 12:02:24,228 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 85.22222222222223) internal successors, (767), 9 states have internal predecessors, (767), 0 states have call successors, (0), 0 states 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 12:02:24,228 INFO  L276                IsEmpty]: Start isEmpty. Operand 81513 states and 92733 transitions.
[2025-02-05 12:02:24,234 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 399
[2025-02-05 12:02:24,234 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:24,235 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:02:24,241 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 12:02:24,439 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 12:02:24,440 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:24,441 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:24,441 INFO  L85        PathProgramCache]: Analyzing trace with hash 603609811, now seen corresponding path program 1 times
[2025-02-05 12:02:24,442 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:24,442 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190611590]
[2025-02-05 12:02:24,442 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:24,442 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:24,468 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 398 statements into 1 equivalence classes.
[2025-02-05 12:02:24,489 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 398 of 398 statements.
[2025-02-05 12:02:24,489 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:24,489 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:25,269 INFO  L134       CoverageAnalysis]: Checked inductivity of 675 backedges. 541 proven. 80 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked.
[2025-02-05 12:02:25,269 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:25,269 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190611590]
[2025-02-05 12:02:25,269 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190611590] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:02:25,269 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569607723]
[2025-02-05 12:02:25,270 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:25,270 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:02:25,270 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:02:25,271 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 12:02:25,273 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 12:02:25,318 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 398 statements into 1 equivalence classes.
[2025-02-05 12:02:25,373 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 398 of 398 statements.
[2025-02-05 12:02:25,373 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:25,373 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:25,374 INFO  L256         TraceCheckSpWp]: Trace formula consists of 543 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-02-05 12:02:25,377 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 12:02:25,662 INFO  L134       CoverageAnalysis]: Checked inductivity of 675 backedges. 621 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked.
[2025-02-05 12:02:25,663 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 12:02:25,663 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569607723] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:02:25,663 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 12:02:25,663 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8
[2025-02-05 12:02:25,663 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181738138]
[2025-02-05 12:02:25,663 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:02:25,664 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:02:25,664 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:25,664 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:02:25,664 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2025-02-05 12:02:25,665 INFO  L87              Difference]: Start difference. First operand 81513 states and 92733 transitions. Second operand  has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 states 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 12:02:27,695 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:27,695 INFO  L93              Difference]: Finished difference Result 165574 states and 188131 transitions.
[2025-02-05 12:02:27,696 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:02:27,696 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 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 398
[2025-02-05 12:02:27,696 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:27,793 INFO  L225             Difference]: With dead ends: 165574
[2025-02-05 12:02:27,793 INFO  L226             Difference]: Without dead ends: 84063
[2025-02-05 12:02:27,844 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 397 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2025-02-05 12:02:27,844 INFO  L435           NwaCegarLoop]: 254 mSDtfsCounter, 814 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 2150 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 2392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 2150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:27,844 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 363 Invalid, 2392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 2150 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-02-05 12:02:27,907 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 84063 states.
[2025-02-05 12:02:28,772 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 84063 to 83213.
[2025-02-05 12:02:29,033 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 83213 states, 83212 states have (on average 1.1353290390809019) internal successors, (94473), 83212 states have internal predecessors, (94473), 0 states have call successors, (0), 0 states 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 12:02:29,156 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 83213 states to 83213 states and 94473 transitions.
[2025-02-05 12:02:29,157 INFO  L78                 Accepts]: Start accepts. Automaton has 83213 states and 94473 transitions. Word has length 398
[2025-02-05 12:02:29,157 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:29,157 INFO  L471      AbstractCegarLoop]: Abstraction has 83213 states and 94473 transitions.
[2025-02-05 12:02:29,157 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 86.25) internal successors, (345), 4 states have internal predecessors, (345), 0 states have call successors, (0), 0 states 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 12:02:29,158 INFO  L276                IsEmpty]: Start isEmpty. Operand 83213 states and 94473 transitions.
[2025-02-05 12:02:29,304 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 558
[2025-02-05 12:02:29,304 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:29,305 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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]
[2025-02-05 12:02:29,315 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-02-05 12:02:29,506 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:02:29,506 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:29,507 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:29,507 INFO  L85        PathProgramCache]: Analyzing trace with hash 1762063982, now seen corresponding path program 1 times
[2025-02-05 12:02:29,507 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:29,507 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230726525]
[2025-02-05 12:02:29,507 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:29,507 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:29,557 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes.
[2025-02-05 12:02:29,593 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements.
[2025-02-05 12:02:29,594 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:29,594 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:29,985 INFO  L134       CoverageAnalysis]: Checked inductivity of 1068 backedges. 823 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked.
[2025-02-05 12:02:29,985 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:29,985 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230726525]
[2025-02-05 12:02:29,985 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230726525] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:02:29,985 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:02:29,986 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 12:02:29,986 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16327319]
[2025-02-05 12:02:29,986 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:02:29,986 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:02:29,986 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:29,987 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:02:29,987 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:02:29,987 INFO  L87              Difference]: Start difference. First operand 83213 states and 94473 transitions. Second operand  has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states 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 12:02:32,783 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:32,784 INFO  L93              Difference]: Finished difference Result 223526 states and 251999 transitions.
[2025-02-05 12:02:32,784 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:02:32,784 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 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 557
[2025-02-05 12:02:32,785 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:32,939 INFO  L225             Difference]: With dead ends: 223526
[2025-02-05 12:02:32,939 INFO  L226             Difference]: Without dead ends: 140315
[2025-02-05 12:02:33,005 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:02:33,006 INFO  L435           NwaCegarLoop]: 88 mSDtfsCounter, 799 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 2489 mSolverCounterSat, 447 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 2936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 447 IncrementalHoareTripleChecker+Valid, 2489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:33,007 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 191 Invalid, 2936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [447 Valid, 2489 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2025-02-05 12:02:33,304 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 140315 states.
[2025-02-05 12:02:34,568 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 140315 to 119021.
[2025-02-05 12:02:34,800 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 119021 states, 119020 states have (on average 1.1265249537892792) internal successors, (134079), 119020 states have internal predecessors, (134079), 0 states have call successors, (0), 0 states 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 12:02:34,902 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 119021 states to 119021 states and 134079 transitions.
[2025-02-05 12:02:34,903 INFO  L78                 Accepts]: Start accepts. Automaton has 119021 states and 134079 transitions. Word has length 557
[2025-02-05 12:02:34,904 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:34,904 INFO  L471      AbstractCegarLoop]: Abstraction has 119021 states and 134079 transitions.
[2025-02-05 12:02:34,904 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states 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 12:02:34,904 INFO  L276                IsEmpty]: Start isEmpty. Operand 119021 states and 134079 transitions.
[2025-02-05 12:02:34,914 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 560
[2025-02-05 12:02:34,914 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:34,915 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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]
[2025-02-05 12:02:34,915 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 12:02:34,915 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:34,916 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:34,916 INFO  L85        PathProgramCache]: Analyzing trace with hash -834167969, now seen corresponding path program 1 times
[2025-02-05 12:02:34,916 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:34,916 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114419152]
[2025-02-05 12:02:34,916 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:34,916 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:34,965 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 559 statements into 1 equivalence classes.
[2025-02-05 12:02:34,988 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 559 of 559 statements.
[2025-02-05 12:02:34,988 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:34,988 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:35,295 INFO  L134       CoverageAnalysis]: Checked inductivity of 1061 backedges. 800 proven. 0 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked.
[2025-02-05 12:02:35,295 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:35,295 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114419152]
[2025-02-05 12:02:35,295 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114419152] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:02:35,295 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:02:35,295 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:02:35,295 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774166655]
[2025-02-05 12:02:35,295 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:02:35,296 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:02:35,296 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:35,296 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:02:35,296 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:35,296 INFO  L87              Difference]: Start difference. First operand 119021 states and 134079 transitions. Second operand  has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states 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 12:02:37,036 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:37,037 INFO  L93              Difference]: Finished difference Result 266133 states and 300429 transitions.
[2025-02-05 12:02:37,037 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:02:37,037 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 559
[2025-02-05 12:02:37,037 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:37,202 INFO  L225             Difference]: With dead ends: 266133
[2025-02-05 12:02:37,202 INFO  L226             Difference]: Without dead ends: 147114
[2025-02-05 12:02:37,276 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 12:02:37,277 INFO  L435           NwaCegarLoop]: 310 mSDtfsCounter, 321 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:37,277 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 367 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-02-05 12:02:37,397 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 147114 states.
[2025-02-05 12:02:38,917 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 147114 to 139428.
[2025-02-05 12:02:39,016 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 139428 states, 139427 states have (on average 1.1092112718483507) internal successors, (154654), 139427 states have internal predecessors, (154654), 0 states have call successors, (0), 0 states 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 12:02:39,566 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 139428 states to 139428 states and 154654 transitions.
[2025-02-05 12:02:39,567 INFO  L78                 Accepts]: Start accepts. Automaton has 139428 states and 154654 transitions. Word has length 559
[2025-02-05 12:02:39,568 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:39,568 INFO  L471      AbstractCegarLoop]: Abstraction has 139428 states and 154654 transitions.
[2025-02-05 12:02:39,568 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states 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 12:02:39,568 INFO  L276                IsEmpty]: Start isEmpty. Operand 139428 states and 154654 transitions.
[2025-02-05 12:02:39,577 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 585
[2025-02-05 12:02:39,577 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:39,578 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-02-05 12:02:39,578 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 12:02:39,578 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:39,578 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:39,578 INFO  L85        PathProgramCache]: Analyzing trace with hash -2087973626, now seen corresponding path program 1 times
[2025-02-05 12:02:39,578 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:39,578 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027389019]
[2025-02-05 12:02:39,579 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:39,579 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:39,616 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 584 statements into 1 equivalence classes.
[2025-02-05 12:02:39,636 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 584 of 584 statements.
[2025-02-05 12:02:39,636 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:39,636 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:40,030 INFO  L134       CoverageAnalysis]: Checked inductivity of 1143 backedges. 631 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked.
[2025-02-05 12:02:40,031 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:40,031 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027389019]
[2025-02-05 12:02:40,031 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027389019] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:02:40,031 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:02:40,031 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:02:40,031 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354598887]
[2025-02-05 12:02:40,031 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:02:40,032 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:02:40,032 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:40,032 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:02:40,032 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:40,032 INFO  L87              Difference]: Start difference. First operand 139428 states and 154654 transitions. Second operand  has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states 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 12:02:41,844 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:41,845 INFO  L93              Difference]: Finished difference Result 287364 states and 318316 transitions.
[2025-02-05 12:02:41,845 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:02:41,845 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 584
[2025-02-05 12:02:41,846 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:42,013 INFO  L225             Difference]: With dead ends: 287364
[2025-02-05 12:02:42,014 INFO  L226             Difference]: Without dead ends: 147513
[2025-02-05 12:02:42,060 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 12:02:42,061 INFO  L435           NwaCegarLoop]: 317 mSDtfsCounter, 358 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:42,062 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 366 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-05 12:02:42,152 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 147513 states.
[2025-02-05 12:02:43,824 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 147513 to 141518.
[2025-02-05 12:02:43,905 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 141518 states, 141517 states have (on average 1.1008218093939244) internal successors, (155785), 141517 states have internal predecessors, (155785), 0 states have call successors, (0), 0 states 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 12:02:44,058 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 141518 states to 141518 states and 155785 transitions.
[2025-02-05 12:02:44,060 INFO  L78                 Accepts]: Start accepts. Automaton has 141518 states and 155785 transitions. Word has length 584
[2025-02-05 12:02:44,061 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:44,061 INFO  L471      AbstractCegarLoop]: Abstraction has 141518 states and 155785 transitions.
[2025-02-05 12:02:44,061 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states 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 12:02:44,061 INFO  L276                IsEmpty]: Start isEmpty. Operand 141518 states and 155785 transitions.
[2025-02-05 12:02:44,070 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 597
[2025-02-05 12:02:44,071 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:44,071 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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]
[2025-02-05 12:02:44,075 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 12:02:44,075 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:44,075 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:44,075 INFO  L85        PathProgramCache]: Analyzing trace with hash -1663344371, now seen corresponding path program 1 times
[2025-02-05 12:02:44,075 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:44,075 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484770913]
[2025-02-05 12:02:44,075 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:44,075 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:44,105 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes.
[2025-02-05 12:02:44,122 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements.
[2025-02-05 12:02:44,122 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:44,122 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:44,289 INFO  L134       CoverageAnalysis]: Checked inductivity of 1464 backedges. 944 proven. 0 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked.
[2025-02-05 12:02:44,289 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:44,289 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484770913]
[2025-02-05 12:02:44,289 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484770913] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:02:44,289 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:02:44,290 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:02:44,291 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287371277]
[2025-02-05 12:02:44,291 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:02:44,291 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:02:44,291 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:44,292 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:02:44,292 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:44,292 INFO  L87              Difference]: Start difference. First operand 141518 states and 155785 transitions. Second operand  has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states 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 12:02:46,269 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:46,269 INFO  L93              Difference]: Finished difference Result 297537 states and 326816 transitions.
[2025-02-05 12:02:46,269 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:02:46,269 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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 596
[2025-02-05 12:02:46,270 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:46,724 INFO  L225             Difference]: With dead ends: 297537
[2025-02-05 12:02:46,724 INFO  L226             Difference]: Without dead ends: 156021
[2025-02-05 12:02:46,759 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 12:02:46,761 INFO  L435           NwaCegarLoop]: 768 mSDtfsCounter, 324 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 1310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:46,761 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 834 Invalid, 1310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-02-05 12:02:46,850 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 156021 states.
[2025-02-05 12:02:48,185 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 156021 to 150055.
[2025-02-05 12:02:48,295 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 150055 states, 150054 states have (on average 1.093126474469191) internal successors, (164028), 150054 states have internal predecessors, (164028), 0 states have call successors, (0), 0 states 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 12:02:48,492 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 150055 states to 150055 states and 164028 transitions.
[2025-02-05 12:02:48,494 INFO  L78                 Accepts]: Start accepts. Automaton has 150055 states and 164028 transitions. Word has length 596
[2025-02-05 12:02:48,495 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:48,495 INFO  L471      AbstractCegarLoop]: Abstraction has 150055 states and 164028 transitions.
[2025-02-05 12:02:48,495 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 0 states 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 12:02:48,495 INFO  L276                IsEmpty]: Start isEmpty. Operand 150055 states and 164028 transitions.
[2025-02-05 12:02:48,510 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 619
[2025-02-05 12:02:48,511 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:48,512 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:02:48,512 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 12:02:48,512 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:48,512 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:48,513 INFO  L85        PathProgramCache]: Analyzing trace with hash -1687465950, now seen corresponding path program 1 times
[2025-02-05 12:02:48,513 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:48,513 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105751577]
[2025-02-05 12:02:48,513 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:48,513 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:48,822 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 618 statements into 1 equivalence classes.
[2025-02-05 12:02:48,845 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 618 of 618 statements.
[2025-02-05 12:02:48,846 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:48,846 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:49,052 INFO  L134       CoverageAnalysis]: Checked inductivity of 660 backedges. 415 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked.
[2025-02-05 12:02:49,052 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:49,052 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105751577]
[2025-02-05 12:02:49,052 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105751577] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:02:49,052 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:02:49,052 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:02:49,052 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777597938]
[2025-02-05 12:02:49,053 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:02:49,053 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:02:49,053 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:49,053 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:02:49,053 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:49,054 INFO  L87              Difference]: Start difference. First operand 150055 states and 164028 transitions. Second operand  has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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 12:02:51,005 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:51,006 INFO  L93              Difference]: Finished difference Result 311617 states and 340922 transitions.
[2025-02-05 12:02:51,006 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:02:51,006 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 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 618
[2025-02-05 12:02:51,006 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:51,190 INFO  L225             Difference]: With dead ends: 311617
[2025-02-05 12:02:51,191 INFO  L226             Difference]: Without dead ends: 161564
[2025-02-05 12:02:51,276 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 12:02:51,277 INFO  L435           NwaCegarLoop]: 190 mSDtfsCounter, 453 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1205 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 1205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:51,277 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 232 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 1205 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-02-05 12:02:51,383 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 161564 states.
[2025-02-05 12:02:52,885 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 161564 to 150486.
[2025-02-05 12:02:52,966 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 150486 states, 150485 states have (on average 1.0937767883842244) internal successors, (164597), 150485 states have internal predecessors, (164597), 0 states have call successors, (0), 0 states 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 12:02:53,168 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 150486 states to 150486 states and 164597 transitions.
[2025-02-05 12:02:53,170 INFO  L78                 Accepts]: Start accepts. Automaton has 150486 states and 164597 transitions. Word has length 618
[2025-02-05 12:02:53,171 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:53,171 INFO  L471      AbstractCegarLoop]: Abstraction has 150486 states and 164597 transitions.
[2025-02-05 12:02:53,171 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states 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 12:02:53,171 INFO  L276                IsEmpty]: Start isEmpty. Operand 150486 states and 164597 transitions.
[2025-02-05 12:02:53,187 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 624
[2025-02-05 12:02:53,188 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:53,188 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:02:53,188 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 12:02:53,188 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:53,189 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:53,189 INFO  L85        PathProgramCache]: Analyzing trace with hash 751785826, now seen corresponding path program 1 times
[2025-02-05 12:02:53,189 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:53,190 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306486808]
[2025-02-05 12:02:53,190 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:53,190 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:53,260 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes.
[2025-02-05 12:02:53,296 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements.
[2025-02-05 12:02:53,297 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:53,297 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:53,566 INFO  L134       CoverageAnalysis]: Checked inductivity of 406 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked.
[2025-02-05 12:02:53,567 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:53,567 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306486808]
[2025-02-05 12:02:53,567 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306486808] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:02:53,567 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:02:53,567 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 12:02:53,567 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685411082]
[2025-02-05 12:02:53,567 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:02:53,568 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:02:53,568 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:53,568 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:02:53,568 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:02:53,569 INFO  L87              Difference]: Start difference. First operand 150486 states and 164597 transitions. Second operand  has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 2 states have internal predecessors, (461), 0 states have call successors, (0), 0 states 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 12:02:55,079 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:02:55,079 INFO  L93              Difference]: Finished difference Result 292437 states and 318993 transitions.
[2025-02-05 12:02:55,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:02:55,080 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 2 states have internal predecessors, (461), 0 states have call successors, (0), 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 623
[2025-02-05 12:02:55,080 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:02:55,247 INFO  L225             Difference]: With dead ends: 292437
[2025-02-05 12:02:55,247 INFO  L226             Difference]: Without dead ends: 141951
[2025-02-05 12:02:55,324 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 12:02:55,325 INFO  L435           NwaCegarLoop]: 109 mSDtfsCounter, 362 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 12:02:55,326 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 109 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 12:02:55,418 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 141951 states.
[2025-02-05 12:02:56,651 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 141951 to 141934.
[2025-02-05 12:02:56,749 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 141934 states, 141933 states have (on average 1.0873792564097144) internal successors, (154335), 141933 states have internal predecessors, (154335), 0 states have call successors, (0), 0 states 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 12:02:57,219 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 141934 states to 141934 states and 154335 transitions.
[2025-02-05 12:02:57,221 INFO  L78                 Accepts]: Start accepts. Automaton has 141934 states and 154335 transitions. Word has length 623
[2025-02-05 12:02:57,222 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:02:57,222 INFO  L471      AbstractCegarLoop]: Abstraction has 141934 states and 154335 transitions.
[2025-02-05 12:02:57,222 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 2 states have internal predecessors, (461), 0 states have call successors, (0), 0 states 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 12:02:57,222 INFO  L276                IsEmpty]: Start isEmpty. Operand 141934 states and 154335 transitions.
[2025-02-05 12:02:57,232 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 624
[2025-02-05 12:02:57,232 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:02:57,232 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:02:57,232 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 12:02:57,232 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:02:57,233 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:02:57,233 INFO  L85        PathProgramCache]: Analyzing trace with hash 733063753, now seen corresponding path program 1 times
[2025-02-05 12:02:57,233 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:02:57,233 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994475022]
[2025-02-05 12:02:57,236 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:57,237 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:02:57,283 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes.
[2025-02-05 12:02:57,320 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements.
[2025-02-05 12:02:57,320 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:57,320 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:57,857 INFO  L134       CoverageAnalysis]: Checked inductivity of 675 backedges. 522 proven. 72 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked.
[2025-02-05 12:02:57,858 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:02:57,858 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994475022]
[2025-02-05 12:02:57,858 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994475022] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:02:57,858 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726656564]
[2025-02-05 12:02:57,858 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:02:57,858 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:02:57,858 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:02:57,860 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 12:02:57,864 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 12:02:57,944 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes.
[2025-02-05 12:02:58,041 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements.
[2025-02-05 12:02:58,041 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:02:58,041 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:02:58,043 INFO  L256         TraceCheckSpWp]: Trace formula consists of 778 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-02-05 12:02:58,049 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 12:02:58,300 INFO  L134       CoverageAnalysis]: Checked inductivity of 675 backedges. 376 proven. 54 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked.
[2025-02-05 12:02:58,300 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 12:02:58,465 INFO  L134       CoverageAnalysis]: Checked inductivity of 675 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked.
[2025-02-05 12:02:58,465 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [726656564] provided 1 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:02:58,465 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-02-05 12:02:58,465 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 8
[2025-02-05 12:02:58,466 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472776910]
[2025-02-05 12:02:58,466 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:02:58,466 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:02:58,467 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:02:58,467 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:02:58,467 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2025-02-05 12:02:58,468 INFO  L87              Difference]: Start difference. First operand 141934 states and 154335 transitions. Second operand  has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states 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 12:03:01,618 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:03:01,618 INFO  L93              Difference]: Finished difference Result 302595 states and 328735 transitions.
[2025-02-05 12:03:01,619 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:03:01,619 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 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 623
[2025-02-05 12:03:01,619 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:03:01,781 INFO  L225             Difference]: With dead ends: 302595
[2025-02-05 12:03:01,781 INFO  L226             Difference]: Without dead ends: 156820
[2025-02-05 12:03:01,836 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1249 GetRequests, 1242 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2025-02-05 12:03:01,837 INFO  L435           NwaCegarLoop]: 110 mSDtfsCounter, 880 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 2137 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 2620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 2137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2025-02-05 12:03:01,837 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [880 Valid, 164 Invalid, 2620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 2137 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2025-02-05 12:03:01,937 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 156820 states.
[2025-02-05 12:03:03,193 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 156820 to 145310.
[2025-02-05 12:03:03,289 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 145310 states, 145309 states have (on average 1.0829404923301378) internal successors, (157361), 145309 states have internal predecessors, (157361), 0 states have call successors, (0), 0 states 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 12:03:03,423 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 145310 states to 145310 states and 157361 transitions.
[2025-02-05 12:03:03,425 INFO  L78                 Accepts]: Start accepts. Automaton has 145310 states and 157361 transitions. Word has length 623
[2025-02-05 12:03:03,425 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:03:03,425 INFO  L471      AbstractCegarLoop]: Abstraction has 145310 states and 157361 transitions.
[2025-02-05 12:03:03,425 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states 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 12:03:03,425 INFO  L276                IsEmpty]: Start isEmpty. Operand 145310 states and 157361 transitions.
[2025-02-05 12:03:03,434 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 641
[2025-02-05 12:03:03,434 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:03:03,434 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:03:03,440 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2025-02-05 12:03:03,639 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,SelfDestructingSolverStorable15
[2025-02-05 12:03:03,639 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:03:03,639 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:03:03,639 INFO  L85        PathProgramCache]: Analyzing trace with hash -946298231, now seen corresponding path program 1 times
[2025-02-05 12:03:03,639 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:03:03,640 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028011628]
[2025-02-05 12:03:03,640 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:03:03,640 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:03:04,202 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 640 statements into 1 equivalence classes.
[2025-02-05 12:03:04,226 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 640 of 640 statements.
[2025-02-05 12:03:04,226 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:03:04,226 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:03:04,592 INFO  L134       CoverageAnalysis]: Checked inductivity of 713 backedges. 543 proven. 89 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked.
[2025-02-05 12:03:04,592 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:03:04,592 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028011628]
[2025-02-05 12:03:04,592 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028011628] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:03:04,592 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873174681]
[2025-02-05 12:03:04,592 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:03:04,592 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:03:04,592 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:03:04,594 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 12:03:04,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 12:03:04,717 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 640 statements into 1 equivalence classes.
[2025-02-05 12:03:04,869 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 640 of 640 statements.
[2025-02-05 12:03:04,870 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:03:04,870 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:03:04,872 INFO  L256         TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-02-05 12:03:04,884 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 12:03:05,363 INFO  L134       CoverageAnalysis]: Checked inductivity of 713 backedges. 414 proven. 54 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked.
[2025-02-05 12:03:05,363 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 12:03:05,527 INFO  L134       CoverageAnalysis]: Checked inductivity of 713 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked.
[2025-02-05 12:03:05,528 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873174681] provided 1 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:03:05,528 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2025-02-05 12:03:05,528 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 8
[2025-02-05 12:03:05,528 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560829306]
[2025-02-05 12:03:05,528 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:03:05,528 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:03:05,528 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:03:05,529 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:03:05,529 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2025-02-05 12:03:05,529 INFO  L87              Difference]: Start difference. First operand 145310 states and 157361 transitions. Second operand  has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states 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 12:03:07,898 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:03:07,899 INFO  L93              Difference]: Finished difference Result 147880 states and 159977 transitions.
[2025-02-05 12:03:07,899 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:03:07,899 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 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 640
[2025-02-05 12:03:07,900 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:03:08,044 INFO  L225             Difference]: With dead ends: 147880
[2025-02-05 12:03:08,044 INFO  L226             Difference]: Without dead ends: 147453
[2025-02-05 12:03:08,078 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1283 GetRequests, 1276 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56
[2025-02-05 12:03:08,079 INFO  L435           NwaCegarLoop]: 103 mSDtfsCounter, 975 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 2068 mSolverCounterSat, 685 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 2753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 685 IncrementalHoareTripleChecker+Valid, 2068 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-02-05 12:03:08,080 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [975 Valid, 145 Invalid, 2753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [685 Valid, 2068 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-02-05 12:03:08,176 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 147453 states.