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


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


Checking for ERROR reachability
Using default analysis
Version c00e63dc
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem18_label40.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1a53e4c70dff58f3400fe09c8b43892b5493d2ca012910f006ca78f70be38079
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 12:11:33,426 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 12:11:33,480 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-05 12:11:33,483 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 12:11:33,484 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 12:11:33,509 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 12:11:33,509 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 12:11:33,513 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 12:11:33,514 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 12:11:33,514 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 12:11:33,514 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 12:11:33,514 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 12:11:33,514 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 12:11:33,514 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 12:11:33,514 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 12:11:33,515 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 12:11:33,515 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 12:11:33,515 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 12:11:33,515 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 12:11:33,515 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 12:11:33,515 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 12:11:33,515 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 12:11:33,515 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 12:11:33,515 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 12:11:33,515 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 12:11:33,515 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 12:11:33,515 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 12:11:33,515 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 12:11:33,515 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 12:11:33,515 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 12:11:33,515 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 12:11:33,515 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 12:11:33,515 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 12:11:33,515 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 12:11:33,515 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 12:11:33,516 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 12:11:33,516 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 12:11:33,516 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 12:11:33,516 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 12:11:33,516 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 12:11:33,516 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 12:11:33,516 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 12:11:33,516 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 12:11:33,516 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 -> 1a53e4c70dff58f3400fe09c8b43892b5493d2ca012910f006ca78f70be38079
[2025-02-05 12:11:33,772 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 12:11:33,778 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 12:11:33,779 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 12:11:33,780 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 12:11:33,780 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 12:11:33,781 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label40.c
[2025-02-05 12:11:34,945 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3562eebe/64ae98778af043faae2f814be1a24c11/FLAG05d0416a0
[2025-02-05 12:11:35,528 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 12:11:35,528 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label40.c
[2025-02-05 12:11:35,554 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3562eebe/64ae98778af043faae2f814be1a24c11/FLAG05d0416a0
[2025-02-05 12:11:35,570 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d3562eebe/64ae98778af043faae2f814be1a24c11
[2025-02-05 12:11:35,572 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 12:11:35,574 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 12:11:35,575 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 12:11:35,575 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 12:11:35,584 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 12:11:35,585 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:11:35" (1/1) ...
[2025-02-05 12:11:35,589 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f460129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:11:35, skipping insertion in model container
[2025-02-05 12:11:35,590 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 12:11:35" (1/1) ...
[2025-02-05 12:11:35,659 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 12:11:35,841 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label40.c[4742,4755]
[2025-02-05 12:11:36,375 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 12:11:36,393 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 12:11:36,438 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label40.c[4742,4755]
[2025-02-05 12:11:36,615 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 12:11:36,628 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 12:11:36,629 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:11:36 WrapperNode
[2025-02-05 12:11:36,629 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 12:11:36,630 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 12:11:36,630 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 12:11:36,630 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 12:11:36,634 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:11:36" (1/1) ...
[2025-02-05 12:11:36,660 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:11:36" (1/1) ...
[2025-02-05 12:11:36,834 INFO  L138                Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132
[2025-02-05 12:11:36,834 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 12:11:36,835 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 12:11:36,835 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 12:11:36,835 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 12:11:36,843 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:11:36" (1/1) ...
[2025-02-05 12:11:36,844 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:11:36" (1/1) ...
[2025-02-05 12:11:36,872 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:11:36" (1/1) ...
[2025-02-05 12:11:36,971 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-05 12:11:36,972 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:11:36" (1/1) ...
[2025-02-05 12:11:36,972 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:11:36" (1/1) ...
[2025-02-05 12:11:37,029 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:11:36" (1/1) ...
[2025-02-05 12:11:37,039 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:11:36" (1/1) ...
[2025-02-05 12:11:37,048 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:11:36" (1/1) ...
[2025-02-05 12:11:37,052 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:11:36" (1/1) ...
[2025-02-05 12:11:37,070 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 12:11:37,072 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 12:11:37,072 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 12:11:37,072 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 12:11:37,072 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:11:36" (1/1) ...
[2025-02-05 12:11:37,076 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 12:11:37,084 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:11:37,095 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 12:11:37,102 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 12:11:37,116 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 12:11:37,116 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 12:11:37,117 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 12:11:37,117 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 12:11:37,169 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 12:11:37,170 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 12:11:40,914 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc calculate_output_#t~ret8#1;
[2025-02-05 12:11:40,914 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: havoc calculate_output2_#t~ret9#1;
[2025-02-05 12:11:41,073 INFO  L?                        ?]: Removed 639 outVars from TransFormulas that were not future-live.
[2025-02-05 12:11:41,073 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 12:11:41,102 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 12:11:41,107 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 12:11:41,107 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:11:41 BoogieIcfgContainer
[2025-02-05 12:11:41,107 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 12:11:41,109 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 12:11:41,109 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 12:11:41,116 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 12:11:41,116 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 12:11:35" (1/3) ...
[2025-02-05 12:11:41,116 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f014c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:11:41, skipping insertion in model container
[2025-02-05 12:11:41,117 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 12:11:36" (2/3) ...
[2025-02-05 12:11:41,117 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f014c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 12:11:41, skipping insertion in model container
[2025-02-05 12:11:41,117 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 12:11:41" (3/3) ...
[2025-02-05 12:11:41,118 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem18_label40.c
[2025-02-05 12:11:41,132 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 12:11:41,135 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label40.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 12:11:41,199 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 12:11:41,209 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;@2b721e97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 12:11:41,210 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 12:11:41,215 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:11:41,220 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 45
[2025-02-05 12:11:41,221 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:11:41,221 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:11:41,222 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:11:41,226 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:11:41,226 INFO  L85        PathProgramCache]: Analyzing trace with hash -1247574331, now seen corresponding path program 1 times
[2025-02-05 12:11:41,232 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:11:41,232 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845756753]
[2025-02-05 12:11:41,233 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:11:41,233 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:11:41,293 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes.
[2025-02-05 12:11:41,318 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements.
[2025-02-05 12:11:41,319 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:11:41,319 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:11:41,477 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:11:41,478 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:11:41,478 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845756753]
[2025-02-05 12:11:41,478 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845756753] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:11:41,478 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:11:41,479 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 12:11:41,479 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104049738]
[2025-02-05 12:11:41,480 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:11:41,482 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:11:41,482 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:11:41,493 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:11:41,494 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:11:41,496 INFO  L87              Difference]: Start difference. First operand  has 757 states, 755 states have (on average 1.9112582781456953) internal successors, (1443), 756 states have internal predecessors, (1443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:11:44,354 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:11:44,355 INFO  L93              Difference]: Finished difference Result 2205 states and 4263 transitions.
[2025-02-05 12:11:44,356 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:11:44,357 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 44
[2025-02-05 12:11:44,357 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:11:44,374 INFO  L225             Difference]: With dead ends: 2205
[2025-02-05 12:11:44,375 INFO  L226             Difference]: Without dead ends: 1384
[2025-02-05 12:11:44,381 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:11:44,383 INFO  L435           NwaCegarLoop]: 421 mSDtfsCounter, 675 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2232 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 2762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 2232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time
[2025-02-05 12:11:44,384 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 430 Invalid, 2762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 2232 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time]
[2025-02-05 12:11:44,400 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1384 states.
[2025-02-05 12:11:44,498 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384.
[2025-02-05 12:11:44,501 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1384 states, 1383 states have (on average 1.6514822848879247) internal successors, (2284), 1383 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:11:44,508 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2284 transitions.
[2025-02-05 12:11:44,510 INFO  L78                 Accepts]: Start accepts. Automaton has 1384 states and 2284 transitions. Word has length 44
[2025-02-05 12:11:44,510 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:11:44,510 INFO  L471      AbstractCegarLoop]: Abstraction has 1384 states and 2284 transitions.
[2025-02-05 12:11:44,510 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:11:44,511 INFO  L276                IsEmpty]: Start isEmpty. Operand 1384 states and 2284 transitions.
[2025-02-05 12:11:44,513 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 111
[2025-02-05 12:11:44,513 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:11:44,513 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:11:44,514 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 12:11:44,514 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:11:44,515 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:11:44,515 INFO  L85        PathProgramCache]: Analyzing trace with hash 1954742297, now seen corresponding path program 1 times
[2025-02-05 12:11:44,515 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:11:44,515 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52935099]
[2025-02-05 12:11:44,515 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:11:44,515 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:11:44,532 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes.
[2025-02-05 12:11:44,583 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements.
[2025-02-05 12:11:44,584 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:11:44,584 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:11:44,766 INFO  L134       CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:11:44,767 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:11:44,767 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52935099]
[2025-02-05 12:11:44,767 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52935099] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:11:44,767 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:11:44,767 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 12:11:44,767 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049259897]
[2025-02-05 12:11:44,768 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:11:44,769 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:11:44,769 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:11:44,770 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:11:44,770 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:11:44,771 INFO  L87              Difference]: Start difference. First operand 1384 states and 2284 transitions. Second operand  has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:11:46,971 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:11:46,971 INFO  L93              Difference]: Finished difference Result 4146 states and 6847 transitions.
[2025-02-05 12:11:46,972 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:11:46,972 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110
[2025-02-05 12:11:46,972 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:11:46,981 INFO  L225             Difference]: With dead ends: 4146
[2025-02-05 12:11:46,981 INFO  L226             Difference]: Without dead ends: 2764
[2025-02-05 12:11:46,984 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:11:46,985 INFO  L435           NwaCegarLoop]: 526 mSDtfsCounter, 712 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-02-05 12:11:46,985 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 531 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-02-05 12:11:46,988 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2764 states.
[2025-02-05 12:11:47,062 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2764.
[2025-02-05 12:11:47,066 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2764 states, 2763 states have (on average 1.404632645674991) internal successors, (3881), 2763 states have internal predecessors, (3881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:11:47,075 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 3881 transitions.
[2025-02-05 12:11:47,076 INFO  L78                 Accepts]: Start accepts. Automaton has 2764 states and 3881 transitions. Word has length 110
[2025-02-05 12:11:47,077 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:11:47,077 INFO  L471      AbstractCegarLoop]: Abstraction has 2764 states and 3881 transitions.
[2025-02-05 12:11:47,077 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:11:47,078 INFO  L276                IsEmpty]: Start isEmpty. Operand 2764 states and 3881 transitions.
[2025-02-05 12:11:47,082 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2025-02-05 12:11:47,082 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:11:47,082 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:11:47,082 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 12:11:47,083 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:11:47,084 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:11:47,084 INFO  L85        PathProgramCache]: Analyzing trace with hash 394103283, now seen corresponding path program 1 times
[2025-02-05 12:11:47,084 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:11:47,084 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992852706]
[2025-02-05 12:11:47,084 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:11:47,084 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:11:47,101 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes.
[2025-02-05 12:11:47,119 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements.
[2025-02-05 12:11:47,121 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:11:47,121 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:11:47,258 INFO  L134       CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:11:47,259 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:11:47,259 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992852706]
[2025-02-05 12:11:47,259 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992852706] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:11:47,259 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:11:47,259 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 12:11:47,259 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760312182]
[2025-02-05 12:11:47,259 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:11:47,259 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:11:47,259 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:11:47,260 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:11:47,260 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:11:47,260 INFO  L87              Difference]: Start difference. First operand 2764 states and 3881 transitions. Second operand  has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:11:49,411 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:11:49,412 INFO  L93              Difference]: Finished difference Result 8288 states and 11639 transitions.
[2025-02-05 12:11:49,413 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:11:49,413 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111
[2025-02-05 12:11:49,413 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:11:49,450 INFO  L225             Difference]: With dead ends: 8288
[2025-02-05 12:11:49,453 INFO  L226             Difference]: Without dead ends: 5526
[2025-02-05 12:11:49,456 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:11:49,457 INFO  L435           NwaCegarLoop]: 428 mSDtfsCounter, 709 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1994 mSolverCounterSat, 672 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 672 IncrementalHoareTripleChecker+Valid, 1994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time
[2025-02-05 12:11:49,457 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 434 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [672 Valid, 1994 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time]
[2025-02-05 12:11:49,466 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5526 states.
[2025-02-05 12:11:49,542 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5526 to 5524.
[2025-02-05 12:11:49,548 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5524 states, 5523 states have (on average 1.2657975737823646) internal successors, (6991), 5523 states have internal predecessors, (6991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:11:49,555 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 6991 transitions.
[2025-02-05 12:11:49,556 INFO  L78                 Accepts]: Start accepts. Automaton has 5524 states and 6991 transitions. Word has length 111
[2025-02-05 12:11:49,556 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:11:49,556 INFO  L471      AbstractCegarLoop]: Abstraction has 5524 states and 6991 transitions.
[2025-02-05 12:11:49,556 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:11:49,556 INFO  L276                IsEmpty]: Start isEmpty. Operand 5524 states and 6991 transitions.
[2025-02-05 12:11:49,558 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2025-02-05 12:11:49,558 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:11:49,558 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:11:49,558 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 12:11:49,558 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:11:49,559 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:11:49,559 INFO  L85        PathProgramCache]: Analyzing trace with hash 547723666, now seen corresponding path program 1 times
[2025-02-05 12:11:49,559 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:11:49,559 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716720767]
[2025-02-05 12:11:49,559 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:11:49,559 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:11:49,573 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes.
[2025-02-05 12:11:49,583 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements.
[2025-02-05 12:11:49,584 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:11:49,584 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:11:49,861 INFO  L134       CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:11:49,861 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:11:49,861 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716720767]
[2025-02-05 12:11:49,861 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716720767] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:11:49,861 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:11:49,861 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:11:49,862 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042045249]
[2025-02-05 12:11:49,862 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:11:49,862 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:11:49,862 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:11:49,862 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:11:49,862 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:11:49,863 INFO  L87              Difference]: Start difference. First operand 5524 states and 6991 transitions. Second operand  has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:11:52,784 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:11:52,784 INFO  L93              Difference]: Finished difference Result 13808 states and 17091 transitions.
[2025-02-05 12:11:52,785 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:11:52,785 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137
[2025-02-05 12:11:52,785 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:11:52,804 INFO  L225             Difference]: With dead ends: 13808
[2025-02-05 12:11:52,805 INFO  L226             Difference]: Without dead ends: 8286
[2025-02-05 12:11:52,810 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 12:11:52,810 INFO  L435           NwaCegarLoop]: 625 mSDtfsCounter, 1925 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 4350 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1925 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 4467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 4350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time
[2025-02-05 12:11:52,811 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1925 Valid, 643 Invalid, 4467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 4350 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time]
[2025-02-05 12:11:52,817 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8286 states.
[2025-02-05 12:11:52,944 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8286 to 8284.
[2025-02-05 12:11:52,953 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8284 states, 8283 states have (on average 1.202100688156465) internal successors, (9957), 8283 states have internal predecessors, (9957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:11:52,962 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8284 states to 8284 states and 9957 transitions.
[2025-02-05 12:11:52,963 INFO  L78                 Accepts]: Start accepts. Automaton has 8284 states and 9957 transitions. Word has length 137
[2025-02-05 12:11:52,963 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:11:52,963 INFO  L471      AbstractCegarLoop]: Abstraction has 8284 states and 9957 transitions.
[2025-02-05 12:11:52,963 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:11:52,963 INFO  L276                IsEmpty]: Start isEmpty. Operand 8284 states and 9957 transitions.
[2025-02-05 12:11:52,964 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 227
[2025-02-05 12:11:52,965 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:11:52,965 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:11:52,965 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 12:11:52,965 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:11:52,965 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:11:52,965 INFO  L85        PathProgramCache]: Analyzing trace with hash -1433811977, now seen corresponding path program 1 times
[2025-02-05 12:11:52,966 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:11:52,966 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34389156]
[2025-02-05 12:11:52,966 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:11:52,966 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:11:52,980 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes.
[2025-02-05 12:11:52,996 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements.
[2025-02-05 12:11:52,996 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:11:52,996 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:11:53,277 INFO  L134       CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:11:53,279 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:11:53,279 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34389156]
[2025-02-05 12:11:53,279 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34389156] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:11:53,279 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477819109]
[2025-02-05 12:11:53,279 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:11:53,279 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:11:53,279 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:11:53,281 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 12:11:53,283 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-05 12:11:53,326 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes.
[2025-02-05 12:11:53,359 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements.
[2025-02-05 12:11:53,359 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:11:53,359 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:11:53,360 INFO  L256         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 12:11:53,366 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 12:11:53,435 INFO  L134       CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:11:53,435 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 12:11:53,435 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [477819109] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:11:53,435 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 12:11:53,435 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6
[2025-02-05 12:11:53,435 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515900936]
[2025-02-05 12:11:53,435 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:11:53,436 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:11:53,436 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:11:53,436 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:11:53,436 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 12:11:53,437 INFO  L87              Difference]: Start difference. First operand 8284 states and 9957 transitions. Second operand  has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:11:55,790 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:11:55,790 INFO  L93              Difference]: Finished difference Result 22086 states and 26900 transitions.
[2025-02-05 12:11:55,791 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:11:55,791 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 226
[2025-02-05 12:11:55,791 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:11:55,837 INFO  L225             Difference]: With dead ends: 22086
[2025-02-05 12:11:55,838 INFO  L226             Difference]: Without dead ends: 13804
[2025-02-05 12:11:55,849 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-05 12:11:55,850 INFO  L435           NwaCegarLoop]: 1316 mSDtfsCounter, 649 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1968 mSolverCounterSat, 753 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 649 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 2721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 753 IncrementalHoareTripleChecker+Valid, 1968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time
[2025-02-05 12:11:55,850 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [649 Valid, 1323 Invalid, 2721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [753 Valid, 1968 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time]
[2025-02-05 12:11:55,872 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 13804 states.
[2025-02-05 12:11:56,105 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 13804 to 12424.
[2025-02-05 12:11:56,130 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 12424 states, 12423 states have (on average 1.1787007969089591) internal successors, (14643), 12423 states have internal predecessors, (14643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:11:56,148 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 12424 states to 12424 states and 14643 transitions.
[2025-02-05 12:11:56,148 INFO  L78                 Accepts]: Start accepts. Automaton has 12424 states and 14643 transitions. Word has length 226
[2025-02-05 12:11:56,149 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:11:56,149 INFO  L471      AbstractCegarLoop]: Abstraction has 12424 states and 14643 transitions.
[2025-02-05 12:11:56,149 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:11:56,149 INFO  L276                IsEmpty]: Start isEmpty. Operand 12424 states and 14643 transitions.
[2025-02-05 12:11:56,151 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 345
[2025-02-05 12:11:56,151 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:11:56,153 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:11:56,169 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 12:11:56,354 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:11:56,355 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:11:56,355 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:11:56,355 INFO  L85        PathProgramCache]: Analyzing trace with hash -330807223, now seen corresponding path program 1 times
[2025-02-05 12:11:56,355 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:11:56,355 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048583961]
[2025-02-05 12:11:56,355 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:11:56,355 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:11:56,380 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes.
[2025-02-05 12:11:56,395 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements.
[2025-02-05 12:11:56,395 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:11:56,395 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:11:56,816 INFO  L134       CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:11:56,817 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:11:56,818 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048583961]
[2025-02-05 12:11:56,818 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048583961] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:11:56,818 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:11:56,818 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:11:56,818 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176424204]
[2025-02-05 12:11:56,818 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:11:56,819 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:11:56,819 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:11:56,820 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:11:56,820 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:11:56,824 INFO  L87              Difference]: Start difference. First operand 12424 states and 14643 transitions. Second operand  has 4 states, 4 states have (on average 86.0) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:11:59,079 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:11:59,080 INFO  L93              Difference]: Finished difference Result 27661 states and 32159 transitions.
[2025-02-05 12:11:59,080 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:11:59,080 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 86.0) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 344
[2025-02-05 12:11:59,081 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:11:59,103 INFO  L225             Difference]: With dead ends: 27661
[2025-02-05 12:11:59,103 INFO  L226             Difference]: Without dead ends: 15186
[2025-02-05 12:11:59,110 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:11:59,112 INFO  L435           NwaCegarLoop]: 626 mSDtfsCounter, 531 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 531 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 2973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time
[2025-02-05 12:11:59,112 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [531 Valid, 639 Invalid, 2973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 2592 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time]
[2025-02-05 12:11:59,121 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 15186 states.
[2025-02-05 12:11:59,240 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 15186 to 15184.
[2025-02-05 12:11:59,255 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 15184 states, 15183 states have (on average 1.1130211420667853) internal successors, (16899), 15183 states have internal predecessors, (16899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:11:59,272 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15184 states to 15184 states and 16899 transitions.
[2025-02-05 12:11:59,272 INFO  L78                 Accepts]: Start accepts. Automaton has 15184 states and 16899 transitions. Word has length 344
[2025-02-05 12:11:59,273 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:11:59,273 INFO  L471      AbstractCegarLoop]: Abstraction has 15184 states and 16899 transitions.
[2025-02-05 12:11:59,273 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 86.0) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:11:59,273 INFO  L276                IsEmpty]: Start isEmpty. Operand 15184 states and 16899 transitions.
[2025-02-05 12:11:59,277 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 411
[2025-02-05 12:11:59,277 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:11:59,277 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:11:59,277 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 12:11:59,278 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:11:59,278 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:11:59,278 INFO  L85        PathProgramCache]: Analyzing trace with hash -905127139, now seen corresponding path program 1 times
[2025-02-05 12:11:59,278 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:11:59,278 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093200373]
[2025-02-05 12:11:59,278 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:11:59,278 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:11:59,303 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes.
[2025-02-05 12:11:59,322 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements.
[2025-02-05 12:11:59,322 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:11:59,322 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:11:59,515 INFO  L134       CoverageAnalysis]: Checked inductivity of 149 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:11:59,516 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:11:59,516 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093200373]
[2025-02-05 12:11:59,516 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093200373] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:11:59,516 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:11:59,516 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:11:59,516 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477460130]
[2025-02-05 12:11:59,516 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:11:59,516 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:11:59,516 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:11:59,517 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:11:59,517 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:11:59,517 INFO  L87              Difference]: Start difference. First operand 15184 states and 16899 transitions. Second operand  has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:01,539 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:01,540 INFO  L93              Difference]: Finished difference Result 37266 states and 41935 transitions.
[2025-02-05 12:12:01,540 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:12:01,541 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 410
[2025-02-05 12:12:01,543 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:01,578 INFO  L225             Difference]: With dead ends: 37266
[2025-02-05 12:12:01,578 INFO  L226             Difference]: Without dead ends: 22084
[2025-02-05 12:12:01,593 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:01,594 INFO  L435           NwaCegarLoop]: 339 mSDtfsCounter, 633 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1934 mSolverCounterSat, 490 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 633 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 2424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 490 IncrementalHoareTripleChecker+Valid, 1934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:01,595 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [633 Valid, 344 Invalid, 2424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [490 Valid, 1934 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-02-05 12:12:01,614 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22084 states.
[2025-02-05 12:12:01,874 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22084 to 21394.
[2025-02-05 12:12:01,893 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 21394 states, 21393 states have (on average 1.126910671715047) internal successors, (24108), 21393 states have internal predecessors, (24108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:01,914 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21394 states to 21394 states and 24108 transitions.
[2025-02-05 12:12:01,915 INFO  L78                 Accepts]: Start accepts. Automaton has 21394 states and 24108 transitions. Word has length 410
[2025-02-05 12:12:01,916 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:12:01,916 INFO  L471      AbstractCegarLoop]: Abstraction has 21394 states and 24108 transitions.
[2025-02-05 12:12:01,916 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:01,916 INFO  L276                IsEmpty]: Start isEmpty. Operand 21394 states and 24108 transitions.
[2025-02-05 12:12:01,921 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 429
[2025-02-05 12:12:01,921 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:01,921 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:12:01,922 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 12:12:01,922 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:12:01,922 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:12:01,922 INFO  L85        PathProgramCache]: Analyzing trace with hash 1538772688, now seen corresponding path program 1 times
[2025-02-05 12:12:01,922 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:12:01,922 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671955168]
[2025-02-05 12:12:01,922 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:01,922 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:12:01,953 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 428 statements into 1 equivalence classes.
[2025-02-05 12:12:01,974 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 428 of 428 statements.
[2025-02-05 12:12:01,974 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:01,974 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:02,254 INFO  L134       CoverageAnalysis]: Checked inductivity of 167 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 12:12:02,254 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:12:02,254 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671955168]
[2025-02-05 12:12:02,254 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671955168] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:12:02,254 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:12:02,254 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 12:12:02,254 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007426802]
[2025-02-05 12:12:02,254 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:12:02,254 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:12:02,254 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:12:02,255 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:12:02,255 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:02,255 INFO  L87              Difference]: Start difference. First operand 21394 states and 24108 transitions. Second operand  has 3 states, 3 states have (on average 115.0) internal successors, (345), 2 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:04,006 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:04,007 INFO  L93              Difference]: Finished difference Result 49686 states and 55870 transitions.
[2025-02-05 12:12:04,011 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:12:04,011 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 115.0) internal successors, (345), 2 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 428
[2025-02-05 12:12:04,012 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:04,067 INFO  L225             Difference]: With dead ends: 49686
[2025-02-05 12:12:04,067 INFO  L226             Difference]: Without dead ends: 28294
[2025-02-05 12:12:04,092 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:04,093 INFO  L435           NwaCegarLoop]: 76 mSDtfsCounter, 465 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1794 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 2311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 1794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:04,093 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 81 Invalid, 2311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 1794 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-02-05 12:12:04,115 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 28294 states.
[2025-02-05 12:12:04,406 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 28294 to 28294.
[2025-02-05 12:12:04,432 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 28294 states, 28293 states have (on average 1.1052557169617927) internal successors, (31271), 28293 states have internal predecessors, (31271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:04,469 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28294 states to 28294 states and 31271 transitions.
[2025-02-05 12:12:04,470 INFO  L78                 Accepts]: Start accepts. Automaton has 28294 states and 31271 transitions. Word has length 428
[2025-02-05 12:12:04,470 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:12:04,471 INFO  L471      AbstractCegarLoop]: Abstraction has 28294 states and 31271 transitions.
[2025-02-05 12:12:04,471 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 115.0) internal successors, (345), 2 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:04,471 INFO  L276                IsEmpty]: Start isEmpty. Operand 28294 states and 31271 transitions.
[2025-02-05 12:12:04,478 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 462
[2025-02-05 12:12:04,479 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:04,479 INFO  L218           NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:12:04,479 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 12:12:04,479 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:12:04,480 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:12:04,480 INFO  L85        PathProgramCache]: Analyzing trace with hash 1208096557, now seen corresponding path program 1 times
[2025-02-05 12:12:04,481 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:12:04,481 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835774478]
[2025-02-05 12:12:04,481 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:04,481 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:12:04,524 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 461 statements into 1 equivalence classes.
[2025-02-05 12:12:04,543 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 461 of 461 statements.
[2025-02-05 12:12:04,544 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:04,544 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:04,915 INFO  L134       CoverageAnalysis]: Checked inductivity of 200 backedges. 200 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-05 12:12:04,917 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:12:04,917 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835774478]
[2025-02-05 12:12:04,917 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835774478] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:12:04,917 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:12:04,917 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:12:04,917 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123592383]
[2025-02-05 12:12:04,917 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:12:04,918 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:12:04,919 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:12:04,919 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:12:04,919 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:04,920 INFO  L87              Difference]: Start difference. First operand 28294 states and 31271 transitions. Second operand  has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:06,833 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:06,833 INFO  L93              Difference]: Finished difference Result 62796 states and 69558 transitions.
[2025-02-05 12:12:06,834 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:12:06,834 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 461
[2025-02-05 12:12:06,834 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:06,905 INFO  L225             Difference]: With dead ends: 62796
[2025-02-05 12:12:06,908 INFO  L226             Difference]: Without dead ends: 34504
[2025-02-05 12:12:06,926 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:06,927 INFO  L435           NwaCegarLoop]: 972 mSDtfsCounter, 575 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 264 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 264 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:06,927 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 979 Invalid, 2219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [264 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-02-05 12:12:06,942 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 34504 states.
[2025-02-05 12:12:07,106 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 34504 to 33124.
[2025-02-05 12:12:07,131 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 33124 states, 33123 states have (on average 1.0961869395888053) internal successors, (36309), 33123 states have internal predecessors, (36309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:07,160 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33124 states to 33124 states and 36309 transitions.
[2025-02-05 12:12:07,160 INFO  L78                 Accepts]: Start accepts. Automaton has 33124 states and 36309 transitions. Word has length 461
[2025-02-05 12:12:07,161 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:12:07,161 INFO  L471      AbstractCegarLoop]: Abstraction has 33124 states and 36309 transitions.
[2025-02-05 12:12:07,161 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:07,161 INFO  L276                IsEmpty]: Start isEmpty. Operand 33124 states and 36309 transitions.
[2025-02-05 12:12:07,164 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 497
[2025-02-05 12:12:07,164 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:07,165 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:12:07,165 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 12:12:07,165 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:12:07,168 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:12:07,168 INFO  L85        PathProgramCache]: Analyzing trace with hash -1430024645, now seen corresponding path program 1 times
[2025-02-05 12:12:07,168 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:12:07,168 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722695089]
[2025-02-05 12:12:07,168 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:07,168 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:12:07,196 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 496 statements into 1 equivalence classes.
[2025-02-05 12:12:07,213 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 496 of 496 statements.
[2025-02-05 12:12:07,214 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:07,214 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:07,447 INFO  L134       CoverageAnalysis]: Checked inductivity of 343 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked.
[2025-02-05 12:12:07,447 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:12:07,447 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722695089]
[2025-02-05 12:12:07,447 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722695089] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:12:07,448 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:12:07,448 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:12:07,448 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984400190]
[2025-02-05 12:12:07,448 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:12:07,448 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:12:07,448 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:12:07,449 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:12:07,449 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:07,449 INFO  L87              Difference]: Start difference. First operand 33124 states and 36309 transitions. Second operand  has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:09,313 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:09,313 INFO  L93              Difference]: Finished difference Result 74526 states and 82491 transitions.
[2025-02-05 12:12:09,314 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:12:09,314 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 496
[2025-02-05 12:12:09,315 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:09,356 INFO  L225             Difference]: With dead ends: 74526
[2025-02-05 12:12:09,356 INFO  L226             Difference]: Without dead ends: 37954
[2025-02-05 12:12:09,382 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:09,383 INFO  L435           NwaCegarLoop]: 1090 mSDtfsCounter, 657 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1870 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 1870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:09,383 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1097 Invalid, 2234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 1870 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-02-05 12:12:09,403 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 37954 states.
[2025-02-05 12:12:09,829 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 37954 to 37954.
[2025-02-05 12:12:09,857 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 37954 states, 37953 states have (on average 1.0922720206571286) internal successors, (41455), 37953 states have internal predecessors, (41455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:09,906 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 37954 states to 37954 states and 41455 transitions.
[2025-02-05 12:12:09,907 INFO  L78                 Accepts]: Start accepts. Automaton has 37954 states and 41455 transitions. Word has length 496
[2025-02-05 12:12:09,908 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:12:09,908 INFO  L471      AbstractCegarLoop]: Abstraction has 37954 states and 41455 transitions.
[2025-02-05 12:12:09,908 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:09,908 INFO  L276                IsEmpty]: Start isEmpty. Operand 37954 states and 41455 transitions.
[2025-02-05 12:12:09,914 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 539
[2025-02-05 12:12:09,914 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:09,914 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:12:09,914 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 12:12:09,915 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:12:09,915 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:12:09,915 INFO  L85        PathProgramCache]: Analyzing trace with hash -1368285638, now seen corresponding path program 1 times
[2025-02-05 12:12:09,916 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:12:09,916 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017332583]
[2025-02-05 12:12:09,916 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:09,916 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:12:09,991 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes.
[2025-02-05 12:12:10,042 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements.
[2025-02-05 12:12:10,043 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:10,043 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:10,675 INFO  L134       CoverageAnalysis]: Checked inductivity of 381 backedges. 264 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked.
[2025-02-05 12:12:10,677 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:12:10,677 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017332583]
[2025-02-05 12:12:10,677 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017332583] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:12:10,677 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:12:10,678 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 12:12:10,678 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715302424]
[2025-02-05 12:12:10,678 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:12:10,678 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 12:12:10,679 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:12:10,680 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 12:12:10,680 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 12:12:10,680 INFO  L87              Difference]: Start difference. First operand 37954 states and 41455 transitions. Second operand  has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:12,959 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:12,960 INFO  L93              Difference]: Finished difference Result 84268 states and 92739 transitions.
[2025-02-05 12:12:12,960 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:12:12,960 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 538
[2025-02-05 12:12:12,961 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:13,002 INFO  L225             Difference]: With dead ends: 84268
[2025-02-05 12:12:13,002 INFO  L226             Difference]: Without dead ends: 41486
[2025-02-05 12:12:13,027 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 12:12:13,028 INFO  L435           NwaCegarLoop]: 1054 mSDtfsCounter, 2089 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2436 mSolverCounterSat, 1148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2089 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 3584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1148 IncrementalHoareTripleChecker+Valid, 2436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:13,029 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2089 Valid, 1063 Invalid, 3584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1148 Valid, 2436 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-02-05 12:12:13,056 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 41486 states.
[2025-02-05 12:12:13,324 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 41486 to 38644.
[2025-02-05 12:12:13,352 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 38644 states, 38643 states have (on average 1.05470589757524) internal successors, (40757), 38643 states have internal predecessors, (40757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:13,402 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 38644 states to 38644 states and 40757 transitions.
[2025-02-05 12:12:13,403 INFO  L78                 Accepts]: Start accepts. Automaton has 38644 states and 40757 transitions. Word has length 538
[2025-02-05 12:12:13,404 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:12:13,404 INFO  L471      AbstractCegarLoop]: Abstraction has 38644 states and 40757 transitions.
[2025-02-05 12:12:13,404 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 84.4) internal successors, (422), 5 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:13,404 INFO  L276                IsEmpty]: Start isEmpty. Operand 38644 states and 40757 transitions.
[2025-02-05 12:12:13,414 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 678
[2025-02-05 12:12:13,415 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:13,415 INFO  L218           NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:12:13,415 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 12:12:13,415 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:12:13,416 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:12:13,416 INFO  L85        PathProgramCache]: Analyzing trace with hash 108857994, now seen corresponding path program 1 times
[2025-02-05 12:12:13,416 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:12:13,416 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685919557]
[2025-02-05 12:12:13,417 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:13,417 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:12:13,593 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 677 statements into 1 equivalence classes.
[2025-02-05 12:12:13,630 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 677 of 677 statements.
[2025-02-05 12:12:13,631 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:13,631 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:14,276 INFO  L134       CoverageAnalysis]: Checked inductivity of 543 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked.
[2025-02-05 12:12:14,276 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:12:14,276 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685919557]
[2025-02-05 12:12:14,276 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685919557] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:12:14,276 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:12:14,277 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:12:14,277 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487937670]
[2025-02-05 12:12:14,277 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:12:14,277 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:12:14,278 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:12:14,278 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:12:14,278 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:14,278 INFO  L87              Difference]: Start difference. First operand 38644 states and 40757 transitions. Second operand  has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:15,628 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:15,629 INFO  L93              Difference]: Finished difference Result 77286 states and 81512 transitions.
[2025-02-05 12:12:15,629 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:12:15,629 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 677
[2025-02-05 12:12:15,630 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:15,664 INFO  L225             Difference]: With dead ends: 77286
[2025-02-05 12:12:15,664 INFO  L226             Difference]: Without dead ends: 38644
[2025-02-05 12:12:15,687 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:15,688 INFO  L435           NwaCegarLoop]: 739 mSDtfsCounter, 753 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1674 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 1831 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:15,688 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 746 Invalid, 1831 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1674 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-02-05 12:12:15,714 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 38644 states.
[2025-02-05 12:12:15,946 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 38644 to 38644.
[2025-02-05 12:12:15,996 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 38644 states, 38643 states have (on average 1.0487798566363895) internal successors, (40528), 38643 states have internal predecessors, (40528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:16,056 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 38644 states to 38644 states and 40528 transitions.
[2025-02-05 12:12:16,057 INFO  L78                 Accepts]: Start accepts. Automaton has 38644 states and 40528 transitions. Word has length 677
[2025-02-05 12:12:16,063 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:12:16,063 INFO  L471      AbstractCegarLoop]: Abstraction has 38644 states and 40528 transitions.
[2025-02-05 12:12:16,063 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:16,063 INFO  L276                IsEmpty]: Start isEmpty. Operand 38644 states and 40528 transitions.
[2025-02-05 12:12:16,082 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 734
[2025-02-05 12:12:16,082 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:16,082 INFO  L218           NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:12:16,082 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 12:12:16,083 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:12:16,083 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:12:16,087 INFO  L85        PathProgramCache]: Analyzing trace with hash -934171310, now seen corresponding path program 1 times
[2025-02-05 12:12:16,088 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:12:16,088 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728209199]
[2025-02-05 12:12:16,088 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:16,088 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:12:16,139 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes.
[2025-02-05 12:12:16,170 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements.
[2025-02-05 12:12:16,172 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:16,175 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:17,221 INFO  L134       CoverageAnalysis]: Checked inductivity of 833 backedges. 665 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked.
[2025-02-05 12:12:17,224 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:12:17,225 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728209199]
[2025-02-05 12:12:17,225 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728209199] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:12:17,225 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:12:17,225 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:12:17,225 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184160189]
[2025-02-05 12:12:17,225 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:12:17,226 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 12:12:17,226 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:12:17,226 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 12:12:17,226 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:12:17,227 INFO  L87              Difference]: Start difference. First operand 38644 states and 40528 transitions. Second operand  has 4 states, 4 states have (on average 152.25) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:19,863 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:19,863 INFO  L93              Difference]: Finished difference Result 78666 states and 82438 transitions.
[2025-02-05 12:12:19,863 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:12:19,864 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 152.25) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 733
[2025-02-05 12:12:19,864 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:19,892 INFO  L225             Difference]: With dead ends: 78666
[2025-02-05 12:12:19,892 INFO  L226             Difference]: Without dead ends: 40024
[2025-02-05 12:12:19,907 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 12:12:19,909 INFO  L435           NwaCegarLoop]: 84 mSDtfsCounter, 1006 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 2699 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1006 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 3058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 2699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:19,909 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1006 Valid, 94 Invalid, 3058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 2699 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time]
[2025-02-05 12:12:19,927 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 40024 states.
[2025-02-05 12:12:20,139 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 40024 to 39334.
[2025-02-05 12:12:20,163 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 39334 states, 39333 states have (on average 1.041974931990949) internal successors, (40984), 39333 states have internal predecessors, (40984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:20,197 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 39334 states to 39334 states and 40984 transitions.
[2025-02-05 12:12:20,197 INFO  L78                 Accepts]: Start accepts. Automaton has 39334 states and 40984 transitions. Word has length 733
[2025-02-05 12:12:20,198 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:12:20,198 INFO  L471      AbstractCegarLoop]: Abstraction has 39334 states and 40984 transitions.
[2025-02-05 12:12:20,198 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 152.25) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:20,198 INFO  L276                IsEmpty]: Start isEmpty. Operand 39334 states and 40984 transitions.
[2025-02-05 12:12:20,210 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1277
[2025-02-05 12:12:20,210 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:20,211 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:12:20,211 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 12:12:20,211 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:12:20,212 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:12:20,212 INFO  L85        PathProgramCache]: Analyzing trace with hash -2127228909, now seen corresponding path program 1 times
[2025-02-05 12:12:20,212 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:12:20,212 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477518712]
[2025-02-05 12:12:20,212 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:20,212 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:12:20,314 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1276 statements into 1 equivalence classes.
[2025-02-05 12:12:20,362 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1276 of 1276 statements.
[2025-02-05 12:12:20,362 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:20,362 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:22,341 INFO  L134       CoverageAnalysis]: Checked inductivity of 1594 backedges. 570 proven. 938 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked.
[2025-02-05 12:12:22,342 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:12:22,342 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477518712]
[2025-02-05 12:12:22,342 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477518712] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:12:22,342 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23394794]
[2025-02-05 12:12:22,342 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:22,343 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:12:22,343 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:12:22,345 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 12:12:22,346 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2025-02-05 12:12:22,464 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1276 statements into 1 equivalence classes.
[2025-02-05 12:12:22,632 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1276 of 1276 statements.
[2025-02-05 12:12:22,632 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:22,632 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:22,637 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1463 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 12:12:22,649 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 12:12:22,799 INFO  L134       CoverageAnalysis]: Checked inductivity of 1594 backedges. 544 proven. 0 refuted. 0 times theorem prover too weak. 1050 trivial. 0 not checked.
[2025-02-05 12:12:22,799 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 12:12:22,800 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [23394794] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:12:22,800 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 12:12:22,800 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9
[2025-02-05 12:12:22,800 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102133180]
[2025-02-05 12:12:22,800 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:12:22,801 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:12:22,801 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:12:22,801 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:12:22,801 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2025-02-05 12:12:22,801 INFO  L87              Difference]: Start difference. First operand 39334 states and 40984 transitions. Second operand  has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:24,418 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:24,419 INFO  L93              Difference]: Finished difference Result 79356 states and 82666 transitions.
[2025-02-05 12:12:24,419 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:12:24,419 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1276
[2025-02-05 12:12:24,420 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:24,458 INFO  L225             Difference]: With dead ends: 79356
[2025-02-05 12:12:24,458 INFO  L226             Difference]: Without dead ends: 39334
[2025-02-05 12:12:24,480 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1283 GetRequests, 1276 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72
[2025-02-05 12:12:24,481 INFO  L435           NwaCegarLoop]: 799 mSDtfsCounter, 642 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:24,481 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [642 Valid, 805 Invalid, 1861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1652 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-02-05 12:12:24,507 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 39334 states.
[2025-02-05 12:12:24,718 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 39334 to 38644.
[2025-02-05 12:12:24,745 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 38644 states, 38643 states have (on average 1.0391015190332014) internal successors, (40154), 38643 states have internal predecessors, (40154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:24,778 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 38644 states to 38644 states and 40154 transitions.
[2025-02-05 12:12:24,778 INFO  L78                 Accepts]: Start accepts. Automaton has 38644 states and 40154 transitions. Word has length 1276
[2025-02-05 12:12:24,779 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:12:24,779 INFO  L471      AbstractCegarLoop]: Abstraction has 38644 states and 40154 transitions.
[2025-02-05 12:12:24,779 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 215.66666666666666) internal successors, (647), 3 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:24,779 INFO  L276                IsEmpty]: Start isEmpty. Operand 38644 states and 40154 transitions.
[2025-02-05 12:12:24,794 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1328
[2025-02-05 12:12:24,794 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:24,795 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:12:24,802 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2025-02-05 12:12:24,999 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:12:24,999 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:12:24,999 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:12:25,000 INFO  L85        PathProgramCache]: Analyzing trace with hash 1804390257, now seen corresponding path program 1 times
[2025-02-05 12:12:25,000 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:12:25,000 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486857947]
[2025-02-05 12:12:25,000 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:25,000 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:12:25,065 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1327 statements into 1 equivalence classes.
[2025-02-05 12:12:25,101 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1327 of 1327 statements.
[2025-02-05 12:12:25,102 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:25,102 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:25,614 INFO  L134       CoverageAnalysis]: Checked inductivity of 2025 backedges. 1151 proven. 0 refuted. 0 times theorem prover too weak. 874 trivial. 0 not checked.
[2025-02-05 12:12:25,614 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:12:25,614 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486857947]
[2025-02-05 12:12:25,615 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486857947] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:12:25,615 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:12:25,615 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:12:25,615 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670651617]
[2025-02-05 12:12:25,615 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:12:25,616 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:12:25,616 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:12:25,617 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:12:25,617 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:25,617 INFO  L87              Difference]: Start difference. First operand 38644 states and 40154 transitions. Second operand  has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:27,319 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:27,320 INFO  L93              Difference]: Finished difference Result 89706 states and 93614 transitions.
[2025-02-05 12:12:27,320 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:12:27,320 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1327
[2025-02-05 12:12:27,321 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:27,374 INFO  L225             Difference]: With dead ends: 89706
[2025-02-05 12:12:27,374 INFO  L226             Difference]: Without dead ends: 51754
[2025-02-05 12:12:27,400 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:27,401 INFO  L435           NwaCegarLoop]: 871 mSDtfsCounter, 533 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1743 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 1905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 1743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:27,401 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 878 Invalid, 1905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 1743 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-02-05 12:12:27,431 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 51754 states.
[2025-02-05 12:12:27,843 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 51754 to 51064.
[2025-02-05 12:12:27,872 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51064 states, 51063 states have (on average 1.0370718524176017) internal successors, (52956), 51063 states have internal predecessors, (52956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:27,935 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51064 states to 51064 states and 52956 transitions.
[2025-02-05 12:12:27,935 INFO  L78                 Accepts]: Start accepts. Automaton has 51064 states and 52956 transitions. Word has length 1327
[2025-02-05 12:12:27,936 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:12:27,936 INFO  L471      AbstractCegarLoop]: Abstraction has 51064 states and 52956 transitions.
[2025-02-05 12:12:27,936 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:27,937 INFO  L276                IsEmpty]: Start isEmpty. Operand 51064 states and 52956 transitions.
[2025-02-05 12:12:27,962 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1369
[2025-02-05 12:12:27,962 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:27,963 INFO  L218           NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:12:27,963 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 12:12:27,963 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:12:27,963 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:12:27,964 INFO  L85        PathProgramCache]: Analyzing trace with hash 277925400, now seen corresponding path program 1 times
[2025-02-05 12:12:27,964 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:12:27,964 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821378179]
[2025-02-05 12:12:27,964 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:27,964 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:12:28,056 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1368 statements into 1 equivalence classes.
[2025-02-05 12:12:28,125 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1368 of 1368 statements.
[2025-02-05 12:12:28,126 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:28,129 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:29,108 INFO  L134       CoverageAnalysis]: Checked inductivity of 2783 backedges. 1606 proven. 0 refuted. 0 times theorem prover too weak. 1177 trivial. 0 not checked.
[2025-02-05 12:12:29,108 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:12:29,109 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821378179]
[2025-02-05 12:12:29,109 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821378179] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:12:29,109 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:12:29,109 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 12:12:29,109 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052999310]
[2025-02-05 12:12:29,109 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:12:29,110 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 12:12:29,110 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:12:29,110 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 12:12:29,110 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 12:12:29,110 INFO  L87              Difference]: Start difference. First operand 51064 states and 52956 transitions. Second operand  has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:30,809 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:30,810 INFO  L93              Difference]: Finished difference Result 101537 states and 105320 transitions.
[2025-02-05 12:12:30,810 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 12:12:30,810 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1368
[2025-02-05 12:12:30,811 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:30,860 INFO  L225             Difference]: With dead ends: 101537
[2025-02-05 12:12:30,860 INFO  L226             Difference]: Without dead ends: 51165
[2025-02-05 12:12:30,887 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 12:12:30,888 INFO  L435           NwaCegarLoop]: 934 mSDtfsCounter, 2010 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2431 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2010 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 2750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 2431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:30,888 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2010 Valid, 943 Invalid, 2750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 2431 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-02-05 12:12:30,919 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 51165 states.
[2025-02-05 12:12:31,182 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 51165 to 51064.
[2025-02-05 12:12:31,216 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51064 states, 51063 states have (on average 1.035093903609267) internal successors, (52855), 51063 states have internal predecessors, (52855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:31,258 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51064 states to 51064 states and 52855 transitions.
[2025-02-05 12:12:31,259 INFO  L78                 Accepts]: Start accepts. Automaton has 51064 states and 52855 transitions. Word has length 1368
[2025-02-05 12:12:31,259 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:12:31,259 INFO  L471      AbstractCegarLoop]: Abstraction has 51064 states and 52855 transitions.
[2025-02-05 12:12:31,259 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 140.8) internal successors, (704), 5 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:31,259 INFO  L276                IsEmpty]: Start isEmpty. Operand 51064 states and 52855 transitions.
[2025-02-05 12:12:31,275 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1380
[2025-02-05 12:12:31,275 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:31,276 INFO  L218           NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:12:31,276 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-05 12:12:31,276 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:12:31,276 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:12:31,276 INFO  L85        PathProgramCache]: Analyzing trace with hash -949599960, now seen corresponding path program 1 times
[2025-02-05 12:12:31,277 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:12:31,277 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151031906]
[2025-02-05 12:12:31,277 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:31,277 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:12:31,326 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1379 statements into 1 equivalence classes.
[2025-02-05 12:12:31,360 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1379 of 1379 statements.
[2025-02-05 12:12:31,360 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:31,361 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:31,985 INFO  L134       CoverageAnalysis]: Checked inductivity of 2416 backedges. 780 proven. 0 refuted. 0 times theorem prover too weak. 1636 trivial. 0 not checked.
[2025-02-05 12:12:31,986 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:12:31,986 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151031906]
[2025-02-05 12:12:31,986 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151031906] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:12:31,986 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:12:31,986 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:12:31,986 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795670410]
[2025-02-05 12:12:31,986 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:12:31,987 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:12:31,987 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:12:31,987 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:12:31,987 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:31,988 INFO  L87              Difference]: Start difference. First operand 51064 states and 52855 transitions. Second operand  has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:33,669 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:33,670 INFO  L93              Difference]: Finished difference Result 111096 states and 115372 transitions.
[2025-02-05 12:12:33,670 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:12:33,670 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1379
[2025-02-05 12:12:33,672 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:33,747 INFO  L225             Difference]: With dead ends: 111096
[2025-02-05 12:12:33,747 INFO  L226             Difference]: Without dead ends: 60724
[2025-02-05 12:12:33,787 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:33,788 INFO  L435           NwaCegarLoop]: 266 mSDtfsCounter, 613 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1743 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 1743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:33,788 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 271 Invalid, 1965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 1743 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-02-05 12:12:33,972 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 60724 states.
[2025-02-05 12:12:34,319 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 60724 to 51754.
[2025-02-05 12:12:34,357 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 51754 states, 51753 states have (on average 1.0348192375321237) internal successors, (53555), 51753 states have internal predecessors, (53555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:34,419 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 51754 states to 51754 states and 53555 transitions.
[2025-02-05 12:12:34,420 INFO  L78                 Accepts]: Start accepts. Automaton has 51754 states and 53555 transitions. Word has length 1379
[2025-02-05 12:12:34,421 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:12:34,421 INFO  L471      AbstractCegarLoop]: Abstraction has 51754 states and 53555 transitions.
[2025-02-05 12:12:34,421 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 216.33333333333334) internal successors, (649), 3 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:34,421 INFO  L276                IsEmpty]: Start isEmpty. Operand 51754 states and 53555 transitions.
[2025-02-05 12:12:34,438 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1411
[2025-02-05 12:12:34,439 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:34,439 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:12:34,440 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-05 12:12:34,440 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:12:34,440 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:12:34,441 INFO  L85        PathProgramCache]: Analyzing trace with hash -220270723, now seen corresponding path program 1 times
[2025-02-05 12:12:34,441 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:12:34,441 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084157748]
[2025-02-05 12:12:34,441 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:34,441 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:12:34,508 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1410 statements into 1 equivalence classes.
[2025-02-05 12:12:34,558 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1410 of 1410 statements.
[2025-02-05 12:12:34,558 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:34,558 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:35,190 INFO  L134       CoverageAnalysis]: Checked inductivity of 2207 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 1956 trivial. 0 not checked.
[2025-02-05 12:12:35,191 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:12:35,191 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084157748]
[2025-02-05 12:12:35,191 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084157748] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:12:35,191 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:12:35,191 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:12:35,191 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818265671]
[2025-02-05 12:12:35,191 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:12:35,192 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:12:35,192 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:12:35,193 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:12:35,193 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:35,193 INFO  L87              Difference]: Start difference. First operand 51754 states and 53555 transitions. Second operand  has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:37,263 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:37,264 INFO  L93              Difference]: Finished difference Result 113166 states and 117429 transitions.
[2025-02-05 12:12:37,264 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:12:37,264 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1410
[2025-02-05 12:12:37,265 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:37,336 INFO  L225             Difference]: With dead ends: 113166
[2025-02-05 12:12:37,336 INFO  L226             Difference]: Without dead ends: 61414
[2025-02-05 12:12:37,366 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:37,367 INFO  L435           NwaCegarLoop]: 948 mSDtfsCounter, 651 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1787 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 651 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 2008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 1787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:37,367 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [651 Valid, 955 Invalid, 2008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 1787 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-02-05 12:12:37,416 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 61414 states.
[2025-02-05 12:12:38,057 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 61414 to 60034.
[2025-02-05 12:12:38,101 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 60034 states, 60033 states have (on average 1.0336814751886463) internal successors, (62055), 60033 states have internal predecessors, (62055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:38,197 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 60034 states to 60034 states and 62055 transitions.
[2025-02-05 12:12:38,198 INFO  L78                 Accepts]: Start accepts. Automaton has 60034 states and 62055 transitions. Word has length 1410
[2025-02-05 12:12:38,199 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:12:38,200 INFO  L471      AbstractCegarLoop]: Abstraction has 60034 states and 62055 transitions.
[2025-02-05 12:12:38,200 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:38,200 INFO  L276                IsEmpty]: Start isEmpty. Operand 60034 states and 62055 transitions.
[2025-02-05 12:12:38,250 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1510
[2025-02-05 12:12:38,251 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:38,251 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:12:38,252 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-02-05 12:12:38,252 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:12:38,252 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:12:38,253 INFO  L85        PathProgramCache]: Analyzing trace with hash -134445141, now seen corresponding path program 1 times
[2025-02-05 12:12:38,253 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:12:38,253 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628558162]
[2025-02-05 12:12:38,253 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:38,253 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:12:38,348 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1509 statements into 1 equivalence classes.
[2025-02-05 12:12:38,394 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1509 of 1509 statements.
[2025-02-05 12:12:38,394 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:38,394 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:39,384 INFO  L134       CoverageAnalysis]: Checked inductivity of 2142 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 1889 trivial. 0 not checked.
[2025-02-05 12:12:39,384 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:12:39,384 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628558162]
[2025-02-05 12:12:39,384 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628558162] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:12:39,385 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:12:39,385 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:12:39,385 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502288902]
[2025-02-05 12:12:39,385 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:12:39,386 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:12:39,386 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:12:39,387 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:12:39,387 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:39,388 INFO  L87              Difference]: Start difference. First operand 60034 states and 62055 transitions. Second operand  has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:41,786 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:41,786 INFO  L93              Difference]: Finished difference Result 141456 states and 146560 transitions.
[2025-02-05 12:12:41,787 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:12:41,787 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1509
[2025-02-05 12:12:41,787 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:41,871 INFO  L225             Difference]: With dead ends: 141456
[2025-02-05 12:12:41,871 INFO  L226             Difference]: Without dead ends: 81424
[2025-02-05 12:12:41,911 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:41,911 INFO  L435           NwaCegarLoop]: 943 mSDtfsCounter, 670 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1800 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 1976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:41,911 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 950 Invalid, 1976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1800 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time]
[2025-02-05 12:12:41,959 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 81424 states.
[2025-02-05 12:12:42,569 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 81424 to 81424.
[2025-02-05 12:12:42,610 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 81424 states, 81423 states have (on average 1.0316249708313376) internal successors, (83998), 81423 states have internal predecessors, (83998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:42,681 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 81424 states to 81424 states and 83998 transitions.
[2025-02-05 12:12:42,684 INFO  L78                 Accepts]: Start accepts. Automaton has 81424 states and 83998 transitions. Word has length 1509
[2025-02-05 12:12:42,688 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:12:42,688 INFO  L471      AbstractCegarLoop]: Abstraction has 81424 states and 83998 transitions.
[2025-02-05 12:12:42,688 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:42,688 INFO  L276                IsEmpty]: Start isEmpty. Operand 81424 states and 83998 transitions.
[2025-02-05 12:12:42,802 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1786
[2025-02-05 12:12:42,803 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:42,803 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:12:42,803 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-02-05 12:12:42,804 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:12:42,805 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:12:42,805 INFO  L85        PathProgramCache]: Analyzing trace with hash 244644070, now seen corresponding path program 1 times
[2025-02-05 12:12:42,808 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:12:42,808 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066711459]
[2025-02-05 12:12:42,809 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:42,809 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:12:43,024 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1785 statements into 1 equivalence classes.
[2025-02-05 12:12:43,073 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1785 of 1785 statements.
[2025-02-05 12:12:43,073 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:43,073 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:45,254 INFO  L134       CoverageAnalysis]: Checked inductivity of 3040 backedges. 990 proven. 1794 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked.
[2025-02-05 12:12:45,254 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:12:45,254 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066711459]
[2025-02-05 12:12:45,254 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066711459] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:12:45,255 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743585806]
[2025-02-05 12:12:45,255 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:45,259 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:12:45,259 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:12:45,261 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 12:12:45,264 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2025-02-05 12:12:45,399 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1785 statements into 1 equivalence classes.
[2025-02-05 12:12:45,608 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1785 of 1785 statements.
[2025-02-05 12:12:45,608 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:45,608 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:45,614 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2012 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 12:12:45,637 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 12:12:45,990 INFO  L134       CoverageAnalysis]: Checked inductivity of 3040 backedges. 1478 proven. 0 refuted. 0 times theorem prover too weak. 1562 trivial. 0 not checked.
[2025-02-05 12:12:45,990 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 12:12:45,990 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [743585806] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:12:45,990 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 12:12:45,991 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9
[2025-02-05 12:12:45,991 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492433902]
[2025-02-05 12:12:45,991 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:12:45,992 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:12:45,992 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:12:45,993 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:12:45,993 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2025-02-05 12:12:45,993 INFO  L87              Difference]: Start difference. First operand 81424 states and 83998 transitions. Second operand  has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:47,780 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:47,780 INFO  L93              Difference]: Finished difference Result 162156 states and 167303 transitions.
[2025-02-05 12:12:47,781 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:12:47,781 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1785
[2025-02-05 12:12:47,782 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:47,859 INFO  L225             Difference]: With dead ends: 162156
[2025-02-05 12:12:47,859 INFO  L226             Difference]: Without dead ends: 81424
[2025-02-05 12:12:47,891 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1792 GetRequests, 1785 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2025-02-05 12:12:47,892 INFO  L435           NwaCegarLoop]: 879 mSDtfsCounter, 373 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1597 mSolverCounterSat, 198 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 1597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:47,892 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 886 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 1597 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-02-05 12:12:47,948 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 81424 states.
[2025-02-05 12:12:48,415 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 81424 to 80044.
[2025-02-05 12:12:48,466 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 80044 states, 80043 states have (on average 1.0225253926014768) internal successors, (81846), 80043 states have internal predecessors, (81846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:49,089 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 80044 states to 80044 states and 81846 transitions.
[2025-02-05 12:12:49,090 INFO  L78                 Accepts]: Start accepts. Automaton has 80044 states and 81846 transitions. Word has length 1785
[2025-02-05 12:12:49,093 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:12:49,094 INFO  L471      AbstractCegarLoop]: Abstraction has 80044 states and 81846 transitions.
[2025-02-05 12:12:49,094 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:49,094 INFO  L276                IsEmpty]: Start isEmpty. Operand 80044 states and 81846 transitions.
[2025-02-05 12:12:49,187 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1832
[2025-02-05 12:12:49,187 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:49,188 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:12:49,196 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2025-02-05 12:12:49,392 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:12:49,392 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:12:49,393 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:12:49,393 INFO  L85        PathProgramCache]: Analyzing trace with hash 742639512, now seen corresponding path program 1 times
[2025-02-05 12:12:49,394 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:12:49,394 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331883131]
[2025-02-05 12:12:49,394 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:49,394 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:12:49,503 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1831 statements into 1 equivalence classes.
[2025-02-05 12:12:49,579 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1831 of 1831 statements.
[2025-02-05 12:12:49,579 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:49,579 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:50,455 INFO  L134       CoverageAnalysis]: Checked inductivity of 3397 backedges. 2341 proven. 0 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked.
[2025-02-05 12:12:50,455 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:12:50,455 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331883131]
[2025-02-05 12:12:50,456 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331883131] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:12:50,456 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:12:50,456 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:12:50,456 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026026469]
[2025-02-05 12:12:50,456 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:12:50,464 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:12:50,464 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:12:50,465 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:12:50,465 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:50,465 INFO  L87              Difference]: Start difference. First operand 80044 states and 81846 transitions. Second operand  has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:52,337 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:52,337 INFO  L93              Difference]: Finished difference Result 159396 states and 162999 transitions.
[2025-02-05 12:12:52,337 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:12:52,338 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1831
[2025-02-05 12:12:52,339 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:52,431 INFO  L225             Difference]: With dead ends: 159396
[2025-02-05 12:12:52,431 INFO  L226             Difference]: Without dead ends: 80044
[2025-02-05 12:12:52,449 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:12:52,450 INFO  L435           NwaCegarLoop]: 912 mSDtfsCounter, 425 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:52,450 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 919 Invalid, 1940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time]
[2025-02-05 12:12:52,491 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 80044 states.
[2025-02-05 12:12:53,280 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 80044 to 80044.
[2025-02-05 12:12:53,316 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 80044 states, 80043 states have (on average 1.0177654510700498) internal successors, (81465), 80043 states have internal predecessors, (81465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:53,396 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 80044 states to 80044 states and 81465 transitions.
[2025-02-05 12:12:53,397 INFO  L78                 Accepts]: Start accepts. Automaton has 80044 states and 81465 transitions. Word has length 1831
[2025-02-05 12:12:53,397 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:12:53,397 INFO  L471      AbstractCegarLoop]: Abstraction has 80044 states and 81465 transitions.
[2025-02-05 12:12:53,398 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 393.0) internal successors, (1179), 3 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:53,398 INFO  L276                IsEmpty]: Start isEmpty. Operand 80044 states and 81465 transitions.
[2025-02-05 12:12:53,578 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1871
[2025-02-05 12:12:53,578 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:12:53,578 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:12:53,579 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-02-05 12:12:53,579 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:12:53,579 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:12:53,580 INFO  L85        PathProgramCache]: Analyzing trace with hash 1124801101, now seen corresponding path program 1 times
[2025-02-05 12:12:53,580 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:12:53,580 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671699204]
[2025-02-05 12:12:53,580 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:53,581 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:12:53,796 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1870 statements into 1 equivalence classes.
[2025-02-05 12:12:53,888 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1870 of 1870 statements.
[2025-02-05 12:12:53,888 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:53,888 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:56,822 INFO  L134       CoverageAnalysis]: Checked inductivity of 3237 backedges. 2225 proven. 501 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked.
[2025-02-05 12:12:56,823 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:12:56,823 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671699204]
[2025-02-05 12:12:56,823 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671699204] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 12:12:56,823 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773847435]
[2025-02-05 12:12:56,824 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:12:56,824 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 12:12:56,824 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 12:12:56,828 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 12:12:56,833 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2025-02-05 12:12:56,983 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1870 statements into 1 equivalence classes.
[2025-02-05 12:12:57,236 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1870 of 1870 statements.
[2025-02-05 12:12:57,236 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:12:57,237 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:12:57,242 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2091 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-02-05 12:12:57,251 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 12:12:57,658 INFO  L134       CoverageAnalysis]: Checked inductivity of 3237 backedges. 2300 proven. 0 refuted. 0 times theorem prover too weak. 937 trivial. 0 not checked.
[2025-02-05 12:12:57,658 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 12:12:57,658 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773847435] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:12:57,659 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 12:12:57,659 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8
[2025-02-05 12:12:57,659 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974289752]
[2025-02-05 12:12:57,659 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:12:57,660 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:12:57,660 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:12:57,661 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:12:57,661 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-02-05 12:12:57,661 INFO  L87              Difference]: Start difference. First operand 80044 states and 81465 transitions. Second operand  has 3 states, 3 states have (on average 354.6666666666667) internal successors, (1064), 3 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:12:59,188 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 12:12:59,188 INFO  L93              Difference]: Finished difference Result 159396 states and 162237 transitions.
[2025-02-05 12:12:59,189 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 12:12:59,189 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 354.6666666666667) internal successors, (1064), 3 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1870
[2025-02-05 12:12:59,190 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 12:12:59,263 INFO  L225             Difference]: With dead ends: 159396
[2025-02-05 12:12:59,263 INFO  L226             Difference]: Without dead ends: 80044
[2025-02-05 12:12:59,307 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1877 GetRequests, 1871 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2025-02-05 12:12:59,317 INFO  L435           NwaCegarLoop]: 966 mSDtfsCounter, 573 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-02-05 12:12:59,320 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 973 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1663 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-02-05 12:12:59,376 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 80044 states.
[2025-02-05 12:13:00,007 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 80044 to 77974.
[2025-02-05 12:13:00,046 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 77974 states, 77973 states have (on average 1.017954933117874) internal successors, (79373), 77973 states have internal predecessors, (79373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:13:00,118 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 77974 states to 77974 states and 79373 transitions.
[2025-02-05 12:13:00,119 INFO  L78                 Accepts]: Start accepts. Automaton has 77974 states and 79373 transitions. Word has length 1870
[2025-02-05 12:13:00,119 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 12:13:00,120 INFO  L471      AbstractCegarLoop]: Abstraction has 77974 states and 79373 transitions.
[2025-02-05 12:13:00,120 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 354.6666666666667) internal successors, (1064), 3 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 12:13:00,120 INFO  L276                IsEmpty]: Start isEmpty. Operand 77974 states and 79373 transitions.
[2025-02-05 12:13:00,169 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1880
[2025-02-05 12:13:00,170 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 12:13:00,170 INFO  L218           NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 12:13:00,178 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 12:13:00,373 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,SelfDestructingSolverStorable21
[2025-02-05 12:13:00,373 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 12:13:00,373 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 12:13:00,374 INFO  L85        PathProgramCache]: Analyzing trace with hash -1002273654, now seen corresponding path program 1 times
[2025-02-05 12:13:00,374 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 12:13:00,374 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186371713]
[2025-02-05 12:13:00,374 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 12:13:00,374 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 12:13:00,444 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1879 statements into 1 equivalence classes.
[2025-02-05 12:13:00,546 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1879 of 1879 statements.
[2025-02-05 12:13:00,550 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 12:13:00,550 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 12:13:01,713 INFO  L134       CoverageAnalysis]: Checked inductivity of 3306 backedges. 2651 proven. 0 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked.
[2025-02-05 12:13:01,713 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 12:13:01,713 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186371713]
[2025-02-05 12:13:01,714 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186371713] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 12:13:01,714 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 12:13:01,714 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 12:13:01,714 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840230316]
[2025-02-05 12:13:01,714 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 12:13:01,715 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 12:13:01,715 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 12:13:01,716 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 12:13:01,716 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 12:13:01,716 INFO  L87              Difference]: Start difference. First operand 77974 states and 79373 transitions. Second operand  has 3 states, 3 states have (on average 423.0) internal successors, (1269), 3 states have internal predecessors, (1269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)