./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-92.i --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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-92.i -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 d7c6ee6eb0f585efaab30d46a49b7995a5952ad7cab5794b55d5ffb7d0a6deb0
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 21:41:38,992 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 21:41:39,062 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-05 21:41:39,069 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 21:41:39,072 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 21:41:39,100 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 21:41:39,101 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 21:41:39,101 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 21:41:39,101 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 21:41:39,101 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 21:41:39,101 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 21:41:39,102 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 21:41:39,102 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 21:41:39,102 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 21:41:39,102 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 21:41:39,102 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 21:41:39,102 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 21:41:39,102 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 21:41:39,102 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 21:41:39,102 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 21:41:39,102 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 21:41:39,102 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 21:41:39,102 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 21:41:39,102 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 21:41:39,102 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 21:41:39,102 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 21:41:39,102 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 21:41:39,102 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 21:41:39,102 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 21:41:39,102 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 21:41:39,103 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 21:41:39,103 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 21:41:39,103 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 21:41:39,103 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 21:41:39,103 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 21:41:39,103 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 21:41:39,103 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 21:41:39,103 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 21:41:39,103 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 21:41:39,103 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 21:41:39,103 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 21:41:39,103 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 21:41:39,103 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 21:41:39,103 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 -> d7c6ee6eb0f585efaab30d46a49b7995a5952ad7cab5794b55d5ffb7d0a6deb0
[2025-02-05 21:41:39,376 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 21:41:39,385 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 21:41:39,387 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 21:41:39,388 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 21:41:39,389 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 21:41:39,390 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-92.i
[2025-02-05 21:41:40,674 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ad102e47/1321e3cfa86b4608b4e86c2a8f6e8b14/FLAG110e012d0
[2025-02-05 21:41:40,918 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 21:41:40,919 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-92.i
[2025-02-05 21:41:40,927 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ad102e47/1321e3cfa86b4608b4e86c2a8f6e8b14/FLAG110e012d0
[2025-02-05 21:41:41,260 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ad102e47/1321e3cfa86b4608b4e86c2a8f6e8b14
[2025-02-05 21:41:41,262 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 21:41:41,264 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 21:41:41,270 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 21:41:41,270 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 21:41:41,274 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 21:41:41,277 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:41:41" (1/1) ...
[2025-02-05 21:41:41,278 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@268c281a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:41, skipping insertion in model container
[2025-02-05 21:41:41,279 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:41:41" (1/1) ...
[2025-02-05 21:41:41,316 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 21:41:41,436 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-92.i[916,929]
[2025-02-05 21:41:41,587 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 21:41:41,610 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 21:41:41,618 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-92.i[916,929]
[2025-02-05 21:41:41,688 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 21:41:41,708 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 21:41:41,709 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:41 WrapperNode
[2025-02-05 21:41:41,709 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 21:41:41,711 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 21:41:41,711 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 21:41:41,711 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 21:41:41,715 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:41" (1/1) ...
[2025-02-05 21:41:41,726 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:41" (1/1) ...
[2025-02-05 21:41:41,777 INFO  L138                Inliner]: procedures = 26, calls = 71, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 502
[2025-02-05 21:41:41,778 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 21:41:41,778 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 21:41:41,778 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 21:41:41,779 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 21:41:41,784 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:41" (1/1) ...
[2025-02-05 21:41:41,785 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:41" (1/1) ...
[2025-02-05 21:41:41,799 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:41" (1/1) ...
[2025-02-05 21:41:41,831 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 21:41:41,832 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:41" (1/1) ...
[2025-02-05 21:41:41,832 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:41" (1/1) ...
[2025-02-05 21:41:41,850 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:41" (1/1) ...
[2025-02-05 21:41:41,857 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:41" (1/1) ...
[2025-02-05 21:41:41,863 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:41" (1/1) ...
[2025-02-05 21:41:41,865 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:41" (1/1) ...
[2025-02-05 21:41:41,870 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 21:41:41,871 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 21:41:41,871 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 21:41:41,871 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 21:41:41,872 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:41" (1/1) ...
[2025-02-05 21:41:41,875 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 21:41:41,886 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 21:41:41,900 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 21:41:41,920 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 21:41:41,929 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 21:41:41,930 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-02-05 21:41:41,930 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-02-05 21:41:41,930 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 21:41:41,930 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 21:41:41,930 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 21:41:42,015 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 21:41:42,017 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 21:41:42,719 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L406: havoc property_#t~bitwise48#1;havoc property_#t~short49#1;
[2025-02-05 21:41:42,812 INFO  L?                        ?]: Removed 23 outVars from TransFormulas that were not future-live.
[2025-02-05 21:41:42,812 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 21:41:42,838 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 21:41:42,838 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 21:41:42,839 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:41:42 BoogieIcfgContainer
[2025-02-05 21:41:42,839 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 21:41:42,840 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 21:41:42,840 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 21:41:42,843 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 21:41:42,843 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:41:41" (1/3) ...
[2025-02-05 21:41:42,843 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6f8757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:41:42, skipping insertion in model container
[2025-02-05 21:41:42,844 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:41:41" (2/3) ...
[2025-02-05 21:41:42,844 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e6f8757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:41:42, skipping insertion in model container
[2025-02-05 21:41:42,844 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:41:42" (3/3) ...
[2025-02-05 21:41:42,845 INFO  L128   eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-92.i
[2025-02-05 21:41:42,855 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 21:41:42,857 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-92.i that has 2 procedures, 211 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 21:41:42,929 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 21:41:42,941 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;@7c06585f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 21:41:42,942 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 21:41:42,947 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 211 states, 150 states have (on average 1.5733333333333333) internal successors, (236), 151 states have internal predecessors, (236), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58)
[2025-02-05 21:41:42,964 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 376
[2025-02-05 21:41:42,965 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:41:42,966 INFO  L218           NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:42,966 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:41:42,969 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:41:42,970 INFO  L85        PathProgramCache]: Analyzing trace with hash -1020559536, now seen corresponding path program 1 times
[2025-02-05 21:41:42,975 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:41:42,975 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034447811]
[2025-02-05 21:41:42,975 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:41:42,976 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:41:43,081 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes.
[2025-02-05 21:41:43,124 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements.
[2025-02-05 21:41:43,125 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:41:43,125 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:41:43,468 INFO  L134       CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 6498 trivial. 0 not checked.
[2025-02-05 21:41:43,469 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:41:43,469 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034447811]
[2025-02-05 21:41:43,470 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034447811] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 21:41:43,470 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810139899]
[2025-02-05 21:41:43,470 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:41:43,470 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 21:41:43,470 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 21:41:43,472 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 21:41:43,474 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 21:41:43,593 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes.
[2025-02-05 21:41:43,715 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements.
[2025-02-05 21:41:43,715 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:41:43,715 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:41:43,719 INFO  L256         TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-02-05 21:41:43,736 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 21:41:43,780 INFO  L134       CoverageAnalysis]: Checked inductivity of 6612 backedges. 114 proven. 0 refuted. 0 times theorem prover too weak. 6498 trivial. 0 not checked.
[2025-02-05 21:41:43,780 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 21:41:43,780 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810139899] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:41:43,780 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 21:41:43,781 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-02-05 21:41:43,782 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77524089]
[2025-02-05 21:41:43,782 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:41:43,785 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-05 21:41:43,785 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:41:43,802 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-05 21:41:43,802 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 21:41:43,805 INFO  L87              Difference]: Start difference. First operand  has 211 states, 150 states have (on average 1.5733333333333333) internal successors, (236), 151 states have internal predecessors, (236), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) Second operand  has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (58), 2 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 2 states have call successors, (58)
[2025-02-05 21:41:43,853 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:41:43,854 INFO  L93              Difference]: Finished difference Result 416 states and 757 transitions.
[2025-02-05 21:41:43,855 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-05 21:41:43,856 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (58), 2 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 2 states have call successors, (58) Word has length 375
[2025-02-05 21:41:43,856 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:41:43,861 INFO  L225             Difference]: With dead ends: 416
[2025-02-05 21:41:43,861 INFO  L226             Difference]: Without dead ends: 208
[2025-02-05 21:41:43,865 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 21:41:43,866 INFO  L435           NwaCegarLoop]: 335 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 21:41:43,867 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 335 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 21:41:43,876 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 208 states.
[2025-02-05 21:41:43,899 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208.
[2025-02-05 21:41:43,900 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 208 states, 148 states have (on average 1.5608108108108107) internal successors, (231), 148 states have internal predecessors, (231), 58 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58)
[2025-02-05 21:41:43,904 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 347 transitions.
[2025-02-05 21:41:43,905 INFO  L78                 Accepts]: Start accepts. Automaton has 208 states and 347 transitions. Word has length 375
[2025-02-05 21:41:43,905 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:41:43,906 INFO  L471      AbstractCegarLoop]: Abstraction has 208 states and 347 transitions.
[2025-02-05 21:41:43,906 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (58), 2 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 2 states have call successors, (58)
[2025-02-05 21:41:43,906 INFO  L276                IsEmpty]: Start isEmpty. Operand 208 states and 347 transitions.
[2025-02-05 21:41:43,910 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 376
[2025-02-05 21:41:43,910 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:41:43,911 INFO  L218           NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:43,922 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2025-02-05 21:41:44,115 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-02-05 21:41:44,116 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:41:44,117 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:41:44,117 INFO  L85        PathProgramCache]: Analyzing trace with hash 43665350, now seen corresponding path program 1 times
[2025-02-05 21:41:44,118 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:41:44,118 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010369155]
[2025-02-05 21:41:44,118 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:41:44,119 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:41:44,154 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes.
[2025-02-05 21:41:44,235 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements.
[2025-02-05 21:41:44,235 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:41:44,235 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:41:44,470 INFO  L134       CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked.
[2025-02-05 21:41:44,472 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:41:44,472 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010369155]
[2025-02-05 21:41:44,473 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010369155] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:41:44,473 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:41:44,473 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 21:41:44,473 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614859964]
[2025-02-05 21:41:44,473 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:41:44,474 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 21:41:44,474 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:41:44,475 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 21:41:44,476 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 21:41:44,477 INFO  L87              Difference]: Start difference. First operand 208 states and 347 transitions. Second operand  has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58)
[2025-02-05 21:41:44,593 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:41:44,594 INFO  L93              Difference]: Finished difference Result 552 states and 924 transitions.
[2025-02-05 21:41:44,594 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 21:41:44,595 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 375
[2025-02-05 21:41:44,596 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:41:44,601 INFO  L225             Difference]: With dead ends: 552
[2025-02-05 21:41:44,602 INFO  L226             Difference]: Without dead ends: 347
[2025-02-05 21:41:44,603 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 21:41:44,604 INFO  L435           NwaCegarLoop]: 361 mSDtfsCounter, 243 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 21:41:44,604 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 655 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 21:41:44,605 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 347 states.
[2025-02-05 21:41:44,645 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 344.
[2025-02-05 21:41:44,647 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 344 states, 253 states have (on average 1.5612648221343874) internal successors, (395), 254 states have internal predecessors, (395), 88 states have call successors, (88), 2 states have call predecessors, (88), 2 states have return successors, (88), 87 states have call predecessors, (88), 88 states have call successors, (88)
[2025-02-05 21:41:44,651 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 571 transitions.
[2025-02-05 21:41:44,652 INFO  L78                 Accepts]: Start accepts. Automaton has 344 states and 571 transitions. Word has length 375
[2025-02-05 21:41:44,653 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:41:44,654 INFO  L471      AbstractCegarLoop]: Abstraction has 344 states and 571 transitions.
[2025-02-05 21:41:44,654 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58)
[2025-02-05 21:41:44,654 INFO  L276                IsEmpty]: Start isEmpty. Operand 344 states and 571 transitions.
[2025-02-05 21:41:44,658 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 376
[2025-02-05 21:41:44,658 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:41:44,659 INFO  L218           NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:44,659 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 21:41:44,659 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:41:44,660 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:41:44,660 INFO  L85        PathProgramCache]: Analyzing trace with hash -1139681947, now seen corresponding path program 1 times
[2025-02-05 21:41:44,660 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:41:44,661 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572687034]
[2025-02-05 21:41:44,661 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:41:44,662 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:41:44,696 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes.
[2025-02-05 21:41:44,747 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements.
[2025-02-05 21:41:44,747 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:41:44,747 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:41:44,996 INFO  L134       CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked.
[2025-02-05 21:41:44,996 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:41:44,997 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572687034]
[2025-02-05 21:41:44,997 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572687034] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:41:44,997 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:41:44,998 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 21:41:44,998 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168726955]
[2025-02-05 21:41:44,998 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:41:44,998 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 21:41:44,998 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:41:44,999 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 21:41:45,000 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 21:41:45,001 INFO  L87              Difference]: Start difference. First operand 344 states and 571 transitions. Second operand  has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58)
[2025-02-05 21:41:45,088 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:41:45,088 INFO  L93              Difference]: Finished difference Result 693 states and 1146 transitions.
[2025-02-05 21:41:45,090 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 21:41:45,090 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 375
[2025-02-05 21:41:45,091 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:41:45,095 INFO  L225             Difference]: With dead ends: 693
[2025-02-05 21:41:45,096 INFO  L226             Difference]: Without dead ends: 352
[2025-02-05 21:41:45,097 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 21:41:45,098 INFO  L435           NwaCegarLoop]: 408 mSDtfsCounter, 221 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2025-02-05 21:41:45,098 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 714 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2025-02-05 21:41:45,099 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 352 states.
[2025-02-05 21:41:45,109 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 270.
[2025-02-05 21:41:45,110 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 270 states, 209 states have (on average 1.5645933014354068) internal successors, (327), 209 states have internal predecessors, (327), 58 states have call successors, (58), 2 states have call predecessors, (58), 2 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58)
[2025-02-05 21:41:45,111 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 443 transitions.
[2025-02-05 21:41:45,112 INFO  L78                 Accepts]: Start accepts. Automaton has 270 states and 443 transitions. Word has length 375
[2025-02-05 21:41:45,112 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:41:45,112 INFO  L471      AbstractCegarLoop]: Abstraction has 270 states and 443 transitions.
[2025-02-05 21:41:45,113 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58)
[2025-02-05 21:41:45,113 INFO  L276                IsEmpty]: Start isEmpty. Operand 270 states and 443 transitions.
[2025-02-05 21:41:45,117 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 376
[2025-02-05 21:41:45,117 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:41:45,117 INFO  L218           NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:45,117 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 21:41:45,118 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:41:45,118 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:41:45,118 INFO  L85        PathProgramCache]: Analyzing trace with hash 710617455, now seen corresponding path program 1 times
[2025-02-05 21:41:45,118 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:41:45,118 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560157414]
[2025-02-05 21:41:45,118 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:41:45,118 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:41:45,141 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 375 statements into 1 equivalence classes.
[2025-02-05 21:41:45,192 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 375 of 375 statements.
[2025-02-05 21:41:45,192 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:41:45,192 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:41:45,432 INFO  L134       CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked.
[2025-02-05 21:41:45,433 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:41:45,433 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560157414]
[2025-02-05 21:41:45,433 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560157414] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:41:45,433 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:41:45,433 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 21:41:45,433 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476973639]
[2025-02-05 21:41:45,433 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:41:45,434 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 21:41:45,434 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:41:45,434 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 21:41:45,434 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 21:41:45,435 INFO  L87              Difference]: Start difference. First operand 270 states and 443 transitions. Second operand  has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58)
[2025-02-05 21:41:46,000 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:41:46,000 INFO  L93              Difference]: Finished difference Result 995 states and 1618 transitions.
[2025-02-05 21:41:46,000 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 21:41:46,001 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 375
[2025-02-05 21:41:46,001 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:41:46,009 INFO  L225             Difference]: With dead ends: 995
[2025-02-05 21:41:46,010 INFO  L226             Difference]: Without dead ends: 728
[2025-02-05 21:41:46,011 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 21:41:46,012 INFO  L435           NwaCegarLoop]: 499 mSDtfsCounter, 610 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 21:41:46,012 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 1105 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 21:41:46,013 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 728 states.
[2025-02-05 21:41:46,086 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 424.
[2025-02-05 21:41:46,086 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 424 states, 321 states have (on average 1.5514018691588785) internal successors, (498), 322 states have internal predecessors, (498), 98 states have call successors, (98), 4 states have call predecessors, (98), 4 states have return successors, (98), 97 states have call predecessors, (98), 98 states have call successors, (98)
[2025-02-05 21:41:46,089 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 694 transitions.
[2025-02-05 21:41:46,090 INFO  L78                 Accepts]: Start accepts. Automaton has 424 states and 694 transitions. Word has length 375
[2025-02-05 21:41:46,091 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:41:46,091 INFO  L471      AbstractCegarLoop]: Abstraction has 424 states and 694 transitions.
[2025-02-05 21:41:46,091 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58)
[2025-02-05 21:41:46,091 INFO  L276                IsEmpty]: Start isEmpty. Operand 424 states and 694 transitions.
[2025-02-05 21:41:46,095 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 377
[2025-02-05 21:41:46,095 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:41:46,095 INFO  L218           NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:46,096 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 21:41:46,096 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:41:46,096 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:41:46,096 INFO  L85        PathProgramCache]: Analyzing trace with hash 2140071625, now seen corresponding path program 1 times
[2025-02-05 21:41:46,097 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:41:46,097 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23819401]
[2025-02-05 21:41:46,097 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:41:46,097 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:41:46,121 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 376 statements into 1 equivalence classes.
[2025-02-05 21:41:46,206 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 376 of 376 statements.
[2025-02-05 21:41:46,207 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:41:46,207 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:41:47,022 INFO  L134       CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked.
[2025-02-05 21:41:47,023 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:41:47,023 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23819401]
[2025-02-05 21:41:47,023 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23819401] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:41:47,023 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:41:47,023 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 21:41:47,023 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775320678]
[2025-02-05 21:41:47,023 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:41:47,024 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 21:41:47,024 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:41:47,024 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 21:41:47,024 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 21:41:47,025 INFO  L87              Difference]: Start difference. First operand 424 states and 694 transitions. Second operand  has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58)
[2025-02-05 21:41:47,385 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:41:47,386 INFO  L93              Difference]: Finished difference Result 1294 states and 2113 transitions.
[2025-02-05 21:41:47,386 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 21:41:47,386 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 376
[2025-02-05 21:41:47,387 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:41:47,392 INFO  L225             Difference]: With dead ends: 1294
[2025-02-05 21:41:47,392 INFO  L226             Difference]: Without dead ends: 873
[2025-02-05 21:41:47,393 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-02-05 21:41:47,394 INFO  L435           NwaCegarLoop]: 342 mSDtfsCounter, 389 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-05 21:41:47,394 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1207 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-05 21:41:47,395 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 873 states.
[2025-02-05 21:41:47,459 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 845.
[2025-02-05 21:41:47,461 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 845 states, 640 states have (on average 1.553125) internal successors, (994), 642 states have internal predecessors, (994), 196 states have call successors, (196), 8 states have call predecessors, (196), 8 states have return successors, (196), 194 states have call predecessors, (196), 196 states have call successors, (196)
[2025-02-05 21:41:47,464 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1386 transitions.
[2025-02-05 21:41:47,466 INFO  L78                 Accepts]: Start accepts. Automaton has 845 states and 1386 transitions. Word has length 376
[2025-02-05 21:41:47,466 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:41:47,466 INFO  L471      AbstractCegarLoop]: Abstraction has 845 states and 1386 transitions.
[2025-02-05 21:41:47,467 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58)
[2025-02-05 21:41:47,467 INFO  L276                IsEmpty]: Start isEmpty. Operand 845 states and 1386 transitions.
[2025-02-05 21:41:47,470 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 378
[2025-02-05 21:41:47,470 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:41:47,471 INFO  L218           NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:47,471 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 21:41:47,471 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:41:47,471 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:41:47,471 INFO  L85        PathProgramCache]: Analyzing trace with hash -557834848, now seen corresponding path program 1 times
[2025-02-05 21:41:47,472 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:41:47,472 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375263994]
[2025-02-05 21:41:47,472 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:41:47,472 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:41:47,492 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 377 statements into 1 equivalence classes.
[2025-02-05 21:41:47,568 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 377 of 377 statements.
[2025-02-05 21:41:47,568 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:41:47,569 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:41:48,429 INFO  L134       CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked.
[2025-02-05 21:41:48,429 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:41:48,429 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375263994]
[2025-02-05 21:41:48,429 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375263994] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:41:48,430 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:41:48,430 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 21:41:48,430 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509719344]
[2025-02-05 21:41:48,430 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:41:48,430 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 21:41:48,430 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:41:48,431 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 21:41:48,431 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-02-05 21:41:48,431 INFO  L87              Difference]: Start difference. First operand 845 states and 1386 transitions. Second operand  has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58)
[2025-02-05 21:41:48,994 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:41:48,994 INFO  L93              Difference]: Finished difference Result 2061 states and 3379 transitions.
[2025-02-05 21:41:48,994 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 21:41:48,995 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 377
[2025-02-05 21:41:48,995 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:41:49,000 INFO  L225             Difference]: With dead ends: 2061
[2025-02-05 21:41:49,001 INFO  L226             Difference]: Without dead ends: 1219
[2025-02-05 21:41:49,002 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2025-02-05 21:41:49,002 INFO  L435           NwaCegarLoop]: 317 mSDtfsCounter, 358 mSDsluCounter, 1011 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 1328 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 21:41:49,002 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 1328 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 21:41:49,003 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1219 states.
[2025-02-05 21:41:49,063 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 1185.
[2025-02-05 21:41:49,065 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1185 states, 920 states have (on average 1.566304347826087) internal successors, (1441), 922 states have internal predecessors, (1441), 254 states have call successors, (254), 10 states have call predecessors, (254), 10 states have return successors, (254), 252 states have call predecessors, (254), 254 states have call successors, (254)
[2025-02-05 21:41:49,069 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1949 transitions.
[2025-02-05 21:41:49,071 INFO  L78                 Accepts]: Start accepts. Automaton has 1185 states and 1949 transitions. Word has length 377
[2025-02-05 21:41:49,071 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:41:49,071 INFO  L471      AbstractCegarLoop]: Abstraction has 1185 states and 1949 transitions.
[2025-02-05 21:41:49,071 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 15.0) internal successors, (90), 6 states have internal predecessors, (90), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58)
[2025-02-05 21:41:49,071 INFO  L276                IsEmpty]: Start isEmpty. Operand 1185 states and 1949 transitions.
[2025-02-05 21:41:49,075 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 380
[2025-02-05 21:41:49,075 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:41:49,075 INFO  L218           NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:41:49,075 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 21:41:49,075 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:41:49,076 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:41:49,076 INFO  L85        PathProgramCache]: Analyzing trace with hash -34776162, now seen corresponding path program 1 times
[2025-02-05 21:41:49,076 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:41:49,076 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651246504]
[2025-02-05 21:41:49,076 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:41:49,076 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:41:49,094 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes.
[2025-02-05 21:41:49,209 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements.
[2025-02-05 21:41:49,209 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:41:49,209 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:41:51,791 INFO  L134       CoverageAnalysis]: Checked inductivity of 6612 backedges. 210 proven. 126 refuted. 0 times theorem prover too weak. 6276 trivial. 0 not checked.
[2025-02-05 21:41:51,791 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:41:51,791 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651246504]
[2025-02-05 21:41:51,791 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651246504] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 21:41:51,791 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396260370]
[2025-02-05 21:41:51,792 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:41:51,792 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 21:41:51,792 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 21:41:51,796 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 21:41:51,797 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 21:41:51,899 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes.
[2025-02-05 21:41:51,999 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements.
[2025-02-05 21:41:51,999 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:41:51,999 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:41:52,007 INFO  L256         TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 18 conjuncts are in the unsatisfiable core
[2025-02-05 21:41:52,014 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 21:41:52,729 INFO  L134       CoverageAnalysis]: Checked inductivity of 6612 backedges. 4247 proven. 126 refuted. 0 times theorem prover too weak. 2239 trivial. 0 not checked.
[2025-02-05 21:41:52,730 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 21:41:54,099 INFO  L134       CoverageAnalysis]: Checked inductivity of 6612 backedges. 210 proven. 129 refuted. 0 times theorem prover too weak. 6273 trivial. 0 not checked.
[2025-02-05 21:41:54,102 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1396260370] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-05 21:41:54,102 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-05 21:41:54,103 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 24
[2025-02-05 21:41:54,103 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320225437]
[2025-02-05 21:41:54,103 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-05 21:41:54,104 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2025-02-05 21:41:54,104 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:41:54,104 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2025-02-05 21:41:54,104 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=418, Unknown=0, NotChecked=0, Total=552
[2025-02-05 21:41:54,105 INFO  L87              Difference]: Start difference. First operand 1185 states and 1949 transitions. Second operand  has 24 states, 24 states have (on average 6.791666666666667) internal successors, (163), 24 states have internal predecessors, (163), 5 states have call successors, (118), 3 states have call predecessors, (118), 7 states have return successors, (119), 5 states have call predecessors, (119), 5 states have call successors, (119)
[2025-02-05 21:42:01,067 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:42:01,068 INFO  L93              Difference]: Finished difference Result 7736 states and 12346 transitions.
[2025-02-05 21:42:01,068 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. 
[2025-02-05 21:42:01,068 INFO  L78                 Accepts]: Start accepts. Automaton has  has 24 states, 24 states have (on average 6.791666666666667) internal successors, (163), 24 states have internal predecessors, (163), 5 states have call successors, (118), 3 states have call predecessors, (118), 7 states have return successors, (119), 5 states have call predecessors, (119), 5 states have call successors, (119) Word has length 379
[2025-02-05 21:42:01,069 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:42:01,096 INFO  L225             Difference]: With dead ends: 7736
[2025-02-05 21:42:01,096 INFO  L226             Difference]: Without dead ends: 6817
[2025-02-05 21:42:01,105 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 877 GetRequests, 759 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5358 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3047, Invalid=10995, Unknown=0, NotChecked=0, Total=14042
[2025-02-05 21:42:01,105 INFO  L435           NwaCegarLoop]: 306 mSDtfsCounter, 5513 mSDsluCounter, 2288 mSDsCounter, 0 mSdLazyCounter, 3058 mSolverCounterSat, 2326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5539 SdHoareTripleChecker+Valid, 2594 SdHoareTripleChecker+Invalid, 5384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2326 IncrementalHoareTripleChecker+Valid, 3058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time
[2025-02-05 21:42:01,106 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5539 Valid, 2594 Invalid, 5384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2326 Valid, 3058 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time]
[2025-02-05 21:42:01,111 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 6817 states.
[2025-02-05 21:42:01,358 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 6817 to 2291.
[2025-02-05 21:42:01,363 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2291 states, 1795 states have (on average 1.550974930362117) internal successors, (2784), 1799 states have internal predecessors, (2784), 450 states have call successors, (450), 45 states have call predecessors, (450), 45 states have return successors, (450), 446 states have call predecessors, (450), 450 states have call successors, (450)
[2025-02-05 21:42:01,370 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 3684 transitions.
[2025-02-05 21:42:01,374 INFO  L78                 Accepts]: Start accepts. Automaton has 2291 states and 3684 transitions. Word has length 379
[2025-02-05 21:42:01,375 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:42:01,375 INFO  L471      AbstractCegarLoop]: Abstraction has 2291 states and 3684 transitions.
[2025-02-05 21:42:01,376 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 24 states have (on average 6.791666666666667) internal successors, (163), 24 states have internal predecessors, (163), 5 states have call successors, (118), 3 states have call predecessors, (118), 7 states have return successors, (119), 5 states have call predecessors, (119), 5 states have call successors, (119)
[2025-02-05 21:42:01,376 INFO  L276                IsEmpty]: Start isEmpty. Operand 2291 states and 3684 transitions.
[2025-02-05 21:42:01,378 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 380
[2025-02-05 21:42:01,378 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:42:01,378 INFO  L218           NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:01,388 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 21:42:01,579 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 21:42:01,579 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:42:01,580 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:42:01,580 INFO  L85        PathProgramCache]: Analyzing trace with hash 1890909792, now seen corresponding path program 1 times
[2025-02-05 21:42:01,581 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:42:01,581 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688865358]
[2025-02-05 21:42:01,581 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:42:01,581 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:42:01,601 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes.
[2025-02-05 21:42:01,623 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements.
[2025-02-05 21:42:01,623 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:42:01,623 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:42:01,712 INFO  L134       CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked.
[2025-02-05 21:42:01,712 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:42:01,712 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688865358]
[2025-02-05 21:42:01,712 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688865358] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:42:01,713 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:42:01,713 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 21:42:01,713 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939218615]
[2025-02-05 21:42:01,713 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:42:01,713 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 21:42:01,713 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:42:01,714 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 21:42:01,714 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 21:42:01,714 INFO  L87              Difference]: Start difference. First operand 2291 states and 3684 transitions. Second operand  has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58)
[2025-02-05 21:42:01,944 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:42:01,944 INFO  L93              Difference]: Finished difference Result 4149 states and 6650 transitions.
[2025-02-05 21:42:01,944 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 21:42:01,945 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 379
[2025-02-05 21:42:01,945 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:42:01,954 INFO  L225             Difference]: With dead ends: 4149
[2025-02-05 21:42:01,954 INFO  L226             Difference]: Without dead ends: 2285
[2025-02-05 21:42:01,958 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 21:42:01,959 INFO  L435           NwaCegarLoop]: 442 mSDtfsCounter, 199 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 21:42:01,959 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 764 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 21:42:01,960 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2285 states.
[2025-02-05 21:42:02,087 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 2279.
[2025-02-05 21:42:02,091 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2279 states, 1783 states have (on average 1.5479528883903533) internal successors, (2760), 1787 states have internal predecessors, (2760), 450 states have call successors, (450), 45 states have call predecessors, (450), 45 states have return successors, (450), 446 states have call predecessors, (450), 450 states have call successors, (450)
[2025-02-05 21:42:02,096 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2279 states to 2279 states and 3660 transitions.
[2025-02-05 21:42:02,098 INFO  L78                 Accepts]: Start accepts. Automaton has 2279 states and 3660 transitions. Word has length 379
[2025-02-05 21:42:02,099 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:42:02,100 INFO  L471      AbstractCegarLoop]: Abstraction has 2279 states and 3660 transitions.
[2025-02-05 21:42:02,100 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58)
[2025-02-05 21:42:02,100 INFO  L276                IsEmpty]: Start isEmpty. Operand 2279 states and 3660 transitions.
[2025-02-05 21:42:02,102 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 380
[2025-02-05 21:42:02,102 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:42:02,102 INFO  L218           NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:02,102 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 21:42:02,102 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:42:02,103 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:42:02,103 INFO  L85        PathProgramCache]: Analyzing trace with hash -1747397752, now seen corresponding path program 1 times
[2025-02-05 21:42:02,103 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:42:02,103 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481374122]
[2025-02-05 21:42:02,103 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:42:02,103 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:42:02,119 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes.
[2025-02-05 21:42:02,183 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements.
[2025-02-05 21:42:02,183 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:42:02,183 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:42:16,091 INFO  L134       CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked.
[2025-02-05 21:42:16,091 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:42:16,091 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481374122]
[2025-02-05 21:42:16,091 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481374122] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:42:16,092 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:42:16,092 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-02-05 21:42:16,092 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077911069]
[2025-02-05 21:42:16,092 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:42:16,092 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-02-05 21:42:16,092 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:42:16,093 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-02-05 21:42:16,093 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132
[2025-02-05 21:42:16,094 INFO  L87              Difference]: Start difference. First operand 2279 states and 3660 transitions. Second operand  has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58)
[2025-02-05 21:42:25,616 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:42:25,616 INFO  L93              Difference]: Finished difference Result 16869 states and 27364 transitions.
[2025-02-05 21:42:25,617 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2025-02-05 21:42:25,617 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 379
[2025-02-05 21:42:25,618 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:42:25,694 INFO  L225             Difference]: With dead ends: 16869
[2025-02-05 21:42:25,694 INFO  L226             Difference]: Without dead ends: 15017
[2025-02-05 21:42:25,709 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=249, Invalid=563, Unknown=0, NotChecked=0, Total=812
[2025-02-05 21:42:25,711 INFO  L435           NwaCegarLoop]: 557 mSDtfsCounter, 3937 mSDsluCounter, 3644 mSDsCounter, 0 mSdLazyCounter, 2820 mSolverCounterSat, 1091 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3937 SdHoareTripleChecker+Valid, 4201 SdHoareTripleChecker+Invalid, 3911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1091 IncrementalHoareTripleChecker+Valid, 2820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time
[2025-02-05 21:42:25,712 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3937 Valid, 4201 Invalid, 3911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1091 Valid, 2820 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time]
[2025-02-05 21:42:25,724 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15017 states.
[2025-02-05 21:42:26,395 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15017 to 4486.
[2025-02-05 21:42:26,401 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 4486 states, 3558 states have (on average 1.554806070826307) internal successors, (5532), 3566 states have internal predecessors, (5532), 842 states have call successors, (842), 85 states have call predecessors, (842), 85 states have return successors, (842), 834 states have call predecessors, (842), 842 states have call successors, (842)
[2025-02-05 21:42:26,409 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4486 states to 4486 states and 7216 transitions.
[2025-02-05 21:42:26,416 INFO  L78                 Accepts]: Start accepts. Automaton has 4486 states and 7216 transitions. Word has length 379
[2025-02-05 21:42:26,417 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:42:26,417 INFO  L471      AbstractCegarLoop]: Abstraction has 4486 states and 7216 transitions.
[2025-02-05 21:42:26,417 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58)
[2025-02-05 21:42:26,417 INFO  L276                IsEmpty]: Start isEmpty. Operand 4486 states and 7216 transitions.
[2025-02-05 21:42:26,420 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 380
[2025-02-05 21:42:26,420 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:42:26,421 INFO  L218           NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:26,421 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 21:42:26,421 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:42:26,421 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:42:26,421 INFO  L85        PathProgramCache]: Analyzing trace with hash 1426803837, now seen corresponding path program 1 times
[2025-02-05 21:42:26,421 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:42:26,421 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961183759]
[2025-02-05 21:42:26,422 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:42:26,422 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:42:26,436 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes.
[2025-02-05 21:42:26,476 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements.
[2025-02-05 21:42:26,476 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:42:26,476 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:42:26,698 INFO  L134       CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked.
[2025-02-05 21:42:26,698 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:42:26,698 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961183759]
[2025-02-05 21:42:26,698 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961183759] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:42:26,698 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:42:26,698 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 21:42:26,698 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424477739]
[2025-02-05 21:42:26,698 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:42:26,699 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 21:42:26,700 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:42:26,700 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 21:42:26,700 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 21:42:26,700 INFO  L87              Difference]: Start difference. First operand 4486 states and 7216 transitions. Second operand  has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58)
[2025-02-05 21:42:29,247 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:42:29,247 INFO  L93              Difference]: Finished difference Result 18116 states and 28886 transitions.
[2025-02-05 21:42:29,248 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 21:42:29,248 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 379
[2025-02-05 21:42:29,249 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:42:29,285 INFO  L225             Difference]: With dead ends: 18116
[2025-02-05 21:42:29,286 INFO  L226             Difference]: Without dead ends: 14338
[2025-02-05 21:42:29,293 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 21:42:29,294 INFO  L435           NwaCegarLoop]: 468 mSDtfsCounter, 912 mSDsluCounter, 987 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 21:42:29,294 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 1455 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 21:42:29,300 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14338 states.
[2025-02-05 21:42:30,764 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14338 to 10627.
[2025-02-05 21:42:30,790 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10627 states, 8315 states have (on average 1.5417919422730006) internal successors, (12820), 8331 states have internal predecessors, (12820), 2090 states have call successors, (2090), 221 states have call predecessors, (2090), 221 states have return successors, (2090), 2074 states have call predecessors, (2090), 2090 states have call successors, (2090)
[2025-02-05 21:42:30,816 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10627 states to 10627 states and 17000 transitions.
[2025-02-05 21:42:30,827 INFO  L78                 Accepts]: Start accepts. Automaton has 10627 states and 17000 transitions. Word has length 379
[2025-02-05 21:42:30,828 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:42:30,828 INFO  L471      AbstractCegarLoop]: Abstraction has 10627 states and 17000 transitions.
[2025-02-05 21:42:30,829 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58)
[2025-02-05 21:42:30,829 INFO  L276                IsEmpty]: Start isEmpty. Operand 10627 states and 17000 transitions.
[2025-02-05 21:42:30,834 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 380
[2025-02-05 21:42:30,834 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:42:30,834 INFO  L218           NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:30,835 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 21:42:30,835 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:42:30,835 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:42:30,835 INFO  L85        PathProgramCache]: Analyzing trace with hash -1871470999, now seen corresponding path program 1 times
[2025-02-05 21:42:30,836 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:42:30,836 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681543996]
[2025-02-05 21:42:30,836 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:42:30,836 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:42:30,856 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes.
[2025-02-05 21:42:30,917 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements.
[2025-02-05 21:42:30,917 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:42:30,917 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:42:31,104 INFO  L134       CoverageAnalysis]: Checked inductivity of 6612 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 6441 trivial. 0 not checked.
[2025-02-05 21:42:31,104 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:42:31,104 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681543996]
[2025-02-05 21:42:31,104 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681543996] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 21:42:31,104 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266615214]
[2025-02-05 21:42:31,104 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:42:31,104 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 21:42:31,105 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 21:42:31,106 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 21:42:31,108 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 21:42:31,200 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes.
[2025-02-05 21:42:31,327 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements.
[2025-02-05 21:42:31,328 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:42:31,328 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:42:31,330 INFO  L256         TraceCheckSpWp]: Trace formula consists of 859 conjuncts, 6 conjuncts are in the unsatisfiable core
[2025-02-05 21:42:31,335 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 21:42:31,496 INFO  L134       CoverageAnalysis]: Checked inductivity of 6612 backedges. 2857 proven. 51 refuted. 0 times theorem prover too weak. 3704 trivial. 0 not checked.
[2025-02-05 21:42:31,497 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 21:42:31,735 INFO  L134       CoverageAnalysis]: Checked inductivity of 6612 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 6441 trivial. 0 not checked.
[2025-02-05 21:42:31,736 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266615214] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-05 21:42:31,736 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-05 21:42:31,736 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8
[2025-02-05 21:42:31,736 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807887091]
[2025-02-05 21:42:31,736 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-05 21:42:31,737 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-02-05 21:42:31,740 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:42:31,741 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-02-05 21:42:31,741 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2025-02-05 21:42:31,742 INFO  L87              Difference]: Start difference. First operand 10627 states and 17000 transitions. Second operand  has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 3 states have call successors, (92), 2 states have call predecessors, (92), 4 states have return successors, (93), 3 states have call predecessors, (93), 3 states have call successors, (93)
[2025-02-05 21:42:32,450 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:42:32,451 INFO  L93              Difference]: Finished difference Result 15635 states and 24894 transitions.
[2025-02-05 21:42:32,451 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-02-05 21:42:32,452 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 3 states have call successors, (92), 2 states have call predecessors, (92), 4 states have return successors, (93), 3 states have call predecessors, (93), 3 states have call successors, (93) Word has length 379
[2025-02-05 21:42:32,452 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:42:32,470 INFO  L225             Difference]: With dead ends: 15635
[2025-02-05 21:42:32,470 INFO  L226             Difference]: Without dead ends: 5865
[2025-02-05 21:42:32,486 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 764 GetRequests, 755 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110
[2025-02-05 21:42:32,487 INFO  L435           NwaCegarLoop]: 265 mSDtfsCounter, 238 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-02-05 21:42:32,488 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 681 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-02-05 21:42:32,491 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5865 states.
[2025-02-05 21:42:32,997 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5865 to 5181.
[2025-02-05 21:42:33,002 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5181 states, 4076 states have (on average 1.5338567222767419) internal successors, (6252), 4076 states have internal predecessors, (6252), 986 states have call successors, (986), 118 states have call predecessors, (986), 118 states have return successors, (986), 986 states have call predecessors, (986), 986 states have call successors, (986)
[2025-02-05 21:42:33,009 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5181 states to 5181 states and 8224 transitions.
[2025-02-05 21:42:33,013 INFO  L78                 Accepts]: Start accepts. Automaton has 5181 states and 8224 transitions. Word has length 379
[2025-02-05 21:42:33,014 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:42:33,014 INFO  L471      AbstractCegarLoop]: Abstraction has 5181 states and 8224 transitions.
[2025-02-05 21:42:33,014 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 3 states have call successors, (92), 2 states have call predecessors, (92), 4 states have return successors, (93), 3 states have call predecessors, (93), 3 states have call successors, (93)
[2025-02-05 21:42:33,014 INFO  L276                IsEmpty]: Start isEmpty. Operand 5181 states and 8224 transitions.
[2025-02-05 21:42:33,016 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 381
[2025-02-05 21:42:33,016 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:42:33,017 INFO  L218           NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:33,024 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 21:42:33,221 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 21:42:33,221 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:42:33,222 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:42:33,222 INFO  L85        PathProgramCache]: Analyzing trace with hash -242806853, now seen corresponding path program 1 times
[2025-02-05 21:42:33,222 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:42:33,222 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066875400]
[2025-02-05 21:42:33,222 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:42:33,222 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:42:33,237 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes.
[2025-02-05 21:42:33,247 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements.
[2025-02-05 21:42:33,248 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:42:33,248 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:42:33,309 INFO  L134       CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked.
[2025-02-05 21:42:33,309 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:42:33,309 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066875400]
[2025-02-05 21:42:33,309 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066875400] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:42:33,309 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:42:33,309 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 21:42:33,310 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498357573]
[2025-02-05 21:42:33,310 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:42:33,310 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 21:42:33,310 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:42:33,310 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 21:42:33,311 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 21:42:33,311 INFO  L87              Difference]: Start difference. First operand 5181 states and 8224 transitions. Second operand  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58)
[2025-02-05 21:42:33,893 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:42:33,893 INFO  L93              Difference]: Finished difference Result 9863 states and 15653 transitions.
[2025-02-05 21:42:33,894 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 21:42:33,894 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 380
[2025-02-05 21:42:33,895 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:42:33,910 INFO  L225             Difference]: With dead ends: 9863
[2025-02-05 21:42:33,910 INFO  L226             Difference]: Without dead ends: 5201
[2025-02-05 21:42:33,919 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 21:42:33,920 INFO  L435           NwaCegarLoop]: 333 mSDtfsCounter, 0 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-02-05 21:42:33,920 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 661 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-02-05 21:42:33,923 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5201 states.
[2025-02-05 21:42:34,681 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5201 to 5201.
[2025-02-05 21:42:34,686 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5201 states, 4096 states have (on average 1.53125) internal successors, (6272), 4096 states have internal predecessors, (6272), 986 states have call successors, (986), 118 states have call predecessors, (986), 118 states have return successors, (986), 986 states have call predecessors, (986), 986 states have call successors, (986)
[2025-02-05 21:42:34,694 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5201 states to 5201 states and 8244 transitions.
[2025-02-05 21:42:34,698 INFO  L78                 Accepts]: Start accepts. Automaton has 5201 states and 8244 transitions. Word has length 380
[2025-02-05 21:42:34,699 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:42:34,699 INFO  L471      AbstractCegarLoop]: Abstraction has 5201 states and 8244 transitions.
[2025-02-05 21:42:34,699 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58)
[2025-02-05 21:42:34,699 INFO  L276                IsEmpty]: Start isEmpty. Operand 5201 states and 8244 transitions.
[2025-02-05 21:42:34,701 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 382
[2025-02-05 21:42:34,701 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:42:34,701 INFO  L218           NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:34,701 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 21:42:34,701 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:42:34,702 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:42:34,702 INFO  L85        PathProgramCache]: Analyzing trace with hash -888658883, now seen corresponding path program 1 times
[2025-02-05 21:42:34,702 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:42:34,702 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75344089]
[2025-02-05 21:42:34,702 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:42:34,702 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:42:34,715 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes.
[2025-02-05 21:42:34,828 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements.
[2025-02-05 21:42:34,829 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:42:34,829 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-02-05 21:42:34,833 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1941000138]
[2025-02-05 21:42:34,833 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:42:34,833 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 21:42:34,833 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 21:42:34,835 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 21:42:34,839 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 21:42:34,938 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes.
[2025-02-05 21:42:35,039 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements.
[2025-02-05 21:42:35,039 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:42:35,039 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:42:35,048 INFO  L256         TraceCheckSpWp]: Trace formula consists of 863 conjuncts, 23 conjuncts are in the unsatisfiable core
[2025-02-05 21:42:35,053 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 21:42:36,178 INFO  L134       CoverageAnalysis]: Checked inductivity of 6612 backedges. 4247 proven. 126 refuted. 0 times theorem prover too weak. 2239 trivial. 0 not checked.
[2025-02-05 21:42:36,178 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 21:42:41,171 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:42:41,171 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75344089]
[2025-02-05 21:42:41,171 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2025-02-05 21:42:41,171 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941000138]
[2025-02-05 21:42:41,171 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941000138] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 21:42:41,172 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2025-02-05 21:42:41,172 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15
[2025-02-05 21:42:41,173 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436529055]
[2025-02-05 21:42:41,173 INFO  L85    oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton
[2025-02-05 21:42:41,174 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 16 states
[2025-02-05 21:42:41,174 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:42:41,174 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants.
[2025-02-05 21:42:41,175 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=508, Unknown=1, NotChecked=0, Total=600
[2025-02-05 21:42:41,175 INFO  L87              Difference]: Start difference. First operand 5201 states and 8244 transitions. Second operand  has 16 states, 16 states have (on average 6.625) internal successors, (106), 15 states have internal predecessors, (106), 3 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58)
[2025-02-05 21:42:45,211 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:42:45,211 INFO  L93              Difference]: Finished difference Result 14955 states and 23434 transitions.
[2025-02-05 21:42:45,212 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. 
[2025-02-05 21:42:45,212 INFO  L78                 Accepts]: Start accepts. Automaton has  has 16 states, 16 states have (on average 6.625) internal successors, (106), 15 states have internal predecessors, (106), 3 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58) Word has length 381
[2025-02-05 21:42:45,214 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:42:45,262 INFO  L225             Difference]: With dead ends: 14955
[2025-02-05 21:42:45,262 INFO  L226             Difference]: Without dead ends: 12668
[2025-02-05 21:42:45,271 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 482 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1145, Invalid=3966, Unknown=1, NotChecked=0, Total=5112
[2025-02-05 21:42:45,272 INFO  L435           NwaCegarLoop]: 478 mSDtfsCounter, 1636 mSDsluCounter, 2094 mSDsCounter, 0 mSdLazyCounter, 2566 mSolverCounterSat, 685 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1688 SdHoareTripleChecker+Valid, 2572 SdHoareTripleChecker+Invalid, 3251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 685 IncrementalHoareTripleChecker+Valid, 2566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-02-05 21:42:45,272 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1688 Valid, 2572 Invalid, 3251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [685 Valid, 2566 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-02-05 21:42:45,278 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12668 states.
[2025-02-05 21:42:46,291 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12668 to 10720.
[2025-02-05 21:42:46,305 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10720 states, 8575 states have (on average 1.544256559766764) internal successors, (13242), 8575 states have internal predecessors, (13242), 1914 states have call successors, (1914), 230 states have call predecessors, (1914), 230 states have return successors, (1914), 1914 states have call predecessors, (1914), 1914 states have call successors, (1914)
[2025-02-05 21:42:46,324 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10720 states to 10720 states and 17070 transitions.
[2025-02-05 21:42:46,331 INFO  L78                 Accepts]: Start accepts. Automaton has 10720 states and 17070 transitions. Word has length 381
[2025-02-05 21:42:46,332 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:42:46,332 INFO  L471      AbstractCegarLoop]: Abstraction has 10720 states and 17070 transitions.
[2025-02-05 21:42:46,332 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 16 states, 16 states have (on average 6.625) internal successors, (106), 15 states have internal predecessors, (106), 3 states have call successors, (58), 3 states have call predecessors, (58), 5 states have return successors, (58), 3 states have call predecessors, (58), 3 states have call successors, (58)
[2025-02-05 21:42:46,332 INFO  L276                IsEmpty]: Start isEmpty. Operand 10720 states and 17070 transitions.
[2025-02-05 21:42:46,336 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 382
[2025-02-05 21:42:46,336 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:42:46,336 INFO  L218           NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:46,345 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2025-02-05 21:42:46,536 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2025-02-05 21:42:46,537 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:42:46,538 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:42:46,538 INFO  L85        PathProgramCache]: Analyzing trace with hash -764585636, now seen corresponding path program 1 times
[2025-02-05 21:42:46,538 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:42:46,538 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706218807]
[2025-02-05 21:42:46,538 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:42:46,538 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:42:46,552 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes.
[2025-02-05 21:42:46,581 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements.
[2025-02-05 21:42:46,581 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:42:46,581 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:42:46,866 INFO  L134       CoverageAnalysis]: Checked inductivity of 6612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6612 trivial. 0 not checked.
[2025-02-05 21:42:46,866 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:42:46,866 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706218807]
[2025-02-05 21:42:46,866 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706218807] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 21:42:46,866 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 21:42:46,866 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 21:42:46,866 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333930231]
[2025-02-05 21:42:46,866 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 21:42:46,867 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 21:42:46,867 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:42:46,867 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 21:42:46,867 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 21:42:46,868 INFO  L87              Difference]: Start difference. First operand 10720 states and 17070 transitions. Second operand  has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58)
[2025-02-05 21:42:48,098 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:42:48,098 INFO  L93              Difference]: Finished difference Result 20234 states and 32148 transitions.
[2025-02-05 21:42:48,098 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 21:42:48,099 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58) Word has length 381
[2025-02-05 21:42:48,099 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:42:48,133 INFO  L225             Difference]: With dead ends: 20234
[2025-02-05 21:42:48,133 INFO  L226             Difference]: Without dead ends: 10766
[2025-02-05 21:42:48,153 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 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 21:42:48,154 INFO  L435           NwaCegarLoop]: 422 mSDtfsCounter, 403 mSDsluCounter, 929 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-02-05 21:42:48,154 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1351 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-02-05 21:42:48,160 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10766 states.
[2025-02-05 21:42:49,510 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10766 to 10696.
[2025-02-05 21:42:49,518 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10696 states, 8551 states have (on average 1.5401707402642966) internal successors, (13170), 8551 states have internal predecessors, (13170), 1914 states have call successors, (1914), 230 states have call predecessors, (1914), 230 states have return successors, (1914), 1914 states have call predecessors, (1914), 1914 states have call successors, (1914)
[2025-02-05 21:42:49,535 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10696 states to 10696 states and 16998 transitions.
[2025-02-05 21:42:49,541 INFO  L78                 Accepts]: Start accepts. Automaton has 10696 states and 16998 transitions. Word has length 381
[2025-02-05 21:42:49,542 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:42:49,542 INFO  L471      AbstractCegarLoop]: Abstraction has 10696 states and 16998 transitions.
[2025-02-05 21:42:49,542 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 1 states have call successors, (58), 1 states have call predecessors, (58), 1 states have return successors, (58), 1 states have call predecessors, (58), 1 states have call successors, (58)
[2025-02-05 21:42:49,542 INFO  L276                IsEmpty]: Start isEmpty. Operand 10696 states and 16998 transitions.
[2025-02-05 21:42:49,546 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 382
[2025-02-05 21:42:49,546 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:42:49,546 INFO  L218           NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:49,546 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 21:42:49,546 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:42:49,547 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:42:49,547 INFO  L85        PathProgramCache]: Analyzing trace with hash 136035038, now seen corresponding path program 1 times
[2025-02-05 21:42:49,547 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:42:49,547 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734085003]
[2025-02-05 21:42:49,547 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:42:49,547 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:42:49,564 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes.
[2025-02-05 21:42:49,652 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements.
[2025-02-05 21:42:49,652 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:42:49,653 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:42:49,995 INFO  L134       CoverageAnalysis]: Checked inductivity of 6612 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 6441 trivial. 0 not checked.
[2025-02-05 21:42:49,995 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:42:49,995 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734085003]
[2025-02-05 21:42:49,995 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734085003] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 21:42:49,995 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101259901]
[2025-02-05 21:42:49,996 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:42:49,996 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 21:42:49,996 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 21:42:49,998 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 21:42:50,000 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 21:42:50,113 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 381 statements into 1 equivalence classes.
[2025-02-05 21:42:50,191 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 381 of 381 statements.
[2025-02-05 21:42:50,192 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:42:50,192 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:42:50,195 INFO  L256         TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-02-05 21:42:50,200 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 21:42:50,418 INFO  L134       CoverageAnalysis]: Checked inductivity of 6612 backedges. 2857 proven. 51 refuted. 0 times theorem prover too weak. 3704 trivial. 0 not checked.
[2025-02-05 21:42:50,419 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 21:42:50,658 INFO  L134       CoverageAnalysis]: Checked inductivity of 6612 backedges. 120 proven. 51 refuted. 0 times theorem prover too weak. 6441 trivial. 0 not checked.
[2025-02-05 21:42:50,658 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [101259901] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-05 21:42:50,658 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-05 21:42:50,658 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13
[2025-02-05 21:42:50,658 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954315120]
[2025-02-05 21:42:50,658 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-05 21:42:50,659 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-02-05 21:42:50,659 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:42:50,660 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-02-05 21:42:50,660 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156
[2025-02-05 21:42:50,660 INFO  L87              Difference]: Start difference. First operand 10696 states and 16998 transitions. Second operand  has 13 states, 13 states have (on average 11.153846153846153) internal successors, (145), 13 states have internal predecessors, (145), 4 states have call successors, (92), 2 states have call predecessors, (92), 4 states have return successors, (94), 4 states have call predecessors, (94), 4 states have call successors, (94)
[2025-02-05 21:42:52,501 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:42:52,502 INFO  L93              Difference]: Finished difference Result 15297 states and 24532 transitions.
[2025-02-05 21:42:52,502 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. 
[2025-02-05 21:42:52,503 INFO  L78                 Accepts]: Start accepts. Automaton has  has 13 states, 13 states have (on average 11.153846153846153) internal successors, (145), 13 states have internal predecessors, (145), 4 states have call successors, (92), 2 states have call predecessors, (92), 4 states have return successors, (94), 4 states have call predecessors, (94), 4 states have call successors, (94) Word has length 381
[2025-02-05 21:42:52,503 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:42:52,540 INFO  L225             Difference]: With dead ends: 15297
[2025-02-05 21:42:52,540 INFO  L226             Difference]: Without dead ends: 10286
[2025-02-05 21:42:52,550 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 782 GetRequests, 760 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=385, Unknown=0, NotChecked=0, Total=552
[2025-02-05 21:42:52,551 INFO  L435           NwaCegarLoop]: 226 mSDtfsCounter, 1419 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1459 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 21:42:52,551 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1459 Valid, 882 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 21:42:52,556 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10286 states.
[2025-02-05 21:42:53,197 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10286 to 5687.
[2025-02-05 21:42:53,202 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5687 states, 4582 states have (on average 1.5366652116979485) internal successors, (7041), 4582 states have internal predecessors, (7041), 986 states have call successors, (986), 118 states have call predecessors, (986), 118 states have return successors, (986), 986 states have call predecessors, (986), 986 states have call successors, (986)
[2025-02-05 21:42:53,211 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5687 states to 5687 states and 9013 transitions.
[2025-02-05 21:42:53,218 INFO  L78                 Accepts]: Start accepts. Automaton has 5687 states and 9013 transitions. Word has length 381
[2025-02-05 21:42:53,219 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:42:53,219 INFO  L471      AbstractCegarLoop]: Abstraction has 5687 states and 9013 transitions.
[2025-02-05 21:42:53,219 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 13 states have (on average 11.153846153846153) internal successors, (145), 13 states have internal predecessors, (145), 4 states have call successors, (92), 2 states have call predecessors, (92), 4 states have return successors, (94), 4 states have call predecessors, (94), 4 states have call successors, (94)
[2025-02-05 21:42:53,220 INFO  L276                IsEmpty]: Start isEmpty. Operand 5687 states and 9013 transitions.
[2025-02-05 21:42:53,222 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 383
[2025-02-05 21:42:53,222 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:42:53,222 INFO  L218           NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:42:53,240 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2025-02-05 21:42:53,423 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2025-02-05 21:42:53,424 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:42:53,424 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:42:53,424 INFO  L85        PathProgramCache]: Analyzing trace with hash 104257216, now seen corresponding path program 1 times
[2025-02-05 21:42:53,424 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:42:53,424 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750586224]
[2025-02-05 21:42:53,424 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:42:53,424 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:42:53,449 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes.
[2025-02-05 21:42:53,545 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements.
[2025-02-05 21:42:53,546 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:42:53,546 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-02-05 21:42:53,549 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1850470338]
[2025-02-05 21:42:53,549 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:42:53,549 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 21:42:53,549 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 21:42:53,554 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 21:42:53,556 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-02-05 21:42:53,667 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes.
[2025-02-05 21:42:53,776 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements.
[2025-02-05 21:42:53,776 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:42:53,776 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 21:42:53,780 INFO  L256         TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 36 conjuncts are in the unsatisfiable core
[2025-02-05 21:42:53,789 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 21:42:55,606 INFO  L134       CoverageAnalysis]: Checked inductivity of 6612 backedges. 4199 proven. 366 refuted. 0 times theorem prover too weak. 2047 trivial. 0 not checked.
[2025-02-05 21:42:55,607 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 21:42:57,830 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 21:42:57,830 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750586224]
[2025-02-05 21:42:57,830 WARN  L311   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2025-02-05 21:42:57,830 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850470338]
[2025-02-05 21:42:57,830 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850470338] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 21:42:57,830 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences.
[2025-02-05 21:42:57,830 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20
[2025-02-05 21:42:57,831 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191578297]
[2025-02-05 21:42:57,831 INFO  L85    oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton
[2025-02-05 21:42:57,831 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 21 states
[2025-02-05 21:42:57,831 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 21:42:57,832 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants.
[2025-02-05 21:42:57,832 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=788, Unknown=0, NotChecked=0, Total=930
[2025-02-05 21:42:57,833 INFO  L87              Difference]: Start difference. First operand 5687 states and 9013 transitions. Second operand  has 21 states, 21 states have (on average 5.380952380952381) internal successors, (113), 20 states have internal predecessors, (113), 4 states have call successors, (58), 4 states have call predecessors, (58), 7 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58)
[2025-02-05 21:43:03,148 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 21:43:03,149 INFO  L93              Difference]: Finished difference Result 17348 states and 27447 transitions.
[2025-02-05 21:43:03,149 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. 
[2025-02-05 21:43:03,149 INFO  L78                 Accepts]: Start accepts. Automaton has  has 21 states, 21 states have (on average 5.380952380952381) internal successors, (113), 20 states have internal predecessors, (113), 4 states have call successors, (58), 4 states have call predecessors, (58), 7 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58) Word has length 382
[2025-02-05 21:43:03,150 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 21:43:03,183 INFO  L225             Difference]: With dead ends: 17348
[2025-02-05 21:43:03,183 INFO  L226             Difference]: Without dead ends: 12018
[2025-02-05 21:43:03,193 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1510 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1252, Invalid=4754, Unknown=0, NotChecked=0, Total=6006
[2025-02-05 21:43:03,194 INFO  L435           NwaCegarLoop]: 268 mSDtfsCounter, 1852 mSDsluCounter, 1757 mSDsCounter, 0 mSdLazyCounter, 3160 mSolverCounterSat, 696 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1882 SdHoareTripleChecker+Valid, 2025 SdHoareTripleChecker+Invalid, 3856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 696 IncrementalHoareTripleChecker+Valid, 3160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-02-05 21:43:03,194 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1882 Valid, 2025 Invalid, 3856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [696 Valid, 3160 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-02-05 21:43:03,199 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12018 states.
[2025-02-05 21:43:03,934 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12018 to 6098.
[2025-02-05 21:43:03,938 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 6098 states, 4993 states have (on average 1.5457640696975765) internal successors, (7718), 4993 states have internal predecessors, (7718), 986 states have call successors, (986), 118 states have call predecessors, (986), 118 states have return successors, (986), 986 states have call predecessors, (986), 986 states have call successors, (986)
[2025-02-05 21:43:03,945 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6098 states to 6098 states and 9690 transitions.
[2025-02-05 21:43:03,951 INFO  L78                 Accepts]: Start accepts. Automaton has 6098 states and 9690 transitions. Word has length 382
[2025-02-05 21:43:03,951 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 21:43:03,951 INFO  L471      AbstractCegarLoop]: Abstraction has 6098 states and 9690 transitions.
[2025-02-05 21:43:03,951 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 21 states, 21 states have (on average 5.380952380952381) internal successors, (113), 20 states have internal predecessors, (113), 4 states have call successors, (58), 4 states have call predecessors, (58), 7 states have return successors, (58), 4 states have call predecessors, (58), 4 states have call successors, (58)
[2025-02-05 21:43:03,951 INFO  L276                IsEmpty]: Start isEmpty. Operand 6098 states and 9690 transitions.
[2025-02-05 21:43:03,953 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 383
[2025-02-05 21:43:03,953 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 21:43:03,953 INFO  L218           NwaCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 21:43:03,962 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-02-05 21:43:04,154 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2025-02-05 21:43:04,154 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 21:43:04,154 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 21:43:04,155 INFO  L85        PathProgramCache]: Analyzing trace with hash 1670180478, now seen corresponding path program 1 times
[2025-02-05 21:43:04,155 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 21:43:04,155 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292429696]
[2025-02-05 21:43:04,155 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:43:04,155 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 21:43:04,175 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes.
[2025-02-05 21:43:04,265 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements.
[2025-02-05 21:43:04,265 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:43:04,265 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unknown
[2025-02-05 21:43:04,267 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1821032939]
[2025-02-05 21:43:04,267 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 21:43:04,267 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 21:43:04,267 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 21:43:04,269 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 21:43:04,270 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2025-02-05 21:43:04,385 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes.
[2025-02-05 21:43:04,509 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements.
[2025-02-05 21:43:04,509 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:43:04,509 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-02-05 21:43:04,509 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-02-05 21:43:04,545 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 382 statements into 1 equivalence classes.
[2025-02-05 21:43:04,634 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 382 of 382 statements.
[2025-02-05 21:43:04,634 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 21:43:04,634 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat