./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label34.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/Problem16_label34.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 b73f5e5720d5add681fe921396017c2afeb1ab5358e7e5b4cdea0c074172c3d1
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 11:58:49,192 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 11:58:49,232 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2025-02-05 11:58:49,235 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 11:58:49,235 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 11:58:49,249 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 11:58:49,249 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 11:58:49,249 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 11:58:49,250 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 11:58:49,250 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 11:58:49,250 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 11:58:49,250 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 11:58:49,250 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 11:58:49,250 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 11:58:49,250 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 11:58:49,251 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 11:58:49,251 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 11:58:49,251 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-02-05 11:58:49,251 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 11:58:49,251 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-02-05 11:58:49,251 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 11:58:49,251 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 11:58:49,251 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 11:58:49,251 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 11:58:49,251 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-02-05 11:58:49,252 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 11:58:49,252 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 11:58:49,252 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 11:58:49,252 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 11:58:49,252 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 11:58:49,252 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 11:58:49,252 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 11:58:49,252 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:58:49,252 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 11:58:49,252 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 11:58:49,252 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 11:58:49,253 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 11:58:49,253 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 11:58:49,253 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 11:58:49,253 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 11:58:49,253 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 11:58:49,253 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 11:58:49,253 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 11:58:49,253 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 -> b73f5e5720d5add681fe921396017c2afeb1ab5358e7e5b4cdea0c074172c3d1
[2025-02-05 11:58:49,478 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 11:58:49,487 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 11:58:49,489 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 11:58:49,489 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 11:58:49,490 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 11:58:49,491 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label34.c
[2025-02-05 11:58:50,585 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19a884b79/cdcc3ca023a046f8bed74341fcfc4147/FLAG13bab22b8
[2025-02-05 11:58:50,938 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 11:58:50,939 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label34.c
[2025-02-05 11:58:50,956 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19a884b79/cdcc3ca023a046f8bed74341fcfc4147/FLAG13bab22b8
[2025-02-05 11:58:51,161 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/19a884b79/cdcc3ca023a046f8bed74341fcfc4147
[2025-02-05 11:58:51,163 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 11:58:51,164 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 11:58:51,165 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 11:58:51,165 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 11:58:51,168 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 11:58:51,169 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:58:51" (1/1) ...
[2025-02-05 11:58:51,170 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b9ba58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:51, skipping insertion in model container
[2025-02-05 11:58:51,171 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:58:51" (1/1) ...
[2025-02-05 11:58:51,212 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 11:58:51,350 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/Problem16_label34.c[3712,3725]
[2025-02-05 11:58:51,578 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:58:51,585 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 11:58:51,599 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/Problem16_label34.c[3712,3725]
[2025-02-05 11:58:51,712 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 11:58:51,725 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 11:58:51,726 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:51 WrapperNode
[2025-02-05 11:58:51,726 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 11:58:51,727 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 11:58:51,727 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 11:58:51,728 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 11:58:51,732 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:51" (1/1) ...
[2025-02-05 11:58:51,755 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:51" (1/1) ...
[2025-02-05 11:58:51,845 INFO  L138                Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767
[2025-02-05 11:58:51,846 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 11:58:51,846 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 11:58:51,846 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 11:58:51,846 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 11:58:51,852 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:51" (1/1) ...
[2025-02-05 11:58:51,853 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:51" (1/1) ...
[2025-02-05 11:58:51,877 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:51" (1/1) ...
[2025-02-05 11:58:51,978 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 11:58:51,979 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:51" (1/1) ...
[2025-02-05 11:58:51,979 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:51" (1/1) ...
[2025-02-05 11:58:52,027 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:51" (1/1) ...
[2025-02-05 11:58:52,036 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:51" (1/1) ...
[2025-02-05 11:58:52,051 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:51" (1/1) ...
[2025-02-05 11:58:52,058 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:51" (1/1) ...
[2025-02-05 11:58:52,076 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 11:58:52,077 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 11:58:52,078 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 11:58:52,078 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 11:58:52,079 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:51" (1/1) ...
[2025-02-05 11:58:52,084 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 11:58:52,094 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:58:52,108 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 11:58:52,111 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 11:58:52,130 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 11:58:52,130 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 11:58:52,131 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 11:58:52,131 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 11:58:52,180 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 11:58:52,181 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 11:58:53,811 INFO  L1309  $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1;
[2025-02-05 11:58:53,887 INFO  L?                        ?]: Removed 276 outVars from TransFormulas that were not future-live.
[2025-02-05 11:58:53,888 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 11:58:53,908 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 11:58:53,908 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 11:58:53,908 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:58:53 BoogieIcfgContainer
[2025-02-05 11:58:53,908 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 11:58:53,910 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 11:58:53,910 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 11:58:53,914 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 11:58:53,915 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:58:51" (1/3) ...
[2025-02-05 11:58:53,915 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726982e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:58:53, skipping insertion in model container
[2025-02-05 11:58:53,915 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:58:51" (2/3) ...
[2025-02-05 11:58:53,916 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726982e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:58:53, skipping insertion in model container
[2025-02-05 11:58:53,916 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:58:53" (3/3) ...
[2025-02-05 11:58:53,917 INFO  L128   eAbstractionObserver]: Analyzing ICFG Problem16_label34.c
[2025-02-05 11:58:53,928 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 11:58:53,930 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label34.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 11:58:53,988 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 11:58:53,999 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;@66a6379a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 11:58:54,000 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 11:58:54,006 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states 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 11:58:54,012 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2025-02-05 11:58:54,013 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:58:54,013 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]
[2025-02-05 11:58:54,013 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:58:54,017 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:58:54,018 INFO  L85        PathProgramCache]: Analyzing trace with hash 331607604, now seen corresponding path program 1 times
[2025-02-05 11:58:54,024 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:58:54,025 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203230620]
[2025-02-05 11:58:54,026 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:58:54,027 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:58:54,083 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes.
[2025-02-05 11:58:54,117 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements.
[2025-02-05 11:58:54,117 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:58:54,117 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:58:54,349 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 11:58:54,350 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:58:54,351 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203230620]
[2025-02-05 11:58:54,351 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203230620] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:58:54,351 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:58:54,351 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:58:54,352 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019787094]
[2025-02-05 11:58:54,353 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:58:54,356 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:58:54,356 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:58:54,370 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:58:54,371 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:58:54,373 INFO  L87              Difference]: Start difference. First operand  has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 11:58:56,404 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:58:56,405 INFO  L93              Difference]: Finished difference Result 1456 states and 2760 transitions.
[2025-02-05 11:58:56,406 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:58:56,407 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34
[2025-02-05 11:58:56,408 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:58:56,425 INFO  L225             Difference]: With dead ends: 1456
[2025-02-05 11:58:56,425 INFO  L226             Difference]: Without dead ends: 991
[2025-02-05 11:58:56,428 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 11:58:56,432 INFO  L435           NwaCegarLoop]: 80 mSDtfsCounter, 1087 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 1599 mSolverCounterSat, 792 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 2391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 792 IncrementalHoareTripleChecker+Valid, 1599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-02-05 11:58:56,433 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 96 Invalid, 2391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [792 Valid, 1599 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-02-05 11:58:56,449 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 991 states.
[2025-02-05 11:58:56,502 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991.
[2025-02-05 11:58:56,504 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 991 states, 990 states have (on average 1.497979797979798) internal successors, (1483), 990 states have internal predecessors, (1483), 0 states have call successors, (0), 0 states 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 11:58:56,509 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1483 transitions.
[2025-02-05 11:58:56,510 INFO  L78                 Accepts]: Start accepts. Automaton has 991 states and 1483 transitions. Word has length 34
[2025-02-05 11:58:56,510 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:58:56,510 INFO  L471      AbstractCegarLoop]: Abstraction has 991 states and 1483 transitions.
[2025-02-05 11:58:56,511 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states 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 11:58:56,511 INFO  L276                IsEmpty]: Start isEmpty. Operand 991 states and 1483 transitions.
[2025-02-05 11:58:56,514 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 225
[2025-02-05 11:58:56,514 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:58:56,514 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:58:56,515 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-05 11:58:56,515 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:58:56,515 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:58:56,515 INFO  L85        PathProgramCache]: Analyzing trace with hash 1401608332, now seen corresponding path program 1 times
[2025-02-05 11:58:56,515 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:58:56,515 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224554486]
[2025-02-05 11:58:56,515 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:58:56,516 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:58:56,543 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes.
[2025-02-05 11:58:56,586 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements.
[2025-02-05 11:58:56,587 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:58:56,587 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:58:56,864 INFO  L134       CoverageAnalysis]: Checked inductivity of 149 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked.
[2025-02-05 11:58:56,866 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:58:56,866 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224554486]
[2025-02-05 11:58:56,866 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224554486] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:58:56,866 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:58:56,866 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:58:56,866 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718291335]
[2025-02-05 11:58:56,866 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:58:56,867 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:58:56,868 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:58:56,868 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:58:56,869 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:58:56,869 INFO  L87              Difference]: Start difference. First operand 991 states and 1483 transitions. Second operand  has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 11:58:57,908 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:58:57,908 INFO  L93              Difference]: Finished difference Result 2309 states and 3762 transitions.
[2025-02-05 11:58:57,909 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:58:57,909 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 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 224
[2025-02-05 11:58:57,909 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:58:57,914 INFO  L225             Difference]: With dead ends: 2309
[2025-02-05 11:58:57,915 INFO  L226             Difference]: Without dead ends: 1649
[2025-02-05 11:58:57,916 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 11:58:57,916 INFO  L435           NwaCegarLoop]: 151 mSDtfsCounter, 343 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-02-05 11:58:57,917 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 155 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-02-05 11:58:57,918 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1649 states.
[2025-02-05 11:58:57,950 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1649.
[2025-02-05 11:58:57,952 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1649 states, 1648 states have (on average 1.4453883495145632) internal successors, (2382), 1648 states have internal predecessors, (2382), 0 states have call successors, (0), 0 states 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 11:58:57,965 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2382 transitions.
[2025-02-05 11:58:57,966 INFO  L78                 Accepts]: Start accepts. Automaton has 1649 states and 2382 transitions. Word has length 224
[2025-02-05 11:58:57,966 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:58:57,966 INFO  L471      AbstractCegarLoop]: Abstraction has 1649 states and 2382 transitions.
[2025-02-05 11:58:57,967 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 0 states have call successors, (0), 0 states 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 11:58:57,967 INFO  L276                IsEmpty]: Start isEmpty. Operand 1649 states and 2382 transitions.
[2025-02-05 11:58:57,971 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 336
[2025-02-05 11:58:57,974 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:58:57,975 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:58:57,975 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 11:58:57,975 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:58:57,975 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:58:57,975 INFO  L85        PathProgramCache]: Analyzing trace with hash 1657149572, now seen corresponding path program 1 times
[2025-02-05 11:58:57,975 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:58:57,975 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483859878]
[2025-02-05 11:58:57,975 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:58:57,976 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:58:58,007 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes.
[2025-02-05 11:58:58,029 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements.
[2025-02-05 11:58:58,030 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:58:58,030 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:58:58,228 INFO  L134       CoverageAnalysis]: Checked inductivity of 370 backedges. 338 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked.
[2025-02-05 11:58:58,228 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:58:58,228 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483859878]
[2025-02-05 11:58:58,228 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483859878] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:58:58,228 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:58:58,228 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:58:58,228 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602006653]
[2025-02-05 11:58:58,228 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:58:58,229 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:58:58,229 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:58:58,229 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:58:58,230 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:58:58,230 INFO  L87              Difference]: Start difference. First operand 1649 states and 2382 transitions. Second operand  has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states 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 11:58:59,293 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:58:59,294 INFO  L93              Difference]: Finished difference Result 3625 states and 5415 transitions.
[2025-02-05 11:58:59,294 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:58:59,294 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 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 335
[2025-02-05 11:58:59,295 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:58:59,300 INFO  L225             Difference]: With dead ends: 3625
[2025-02-05 11:58:59,301 INFO  L226             Difference]: Without dead ends: 1978
[2025-02-05 11:58:59,303 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 11:58:59,303 INFO  L435           NwaCegarLoop]: 533 mSDtfsCounter, 271 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-02-05 11:58:59,303 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 539 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-02-05 11:58:59,305 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1978 states.
[2025-02-05 11:58:59,332 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1978.
[2025-02-05 11:58:59,334 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1978 states, 1977 states have (on average 1.1335356600910471) internal successors, (2241), 1977 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states 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 11:58:59,340 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 2241 transitions.
[2025-02-05 11:58:59,340 INFO  L78                 Accepts]: Start accepts. Automaton has 1978 states and 2241 transitions. Word has length 335
[2025-02-05 11:58:59,341 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:58:59,341 INFO  L471      AbstractCegarLoop]: Abstraction has 1978 states and 2241 transitions.
[2025-02-05 11:58:59,341 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states 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 11:58:59,341 INFO  L276                IsEmpty]: Start isEmpty. Operand 1978 states and 2241 transitions.
[2025-02-05 11:58:59,345 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 354
[2025-02-05 11:58:59,345 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:58:59,346 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:58:59,346 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 11:58:59,346 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:58:59,346 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:58:59,346 INFO  L85        PathProgramCache]: Analyzing trace with hash 1625875018, now seen corresponding path program 1 times
[2025-02-05 11:58:59,346 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:58:59,346 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068051338]
[2025-02-05 11:58:59,346 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:58:59,347 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:58:59,372 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes.
[2025-02-05 11:58:59,381 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements.
[2025-02-05 11:58:59,381 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:58:59,381 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:58:59,525 INFO  L134       CoverageAnalysis]: Checked inductivity of 403 backedges. 233 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked.
[2025-02-05 11:58:59,525 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:58:59,526 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068051338]
[2025-02-05 11:58:59,526 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068051338] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:58:59,526 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:58:59,526 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2025-02-05 11:58:59,526 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256527975]
[2025-02-05 11:58:59,526 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:58:59,526 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:58:59,526 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:58:59,527 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:58:59,527 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:58:59,527 INFO  L87              Difference]: Start difference. First operand 1978 states and 2241 transitions. Second operand  has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states 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 11:59:00,240 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:00,240 INFO  L93              Difference]: Finished difference Result 3954 states and 4508 transitions.
[2025-02-05 11:59:00,241 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:00,241 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 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 353
[2025-02-05 11:59:00,241 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:00,249 INFO  L225             Difference]: With dead ends: 3954
[2025-02-05 11:59:00,250 INFO  L226             Difference]: Without dead ends: 2307
[2025-02-05 11:59:00,252 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 11:59:00,253 INFO  L435           NwaCegarLoop]: 27 mSDtfsCounter, 262 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:00,253 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 31 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 11:59:00,256 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2307 states.
[2025-02-05 11:59:00,282 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2307 to 2307.
[2025-02-05 11:59:00,285 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2307 states, 2306 states have (on average 1.092801387684302) internal successors, (2520), 2306 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states 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 11:59:00,292 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2307 states to 2307 states and 2520 transitions.
[2025-02-05 11:59:00,292 INFO  L78                 Accepts]: Start accepts. Automaton has 2307 states and 2520 transitions. Word has length 353
[2025-02-05 11:59:00,293 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:00,293 INFO  L471      AbstractCegarLoop]: Abstraction has 2307 states and 2520 transitions.
[2025-02-05 11:59:00,293 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 2 states have internal predecessors, (217), 0 states have call successors, (0), 0 states 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 11:59:00,293 INFO  L276                IsEmpty]: Start isEmpty. Operand 2307 states and 2520 transitions.
[2025-02-05 11:59:00,302 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 612
[2025-02-05 11:59:00,302 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:00,303 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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]
[2025-02-05 11:59:00,303 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 11:59:00,303 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:00,303 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:00,304 INFO  L85        PathProgramCache]: Analyzing trace with hash 1523134510, now seen corresponding path program 1 times
[2025-02-05 11:59:00,304 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:00,304 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150901019]
[2025-02-05 11:59:00,304 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:00,304 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:00,354 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 611 statements into 1 equivalence classes.
[2025-02-05 11:59:00,384 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 611 of 611 statements.
[2025-02-05 11:59:00,385 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:00,385 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:01,055 INFO  L134       CoverageAnalysis]: Checked inductivity of 789 backedges. 619 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked.
[2025-02-05 11:59:01,056 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:01,056 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150901019]
[2025-02-05 11:59:01,056 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150901019] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:01,056 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:01,056 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:59:01,056 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968552614]
[2025-02-05 11:59:01,056 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:01,057 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:59:01,057 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:01,058 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:59:01,059 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:59:01,059 INFO  L87              Difference]: Start difference. First operand 2307 states and 2520 transitions. Second operand  has 4 states, 4 states have (on average 118.75) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states 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 11:59:01,786 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:01,786 INFO  L93              Difference]: Finished difference Result 4612 states and 5050 transitions.
[2025-02-05 11:59:01,786 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:01,787 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 118.75) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 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 611
[2025-02-05 11:59:01,787 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:01,794 INFO  L225             Difference]: With dead ends: 4612
[2025-02-05 11:59:01,794 INFO  L226             Difference]: Without dead ends: 2636
[2025-02-05 11:59:01,796 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 11:59:01,797 INFO  L435           NwaCegarLoop]: 100 mSDtfsCounter, 301 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:01,797 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 105 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 11:59:01,799 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2636 states.
[2025-02-05 11:59:01,827 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636.
[2025-02-05 11:59:01,831 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2636 states, 2635 states have (on average 1.0827324478178368) internal successors, (2853), 2635 states have internal predecessors, (2853), 0 states have call successors, (0), 0 states 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 11:59:01,837 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 2853 transitions.
[2025-02-05 11:59:01,837 INFO  L78                 Accepts]: Start accepts. Automaton has 2636 states and 2853 transitions. Word has length 611
[2025-02-05 11:59:01,838 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:01,838 INFO  L471      AbstractCegarLoop]: Abstraction has 2636 states and 2853 transitions.
[2025-02-05 11:59:01,838 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 118.75) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states 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 11:59:01,838 INFO  L276                IsEmpty]: Start isEmpty. Operand 2636 states and 2853 transitions.
[2025-02-05 11:59:01,846 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 620
[2025-02-05 11:59:01,846 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:01,846 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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]
[2025-02-05 11:59:01,846 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 11:59:01,847 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:01,847 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:01,847 INFO  L85        PathProgramCache]: Analyzing trace with hash 259686938, now seen corresponding path program 1 times
[2025-02-05 11:59:01,847 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:01,847 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028750964]
[2025-02-05 11:59:01,847 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:01,848 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:01,891 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 619 statements into 1 equivalence classes.
[2025-02-05 11:59:01,914 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 619 of 619 statements.
[2025-02-05 11:59:01,916 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:01,916 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:02,110 INFO  L134       CoverageAnalysis]: Checked inductivity of 789 backedges. 633 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked.
[2025-02-05 11:59:02,111 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:02,111 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028750964]
[2025-02-05 11:59:02,111 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028750964] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:02,111 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:02,112 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:59:02,112 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032583136]
[2025-02-05 11:59:02,112 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:02,112 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:02,115 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:02,115 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:02,116 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:02,116 INFO  L87              Difference]: Start difference. First operand 2636 states and 2853 transitions. Second operand  has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states 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 11:59:02,802 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:02,802 INFO  L93              Difference]: Finished difference Result 6257 states and 6842 transitions.
[2025-02-05 11:59:02,802 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:02,803 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 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 619
[2025-02-05 11:59:02,803 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:02,813 INFO  L225             Difference]: With dead ends: 6257
[2025-02-05 11:59:02,813 INFO  L226             Difference]: Without dead ends: 4281
[2025-02-05 11:59:02,815 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 11:59:02,816 INFO  L435           NwaCegarLoop]: 33 mSDtfsCounter, 235 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:02,816 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 38 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 11:59:02,819 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4281 states.
[2025-02-05 11:59:02,857 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 3952.
[2025-02-05 11:59:02,862 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3952 states, 3951 states have (on average 1.0807390534042014) internal successors, (4270), 3951 states have internal predecessors, (4270), 0 states have call successors, (0), 0 states 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 11:59:02,868 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 4270 transitions.
[2025-02-05 11:59:02,868 INFO  L78                 Accepts]: Start accepts. Automaton has 3952 states and 4270 transitions. Word has length 619
[2025-02-05 11:59:02,869 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:02,869 INFO  L471      AbstractCegarLoop]: Abstraction has 3952 states and 4270 transitions.
[2025-02-05 11:59:02,869 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states 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 11:59:02,869 INFO  L276                IsEmpty]: Start isEmpty. Operand 3952 states and 4270 transitions.
[2025-02-05 11:59:02,877 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1084
[2025-02-05 11:59:02,877 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:02,877 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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]
[2025-02-05 11:59:02,878 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 11:59:02,878 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:02,878 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:02,879 INFO  L85        PathProgramCache]: Analyzing trace with hash 1340472385, now seen corresponding path program 1 times
[2025-02-05 11:59:02,879 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:02,879 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218533188]
[2025-02-05 11:59:02,879 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:02,879 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:02,942 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1083 statements into 1 equivalence classes.
[2025-02-05 11:59:02,964 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1083 of 1083 statements.
[2025-02-05 11:59:02,964 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:02,965 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:03,879 INFO  L134       CoverageAnalysis]: Checked inductivity of 2552 backedges. 1240 proven. 214 refuted. 0 times theorem prover too weak. 1098 trivial. 0 not checked.
[2025-02-05 11:59:03,879 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:03,879 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218533188]
[2025-02-05 11:59:03,879 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218533188] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:59:03,879 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712752625]
[2025-02-05 11:59:03,880 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:03,880 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:59:03,880 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:59:03,882 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 11:59:03,883 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 11:59:03,969 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1083 statements into 1 equivalence classes.
[2025-02-05 11:59:04,110 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1083 of 1083 statements.
[2025-02-05 11:59:04,110 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:04,110 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:04,115 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1294 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:59:04,128 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:59:04,670 INFO  L134       CoverageAnalysis]: Checked inductivity of 2552 backedges. 1240 proven. 0 refuted. 0 times theorem prover too weak. 1312 trivial. 0 not checked.
[2025-02-05 11:59:04,670 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:59:04,671 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [712752625] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:04,671 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:59:04,671 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5
[2025-02-05 11:59:04,671 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203334872]
[2025-02-05 11:59:04,671 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:04,673 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:04,673 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:04,673 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:04,673 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:59:04,674 INFO  L87              Difference]: Start difference. First operand 3952 states and 4270 transitions. Second operand  has 3 states, 3 states have (on average 141.0) internal successors, (423), 2 states have internal predecessors, (423), 0 states have call successors, (0), 0 states 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 11:59:05,249 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:05,249 INFO  L93              Difference]: Finished difference Result 8889 states and 9675 transitions.
[2025-02-05 11:59:05,249 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:05,250 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 141.0) internal successors, (423), 2 states have internal predecessors, (423), 0 states have call successors, (0), 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 1083
[2025-02-05 11:59:05,250 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:05,263 INFO  L225             Difference]: With dead ends: 8889
[2025-02-05 11:59:05,263 INFO  L226             Difference]: Without dead ends: 5597
[2025-02-05 11:59:05,268 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1086 GetRequests, 1082 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:59:05,269 INFO  L435           NwaCegarLoop]: 83 mSDtfsCounter, 91 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:05,269 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 88 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 11:59:05,275 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5597 states.
[2025-02-05 11:59:05,338 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 5597.
[2025-02-05 11:59:05,343 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5597 states, 5596 states have (on average 1.0709435310936384) internal successors, (5993), 5596 states have internal predecessors, (5993), 0 states have call successors, (0), 0 states 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 11:59:05,349 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 5993 transitions.
[2025-02-05 11:59:05,350 INFO  L78                 Accepts]: Start accepts. Automaton has 5597 states and 5993 transitions. Word has length 1083
[2025-02-05 11:59:05,350 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:05,350 INFO  L471      AbstractCegarLoop]: Abstraction has 5597 states and 5993 transitions.
[2025-02-05 11:59:05,350 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 141.0) internal successors, (423), 2 states have internal predecessors, (423), 0 states have call successors, (0), 0 states 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 11:59:05,351 INFO  L276                IsEmpty]: Start isEmpty. Operand 5597 states and 5993 transitions.
[2025-02-05 11:59:05,360 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1114
[2025-02-05 11:59:05,360 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:05,361 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:05,369 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 11:59:05,561 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:59:05,562 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:05,562 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:05,563 INFO  L85        PathProgramCache]: Analyzing trace with hash -9618900, now seen corresponding path program 1 times
[2025-02-05 11:59:05,563 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:05,563 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008729428]
[2025-02-05 11:59:05,563 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:05,563 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:05,624 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1113 statements into 1 equivalence classes.
[2025-02-05 11:59:05,686 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1113 of 1113 statements.
[2025-02-05 11:59:05,686 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:05,687 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:06,110 INFO  L134       CoverageAnalysis]: Checked inductivity of 2580 backedges. 1763 proven. 0 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked.
[2025-02-05 11:59:06,110 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:06,110 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008729428]
[2025-02-05 11:59:06,110 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008729428] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:06,111 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:06,111 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:59:06,111 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57906292]
[2025-02-05 11:59:06,111 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:06,112 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:06,112 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:06,112 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:06,112 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:06,113 INFO  L87              Difference]: Start difference. First operand 5597 states and 5993 transitions. Second operand  has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states 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 11:59:06,841 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:06,841 INFO  L93              Difference]: Finished difference Result 12179 states and 13122 transitions.
[2025-02-05 11:59:06,841 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:06,842 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 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 1113
[2025-02-05 11:59:06,842 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:06,859 INFO  L225             Difference]: With dead ends: 12179
[2025-02-05 11:59:06,859 INFO  L226             Difference]: Without dead ends: 7242
[2025-02-05 11:59:06,864 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 11:59:06,865 INFO  L435           NwaCegarLoop]: 422 mSDtfsCounter, 221 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:06,865 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 427 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 11:59:06,873 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7242 states.
[2025-02-05 11:59:06,938 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7242 to 7242.
[2025-02-05 11:59:06,951 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 7242 states, 7241 states have (on average 1.0591078580306588) internal successors, (7669), 7241 states have internal predecessors, (7669), 0 states have call successors, (0), 0 states 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 11:59:06,958 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7242 states to 7242 states and 7669 transitions.
[2025-02-05 11:59:06,959 INFO  L78                 Accepts]: Start accepts. Automaton has 7242 states and 7669 transitions. Word has length 1113
[2025-02-05 11:59:06,960 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:06,960 INFO  L471      AbstractCegarLoop]: Abstraction has 7242 states and 7669 transitions.
[2025-02-05 11:59:06,962 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states 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 11:59:06,962 INFO  L276                IsEmpty]: Start isEmpty. Operand 7242 states and 7669 transitions.
[2025-02-05 11:59:06,977 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1115
[2025-02-05 11:59:06,978 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:06,978 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:06,978 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 11:59:06,978 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:06,979 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:06,979 INFO  L85        PathProgramCache]: Analyzing trace with hash 2034185056, now seen corresponding path program 1 times
[2025-02-05 11:59:06,979 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:06,979 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069757275]
[2025-02-05 11:59:06,979 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:06,979 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:07,081 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1114 statements into 1 equivalence classes.
[2025-02-05 11:59:07,132 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1114 of 1114 statements.
[2025-02-05 11:59:07,132 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:07,132 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:07,831 INFO  L134       CoverageAnalysis]: Checked inductivity of 2586 backedges. 1756 proven. 0 refuted. 0 times theorem prover too weak. 830 trivial. 0 not checked.
[2025-02-05 11:59:07,831 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:07,831 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069757275]
[2025-02-05 11:59:07,831 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069757275] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:07,831 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:07,831 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:59:07,832 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974782805]
[2025-02-05 11:59:07,832 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:07,832 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:07,832 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:07,833 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:07,833 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:07,833 INFO  L87              Difference]: Start difference. First operand 7242 states and 7669 transitions. Second operand  has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states 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 11:59:08,468 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:08,468 INFO  L93              Difference]: Finished difference Result 15140 states and 16095 transitions.
[2025-02-05 11:59:08,468 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:08,469 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 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 1114
[2025-02-05 11:59:08,469 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:08,490 INFO  L225             Difference]: With dead ends: 15140
[2025-02-05 11:59:08,493 INFO  L226             Difference]: Without dead ends: 8558
[2025-02-05 11:59:08,499 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 11:59:08,500 INFO  L435           NwaCegarLoop]: 47 mSDtfsCounter, 206 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:08,501 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 51 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 11:59:08,508 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8558 states.
[2025-02-05 11:59:08,573 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8558 to 8558.
[2025-02-05 11:59:08,582 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8558 states, 8557 states have (on average 1.0557438354563515) internal successors, (9034), 8557 states have internal predecessors, (9034), 0 states have call successors, (0), 0 states 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 11:59:08,590 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8558 states to 8558 states and 9034 transitions.
[2025-02-05 11:59:08,591 INFO  L78                 Accepts]: Start accepts. Automaton has 8558 states and 9034 transitions. Word has length 1114
[2025-02-05 11:59:08,592 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:08,592 INFO  L471      AbstractCegarLoop]: Abstraction has 8558 states and 9034 transitions.
[2025-02-05 11:59:08,592 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 187.33333333333334) internal successors, (562), 3 states have internal predecessors, (562), 0 states have call successors, (0), 0 states 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 11:59:08,592 INFO  L276                IsEmpty]: Start isEmpty. Operand 8558 states and 9034 transitions.
[2025-02-05 11:59:08,604 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1140
[2025-02-05 11:59:08,604 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:08,605 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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]
[2025-02-05 11:59:08,605 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 11:59:08,605 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:08,605 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:08,606 INFO  L85        PathProgramCache]: Analyzing trace with hash -79679107, now seen corresponding path program 1 times
[2025-02-05 11:59:08,606 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:08,606 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595093520]
[2025-02-05 11:59:08,606 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:08,606 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:08,668 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1139 statements into 1 equivalence classes.
[2025-02-05 11:59:08,734 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1139 of 1139 statements.
[2025-02-05 11:59:08,734 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:08,734 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:09,521 INFO  L134       CoverageAnalysis]: Checked inductivity of 2204 backedges. 1512 proven. 0 refuted. 0 times theorem prover too weak. 692 trivial. 0 not checked.
[2025-02-05 11:59:09,521 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:09,521 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595093520]
[2025-02-05 11:59:09,521 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595093520] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:09,521 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:09,521 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-02-05 11:59:09,521 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170409668]
[2025-02-05 11:59:09,521 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:09,522 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-02-05 11:59:09,522 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:09,523 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-02-05 11:59:09,523 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-02-05 11:59:09,523 INFO  L87              Difference]: Start difference. First operand 8558 states and 9034 transitions. Second operand  has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states 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 11:59:10,355 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:10,355 INFO  L93              Difference]: Finished difference Result 16457 states and 17403 transitions.
[2025-02-05 11:59:10,355 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 11:59:10,356 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 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 1139
[2025-02-05 11:59:10,356 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:10,370 INFO  L225             Difference]: With dead ends: 16457
[2025-02-05 11:59:10,370 INFO  L226             Difference]: Without dead ends: 8559
[2025-02-05 11:59:10,376 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2025-02-05 11:59:10,377 INFO  L435           NwaCegarLoop]: 430 mSDtfsCounter, 357 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 1502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:10,377 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 564 Invalid, 1502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 11:59:10,382 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 8559 states.
[2025-02-05 11:59:10,434 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 8559 to 8558.
[2025-02-05 11:59:10,442 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 8558 states, 8557 states have (on average 1.054925791749445) internal successors, (9027), 8557 states have internal predecessors, (9027), 0 states have call successors, (0), 0 states 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 11:59:10,450 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8558 states to 8558 states and 9027 transitions.
[2025-02-05 11:59:10,450 INFO  L78                 Accepts]: Start accepts. Automaton has 8558 states and 9027 transitions. Word has length 1139
[2025-02-05 11:59:10,451 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:10,451 INFO  L471      AbstractCegarLoop]: Abstraction has 8558 states and 9027 transitions.
[2025-02-05 11:59:10,451 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states 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 11:59:10,451 INFO  L276                IsEmpty]: Start isEmpty. Operand 8558 states and 9027 transitions.
[2025-02-05 11:59:10,463 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1143
[2025-02-05 11:59:10,463 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:10,464 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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]
[2025-02-05 11:59:10,464 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 11:59:10,464 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:10,465 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:10,465 INFO  L85        PathProgramCache]: Analyzing trace with hash -1513857788, now seen corresponding path program 1 times
[2025-02-05 11:59:10,465 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:10,465 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420909803]
[2025-02-05 11:59:10,465 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:10,465 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:10,523 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1142 statements into 1 equivalence classes.
[2025-02-05 11:59:10,559 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1142 of 1142 statements.
[2025-02-05 11:59:10,559 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:10,559 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:11,143 INFO  L134       CoverageAnalysis]: Checked inductivity of 2694 backedges. 1469 proven. 0 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked.
[2025-02-05 11:59:11,144 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:11,144 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420909803]
[2025-02-05 11:59:11,144 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420909803] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:11,144 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:11,144 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:59:11,144 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349241028]
[2025-02-05 11:59:11,144 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:11,144 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:11,145 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:11,145 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:11,145 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:11,145 INFO  L87              Difference]: Start difference. First operand 8558 states and 9027 transitions. Second operand  has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states 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 11:59:11,682 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:11,682 INFO  L93              Difference]: Finished difference Result 17772 states and 18723 transitions.
[2025-02-05 11:59:11,682 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:11,682 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 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 1142
[2025-02-05 11:59:11,683 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:11,697 INFO  L225             Difference]: With dead ends: 17772
[2025-02-05 11:59:11,697 INFO  L226             Difference]: Without dead ends: 9874
[2025-02-05 11:59:11,704 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 11:59:11,705 INFO  L435           NwaCegarLoop]: 432 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:11,705 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 438 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 11:59:11,712 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9874 states.
[2025-02-05 11:59:11,766 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9874 to 9545.
[2025-02-05 11:59:11,775 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9545 states, 9544 states have (on average 1.0499790444258172) internal successors, (10021), 9544 states have internal predecessors, (10021), 0 states have call successors, (0), 0 states 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 11:59:11,829 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9545 states to 9545 states and 10021 transitions.
[2025-02-05 11:59:11,830 INFO  L78                 Accepts]: Start accepts. Automaton has 9545 states and 10021 transitions. Word has length 1142
[2025-02-05 11:59:11,831 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:11,831 INFO  L471      AbstractCegarLoop]: Abstraction has 9545 states and 10021 transitions.
[2025-02-05 11:59:11,831 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states 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 11:59:11,831 INFO  L276                IsEmpty]: Start isEmpty. Operand 9545 states and 10021 transitions.
[2025-02-05 11:59:11,848 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1154
[2025-02-05 11:59:11,849 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:11,849 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:59:11,849 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 11:59:11,849 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:11,850 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:11,850 INFO  L85        PathProgramCache]: Analyzing trace with hash -585490778, now seen corresponding path program 1 times
[2025-02-05 11:59:11,850 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:11,850 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101394397]
[2025-02-05 11:59:11,850 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:11,851 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:11,945 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1153 statements into 1 equivalence classes.
[2025-02-05 11:59:11,997 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1153 of 1153 statements.
[2025-02-05 11:59:11,997 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:11,997 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:12,808 INFO  L134       CoverageAnalysis]: Checked inductivity of 2143 backedges. 1488 proven. 0 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked.
[2025-02-05 11:59:12,808 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:12,808 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101394397]
[2025-02-05 11:59:12,808 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101394397] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:12,809 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:12,809 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 11:59:12,809 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861674627]
[2025-02-05 11:59:12,809 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:12,809 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:59:12,810 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:12,810 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:59:12,810 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:59:12,810 INFO  L87              Difference]: Start difference. First operand 9545 states and 10021 transitions. Second operand  has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 0 states have call successors, (0), 0 states 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 11:59:13,543 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:13,544 INFO  L93              Difference]: Finished difference Result 18437 states and 19383 transitions.
[2025-02-05 11:59:13,544 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 11:59:13,544 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 0 states have call successors, (0), 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 1153
[2025-02-05 11:59:13,545 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:13,557 INFO  L225             Difference]: With dead ends: 18437
[2025-02-05 11:59:13,557 INFO  L226             Difference]: Without dead ends: 9552
[2025-02-05 11:59:13,564 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 11:59:13,565 INFO  L435           NwaCegarLoop]: 430 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1331 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:13,565 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 444 Invalid, 1354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1331 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 11:59:13,571 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9552 states.
[2025-02-05 11:59:13,652 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9552 to 9545.
[2025-02-05 11:59:13,661 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9545 states, 9544 states have (on average 1.04976948868399) internal successors, (10019), 9544 states have internal predecessors, (10019), 0 states have call successors, (0), 0 states 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 11:59:13,669 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9545 states to 9545 states and 10019 transitions.
[2025-02-05 11:59:13,670 INFO  L78                 Accepts]: Start accepts. Automaton has 9545 states and 10019 transitions. Word has length 1153
[2025-02-05 11:59:13,670 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:13,670 INFO  L471      AbstractCegarLoop]: Abstraction has 9545 states and 10019 transitions.
[2025-02-05 11:59:13,670 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 0 states have call successors, (0), 0 states 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 11:59:13,671 INFO  L276                IsEmpty]: Start isEmpty. Operand 9545 states and 10019 transitions.
[2025-02-05 11:59:13,681 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1161
[2025-02-05 11:59:13,682 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:13,682 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:13,682 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 11:59:13,682 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:13,683 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:13,683 INFO  L85        PathProgramCache]: Analyzing trace with hash -739625325, now seen corresponding path program 1 times
[2025-02-05 11:59:13,683 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:13,683 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903359966]
[2025-02-05 11:59:13,683 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:13,683 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:13,745 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1160 statements into 1 equivalence classes.
[2025-02-05 11:59:13,779 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1160 of 1160 statements.
[2025-02-05 11:59:13,779 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:13,779 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:14,097 INFO  L134       CoverageAnalysis]: Checked inductivity of 2711 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked.
[2025-02-05 11:59:14,097 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:14,097 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903359966]
[2025-02-05 11:59:14,097 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903359966] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:14,097 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:14,098 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:59:14,098 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207437160]
[2025-02-05 11:59:14,098 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:14,098 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:14,098 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:14,099 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:14,099 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:14,099 INFO  L87              Difference]: Start difference. First operand 9545 states and 10019 transitions. Second operand  has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:14,639 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:14,639 INFO  L93              Difference]: Finished difference Result 19417 states and 20374 transitions.
[2025-02-05 11:59:14,639 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:14,639 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1160
[2025-02-05 11:59:14,640 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:14,651 INFO  L225             Difference]: With dead ends: 19417
[2025-02-05 11:59:14,651 INFO  L226             Difference]: Without dead ends: 9545
[2025-02-05 11:59:14,658 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 11:59:14,659 INFO  L435           NwaCegarLoop]: 405 mSDtfsCounter, 172 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:14,659 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 410 Invalid, 814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 11:59:14,664 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9545 states.
[2025-02-05 11:59:14,707 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9545 to 9216.
[2025-02-05 11:59:14,712 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9216 states, 9215 states have (on average 1.034617471513836) internal successors, (9534), 9215 states have internal predecessors, (9534), 0 states have call successors, (0), 0 states 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 11:59:14,719 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 9534 transitions.
[2025-02-05 11:59:14,720 INFO  L78                 Accepts]: Start accepts. Automaton has 9216 states and 9534 transitions. Word has length 1160
[2025-02-05 11:59:14,720 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:14,720 INFO  L471      AbstractCegarLoop]: Abstraction has 9216 states and 9534 transitions.
[2025-02-05 11:59:14,720 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-05 11:59:14,721 INFO  L276                IsEmpty]: Start isEmpty. Operand 9216 states and 9534 transitions.
[2025-02-05 11:59:14,732 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1248
[2025-02-05 11:59:14,732 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:14,733 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:14,733 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 11:59:14,733 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:14,734 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:14,734 INFO  L85        PathProgramCache]: Analyzing trace with hash 631150122, now seen corresponding path program 1 times
[2025-02-05 11:59:14,734 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:14,734 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133631196]
[2025-02-05 11:59:14,734 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:14,734 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:14,789 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1247 statements into 1 equivalence classes.
[2025-02-05 11:59:14,817 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1247 of 1247 statements.
[2025-02-05 11:59:14,817 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:14,818 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:15,224 INFO  L134       CoverageAnalysis]: Checked inductivity of 2545 backedges. 1858 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked.
[2025-02-05 11:59:15,224 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:15,224 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133631196]
[2025-02-05 11:59:15,224 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133631196] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:15,224 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:15,224 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-05 11:59:15,224 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120532927]
[2025-02-05 11:59:15,224 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:15,225 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:15,225 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:15,227 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:15,227 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-05 11:59:15,227 INFO  L87              Difference]: Start difference. First operand 9216 states and 9534 transitions. Second operand  has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states 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 11:59:15,811 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:15,811 INFO  L93              Difference]: Finished difference Result 18101 states and 18732 transitions.
[2025-02-05 11:59:15,811 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:15,812 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 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 1247
[2025-02-05 11:59:15,812 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:15,822 INFO  L225             Difference]: With dead ends: 18101
[2025-02-05 11:59:15,822 INFO  L226             Difference]: Without dead ends: 9216
[2025-02-05 11:59:15,829 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 11:59:15,829 INFO  L435           NwaCegarLoop]: 413 mSDtfsCounter, 193 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:15,829 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 419 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 11:59:15,834 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9216 states.
[2025-02-05 11:59:15,911 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 9216.
[2025-02-05 11:59:15,924 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9216 states, 9215 states have (on average 1.0286489419424851) internal successors, (9479), 9215 states have internal predecessors, (9479), 0 states have call successors, (0), 0 states 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 11:59:15,936 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9216 states to 9216 states and 9479 transitions.
[2025-02-05 11:59:15,937 INFO  L78                 Accepts]: Start accepts. Automaton has 9216 states and 9479 transitions. Word has length 1247
[2025-02-05 11:59:15,938 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:15,938 INFO  L471      AbstractCegarLoop]: Abstraction has 9216 states and 9479 transitions.
[2025-02-05 11:59:15,938 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states 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 11:59:15,938 INFO  L276                IsEmpty]: Start isEmpty. Operand 9216 states and 9479 transitions.
[2025-02-05 11:59:15,961 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1273
[2025-02-05 11:59:15,962 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:15,962 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:15,962 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 11:59:15,963 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:15,964 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:15,964 INFO  L85        PathProgramCache]: Analyzing trace with hash -1462907073, now seen corresponding path program 1 times
[2025-02-05 11:59:15,964 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:15,964 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848643234]
[2025-02-05 11:59:15,964 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:15,964 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:16,047 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1272 statements into 1 equivalence classes.
[2025-02-05 11:59:16,079 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1272 of 1272 statements.
[2025-02-05 11:59:16,080 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:16,080 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:16,699 INFO  L134       CoverageAnalysis]: Checked inductivity of 2670 backedges. 1845 proven. 0 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked.
[2025-02-05 11:59:16,699 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:16,699 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848643234]
[2025-02-05 11:59:16,699 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848643234] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:16,699 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 11:59:16,699 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 11:59:16,700 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3345548]
[2025-02-05 11:59:16,700 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:16,701 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 11:59:16,701 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:16,702 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 11:59:16,702 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 11:59:16,702 INFO  L87              Difference]: Start difference. First operand 9216 states and 9479 transitions. Second operand  has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 0 states 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 11:59:17,585 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:17,585 INFO  L93              Difference]: Finished difference Result 18101 states and 18635 transitions.
[2025-02-05 11:59:17,585 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 11:59:17,586 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 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 1272
[2025-02-05 11:59:17,586 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:17,595 INFO  L225             Difference]: With dead ends: 18101
[2025-02-05 11:59:17,595 INFO  L226             Difference]: Without dead ends: 9545
[2025-02-05 11:59:17,603 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 11:59:17,603 INFO  L435           NwaCegarLoop]: 425 mSDtfsCounter, 120 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 1322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:17,604 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 554 Invalid, 1322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 11:59:17,610 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9545 states.
[2025-02-05 11:59:17,659 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9545 to 9545.
[2025-02-05 11:59:17,666 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9545 states, 9544 states have (on average 1.0277661357921206) internal successors, (9809), 9544 states have internal predecessors, (9809), 0 states have call successors, (0), 0 states 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 11:59:17,674 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9545 states to 9545 states and 9809 transitions.
[2025-02-05 11:59:17,674 INFO  L78                 Accepts]: Start accepts. Automaton has 9545 states and 9809 transitions. Word has length 1272
[2025-02-05 11:59:17,675 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:17,675 INFO  L471      AbstractCegarLoop]: Abstraction has 9545 states and 9809 transitions.
[2025-02-05 11:59:17,675 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 192.75) internal successors, (771), 4 states have internal predecessors, (771), 0 states have call successors, (0), 0 states 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 11:59:17,675 INFO  L276                IsEmpty]: Start isEmpty. Operand 9545 states and 9809 transitions.
[2025-02-05 11:59:17,689 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1366
[2025-02-05 11:59:17,690 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:17,690 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, 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, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:17,690 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 11:59:17,690 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:17,691 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:17,691 INFO  L85        PathProgramCache]: Analyzing trace with hash 532208977, now seen corresponding path program 1 times
[2025-02-05 11:59:17,691 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:17,691 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143605815]
[2025-02-05 11:59:17,691 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:17,691 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:17,760 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1365 statements into 1 equivalence classes.
[2025-02-05 11:59:17,794 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1365 of 1365 statements.
[2025-02-05 11:59:17,794 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:17,794 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:18,533 INFO  L134       CoverageAnalysis]: Checked inductivity of 2981 backedges. 2223 proven. 202 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked.
[2025-02-05 11:59:18,534 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:18,534 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143605815]
[2025-02-05 11:59:18,534 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143605815] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:59:18,534 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214645935]
[2025-02-05 11:59:18,534 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:18,534 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:59:18,534 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:59:18,536 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 11:59:18,538 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 11:59:18,628 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1365 statements into 1 equivalence classes.
[2025-02-05 11:59:18,778 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1365 of 1365 statements.
[2025-02-05 11:59:18,778 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:18,778 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:18,782 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1545 conjuncts, 2 conjuncts are in the unsatisfiable core
[2025-02-05 11:59:18,797 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:59:19,279 INFO  L134       CoverageAnalysis]: Checked inductivity of 2981 backedges. 1741 proven. 0 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked.
[2025-02-05 11:59:19,279 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:59:19,279 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [214645935] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:19,279 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:59:19,279 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7
[2025-02-05 11:59:19,279 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752286532]
[2025-02-05 11:59:19,280 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:19,280 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:19,280 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:19,281 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:19,281 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2025-02-05 11:59:19,281 INFO  L87              Difference]: Start difference. First operand 9545 states and 9809 transitions. Second operand  has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states 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 11:59:19,797 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:19,797 INFO  L93              Difference]: Finished difference Result 18430 states and 18952 transitions.
[2025-02-05 11:59:19,797 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:19,797 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 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 1365
[2025-02-05 11:59:19,798 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:19,812 INFO  L225             Difference]: With dead ends: 18430
[2025-02-05 11:59:19,812 INFO  L226             Difference]: Without dead ends: 9545
[2025-02-05 11:59:19,816 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1369 GetRequests, 1364 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2025-02-05 11:59:19,817 INFO  L435           NwaCegarLoop]: 371 mSDtfsCounter, 94 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:19,817 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 377 Invalid, 771 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 11:59:19,822 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 9545 states.
[2025-02-05 11:59:19,868 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 9545 to 9545.
[2025-02-05 11:59:19,873 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 9545 states, 9544 states have (on average 1.0259849119865885) internal successors, (9792), 9544 states have internal predecessors, (9792), 0 states have call successors, (0), 0 states 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 11:59:19,881 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9545 states to 9545 states and 9792 transitions.
[2025-02-05 11:59:19,881 INFO  L78                 Accepts]: Start accepts. Automaton has 9545 states and 9792 transitions. Word has length 1365
[2025-02-05 11:59:19,882 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:19,882 INFO  L471      AbstractCegarLoop]: Abstraction has 9545 states and 9792 transitions.
[2025-02-05 11:59:19,882 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 states 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 11:59:19,882 INFO  L276                IsEmpty]: Start isEmpty. Operand 9545 states and 9792 transitions.
[2025-02-05 11:59:19,897 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1696
[2025-02-05 11:59:19,897 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:19,898 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, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 3, 3, 3, 3, 3, 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]
[2025-02-05 11:59:19,906 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 11:59:20,098 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2025-02-05 11:59:20,099 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:20,099 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:20,099 INFO  L85        PathProgramCache]: Analyzing trace with hash 1752549213, now seen corresponding path program 1 times
[2025-02-05 11:59:20,099 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:20,099 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078059989]
[2025-02-05 11:59:20,099 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:20,099 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:20,180 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1695 statements into 1 equivalence classes.
[2025-02-05 11:59:20,214 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1695 of 1695 statements.
[2025-02-05 11:59:20,214 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:20,214 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:21,305 INFO  L134       CoverageAnalysis]: Checked inductivity of 4986 backedges. 3343 proven. 202 refuted. 0 times theorem prover too weak. 1441 trivial. 0 not checked.
[2025-02-05 11:59:21,305 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:21,305 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078059989]
[2025-02-05 11:59:21,305 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078059989] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:59:21,305 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285168245]
[2025-02-05 11:59:21,305 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:21,305 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:59:21,305 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:59:21,307 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 11:59:21,308 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 11:59:21,410 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1695 statements into 1 equivalence classes.
[2025-02-05 11:59:21,592 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1695 of 1695 statements.
[2025-02-05 11:59:21,592 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:21,592 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:21,598 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1921 conjuncts, 7 conjuncts are in the unsatisfiable core
[2025-02-05 11:59:21,610 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:59:23,677 INFO  L134       CoverageAnalysis]: Checked inductivity of 4986 backedges. 2313 proven. 201 refuted. 0 times theorem prover too weak. 2472 trivial. 0 not checked.
[2025-02-05 11:59:23,678 INFO  L312         TraceCheckSpWp]: Computing backward predicates...
[2025-02-05 11:59:26,641 INFO  L134       CoverageAnalysis]: Checked inductivity of 4986 backedges. 2313 proven. 201 refuted. 0 times theorem prover too weak. 2472 trivial. 0 not checked.
[2025-02-05 11:59:26,642 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285168245] provided 0 perfect and 2 imperfect interpolant sequences
[2025-02-05 11:59:26,642 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2025-02-05 11:59:26,642 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9
[2025-02-05 11:59:26,642 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513054342]
[2025-02-05 11:59:26,642 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2025-02-05 11:59:26,644 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-02-05 11:59:26,644 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:26,659 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-02-05 11:59:26,659 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2025-02-05 11:59:26,659 INFO  L87              Difference]: Start difference. First operand 9545 states and 9792 transitions. Second operand  has 10 states, 10 states have (on average 174.6) internal successors, (1746), 9 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states 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 11:59:29,682 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:29,682 INFO  L93              Difference]: Finished difference Result 19417 states and 19919 transitions.
[2025-02-05 11:59:29,682 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2025-02-05 11:59:29,682 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 174.6) internal successors, (1746), 9 states have internal predecessors, (1746), 0 states have call successors, (0), 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 1695
[2025-02-05 11:59:29,683 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:29,692 INFO  L225             Difference]: With dead ends: 19417
[2025-02-05 11:59:29,692 INFO  L226             Difference]: Without dead ends: 10532
[2025-02-05 11:59:29,696 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3399 GetRequests, 3385 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240
[2025-02-05 11:59:29,697 INFO  L435           NwaCegarLoop]: 20 mSDtfsCounter, 1458 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 7126 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1458 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 7261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 7126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:29,697 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1458 Valid, 88 Invalid, 7261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 7126 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time]
[2025-02-05 11:59:29,702 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10532 states.
[2025-02-05 11:59:29,764 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10532 to 10203.
[2025-02-05 11:59:29,770 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10203 states, 10202 states have (on average 1.0203881591844737) internal successors, (10410), 10202 states have internal predecessors, (10410), 0 states have call successors, (0), 0 states 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 11:59:29,778 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10203 states to 10203 states and 10410 transitions.
[2025-02-05 11:59:29,779 INFO  L78                 Accepts]: Start accepts. Automaton has 10203 states and 10410 transitions. Word has length 1695
[2025-02-05 11:59:29,779 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:29,779 INFO  L471      AbstractCegarLoop]: Abstraction has 10203 states and 10410 transitions.
[2025-02-05 11:59:29,779 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 174.6) internal successors, (1746), 9 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states 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 11:59:29,779 INFO  L276                IsEmpty]: Start isEmpty. Operand 10203 states and 10410 transitions.
[2025-02-05 11:59:29,809 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1814
[2025-02-05 11:59:29,809 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:29,809 INFO  L218           NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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]
[2025-02-05 11:59:29,817 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2025-02-05 11:59:30,010 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:59:30,010 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:30,011 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:30,011 INFO  L85        PathProgramCache]: Analyzing trace with hash 1472871313, now seen corresponding path program 1 times
[2025-02-05 11:59:30,011 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:30,011 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763891282]
[2025-02-05 11:59:30,011 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:30,011 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:30,117 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1813 statements into 1 equivalence classes.
[2025-02-05 11:59:30,187 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1813 of 1813 statements.
[2025-02-05 11:59:30,187 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:30,187 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:33,723 INFO  L134       CoverageAnalysis]: Checked inductivity of 6040 backedges. 3588 proven. 1556 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked.
[2025-02-05 11:59:33,726 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:33,726 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763891282]
[2025-02-05 11:59:33,726 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763891282] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:59:33,726 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698758579]
[2025-02-05 11:59:33,726 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:33,726 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:59:33,726 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:59:33,728 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 11:59:33,729 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 11:59:33,844 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1813 statements into 1 equivalence classes.
[2025-02-05 11:59:34,059 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1813 of 1813 statements.
[2025-02-05 11:59:34,059 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:34,059 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:34,065 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2060 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-02-05 11:59:34,099 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:59:34,381 INFO  L134       CoverageAnalysis]: Checked inductivity of 6040 backedges. 4041 proven. 0 refuted. 0 times theorem prover too weak. 1999 trivial. 0 not checked.
[2025-02-05 11:59:34,382 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:59:34,382 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698758579] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:34,382 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:59:34,382 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9
[2025-02-05 11:59:34,382 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945229045]
[2025-02-05 11:59:34,382 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:34,383 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:34,383 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:34,384 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:34,384 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2025-02-05 11:59:34,385 INFO  L87              Difference]: Start difference. First operand 10203 states and 10410 transitions. Second operand  has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states 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 11:59:34,984 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:34,984 INFO  L93              Difference]: Finished difference Result 20075 states and 20487 transitions.
[2025-02-05 11:59:34,984 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:34,984 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 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 1813
[2025-02-05 11:59:34,985 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:34,998 INFO  L225             Difference]: With dead ends: 20075
[2025-02-05 11:59:34,998 INFO  L226             Difference]: Without dead ends: 10203
[2025-02-05 11:59:35,006 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1821 GetRequests, 1814 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72
[2025-02-05 11:59:35,007 INFO  L435           NwaCegarLoop]: 405 mSDtfsCounter, 65 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:35,007 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 411 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 11:59:35,014 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10203 states.
[2025-02-05 11:59:35,089 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10203 to 10203.
[2025-02-05 11:59:35,096 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10203 states, 10202 states have (on average 1.015193099392276) internal successors, (10357), 10202 states have internal predecessors, (10357), 0 states have call successors, (0), 0 states 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 11:59:35,107 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10203 states to 10203 states and 10357 transitions.
[2025-02-05 11:59:35,108 INFO  L78                 Accepts]: Start accepts. Automaton has 10203 states and 10357 transitions. Word has length 1813
[2025-02-05 11:59:35,109 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:35,109 INFO  L471      AbstractCegarLoop]: Abstraction has 10203 states and 10357 transitions.
[2025-02-05 11:59:35,109 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 0 states have call successors, (0), 0 states 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 11:59:35,109 INFO  L276                IsEmpty]: Start isEmpty. Operand 10203 states and 10357 transitions.
[2025-02-05 11:59:35,150 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1965
[2025-02-05 11:59:35,150 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:35,150 INFO  L218           NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:35,157 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 11:59:35,351 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,SelfDestructingSolverStorable17
[2025-02-05 11:59:35,351 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:35,352 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:35,352 INFO  L85        PathProgramCache]: Analyzing trace with hash 1885944807, now seen corresponding path program 1 times
[2025-02-05 11:59:35,352 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:35,352 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734906153]
[2025-02-05 11:59:35,352 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:35,352 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:35,500 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1964 statements into 1 equivalence classes.
[2025-02-05 11:59:35,558 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1964 of 1964 statements.
[2025-02-05 11:59:35,558 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:35,558 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:37,935 INFO  L134       CoverageAnalysis]: Checked inductivity of 8220 backedges. 3802 proven. 383 refuted. 0 times theorem prover too weak. 4035 trivial. 0 not checked.
[2025-02-05 11:59:37,935 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:37,935 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734906153]
[2025-02-05 11:59:37,935 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734906153] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:59:37,935 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568230201]
[2025-02-05 11:59:37,935 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:37,936 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:59:37,936 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:59:37,937 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:59:37,940 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2025-02-05 11:59:38,054 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1964 statements into 1 equivalence classes.
[2025-02-05 11:59:38,283 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1964 of 1964 statements.
[2025-02-05 11:59:38,284 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:38,284 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:38,291 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2265 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-02-05 11:59:38,302 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:59:38,672 INFO  L134       CoverageAnalysis]: Checked inductivity of 8220 backedges. 4980 proven. 0 refuted. 0 times theorem prover too weak. 3240 trivial. 0 not checked.
[2025-02-05 11:59:38,672 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:59:38,672 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [568230201] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:38,672 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:59:38,672 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8
[2025-02-05 11:59:38,674 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204870396]
[2025-02-05 11:59:38,674 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:38,675 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:38,675 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:38,675 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:38,675 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2025-02-05 11:59:38,676 INFO  L87              Difference]: Start difference. First operand 10203 states and 10357 transitions. Second operand  has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states 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 11:59:39,200 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:39,200 INFO  L93              Difference]: Finished difference Result 19746 states and 20050 transitions.
[2025-02-05 11:59:39,201 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:39,201 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 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 1964
[2025-02-05 11:59:39,201 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:39,210 INFO  L225             Difference]: With dead ends: 19746
[2025-02-05 11:59:39,210 INFO  L226             Difference]: Without dead ends: 10203
[2025-02-05 11:59:39,214 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1971 GetRequests, 1965 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2025-02-05 11:59:39,215 INFO  L435           NwaCegarLoop]: 419 mSDtfsCounter, 120 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:39,215 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 425 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 11:59:39,219 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10203 states.
[2025-02-05 11:59:39,261 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10203 to 10203.
[2025-02-05 11:59:39,267 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10203 states, 10202 states have (on average 1.0148010194079593) internal successors, (10353), 10202 states have internal predecessors, (10353), 0 states have call successors, (0), 0 states 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 11:59:39,275 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10203 states to 10203 states and 10353 transitions.
[2025-02-05 11:59:39,275 INFO  L78                 Accepts]: Start accepts. Automaton has 10203 states and 10353 transitions. Word has length 1964
[2025-02-05 11:59:39,276 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:39,276 INFO  L471      AbstractCegarLoop]: Abstraction has 10203 states and 10353 transitions.
[2025-02-05 11:59:39,276 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states 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 11:59:39,276 INFO  L276                IsEmpty]: Start isEmpty. Operand 10203 states and 10353 transitions.
[2025-02-05 11:59:39,295 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1986
[2025-02-05 11:59:39,295 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 11:59:39,296 INFO  L218           NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:59:39,304 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2025-02-05 11:59:39,501 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:59:39,501 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 11:59:39,501 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 11:59:39,502 INFO  L85        PathProgramCache]: Analyzing trace with hash 2066204890, now seen corresponding path program 1 times
[2025-02-05 11:59:39,502 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 11:59:39,502 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233939515]
[2025-02-05 11:59:39,502 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:39,502 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 11:59:39,583 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1985 statements into 1 equivalence classes.
[2025-02-05 11:59:39,638 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1985 of 1985 statements.
[2025-02-05 11:59:39,638 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:39,638 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:41,898 INFO  L134       CoverageAnalysis]: Checked inductivity of 7930 backedges. 3719 proven. 383 refuted. 0 times theorem prover too weak. 3828 trivial. 0 not checked.
[2025-02-05 11:59:41,898 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 11:59:41,898 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233939515]
[2025-02-05 11:59:41,898 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233939515] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 11:59:41,898 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091903514]
[2025-02-05 11:59:41,898 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 11:59:41,898 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:59:41,898 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 11:59:41,900 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 11:59:41,902 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2025-02-05 11:59:42,042 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1985 statements into 1 equivalence classes.
[2025-02-05 11:59:42,237 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1985 of 1985 statements.
[2025-02-05 11:59:42,237 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 11:59:42,237 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 11:59:42,243 INFO  L256         TraceCheckSpWp]: Trace formula consists of 2280 conjuncts, 3 conjuncts are in the unsatisfiable core
[2025-02-05 11:59:42,253 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 11:59:42,613 INFO  L134       CoverageAnalysis]: Checked inductivity of 7930 backedges. 351 proven. 0 refuted. 0 times theorem prover too weak. 7579 trivial. 0 not checked.
[2025-02-05 11:59:42,613 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 11:59:42,613 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091903514] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 11:59:42,613 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 11:59:42,613 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8
[2025-02-05 11:59:42,613 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831428556]
[2025-02-05 11:59:42,614 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 11:59:42,614 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-05 11:59:42,614 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 11:59:42,614 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-05 11:59:42,614 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2025-02-05 11:59:42,615 INFO  L87              Difference]: Start difference. First operand 10203 states and 10353 transitions. Second operand  has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states 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 11:59:43,291 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 11:59:43,292 INFO  L93              Difference]: Finished difference Result 24350 states and 24737 transitions.
[2025-02-05 11:59:43,292 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-05 11:59:43,292 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 1985
[2025-02-05 11:59:43,293 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 11:59:43,293 INFO  L225             Difference]: With dead ends: 24350
[2025-02-05 11:59:43,293 INFO  L226             Difference]: Without dead ends: 0
[2025-02-05 11:59:43,302 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 1992 GetRequests, 1986 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2025-02-05 11:59:43,303 INFO  L435           NwaCegarLoop]: 26 mSDtfsCounter, 303 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 11:59:43,303 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 30 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 11:59:43,303 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2025-02-05 11:59:43,303 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2025-02-05 11:59:43,303 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states 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 11:59:43,304 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2025-02-05 11:59:43,304 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1985
[2025-02-05 11:59:43,304 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 11:59:43,304 INFO  L471      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2025-02-05 11:59:43,304 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states 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 11:59:43,304 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2025-02-05 11:59:43,304 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2025-02-05 11:59:43,312 INFO  L782   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2025-02-05 11:59:43,323 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2025-02-05 11:59:43,513 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 11:59:43,523 INFO  L422         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 11:59:43,525 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2025-02-05 11:59:44,092 INFO  L170   ceAbstractionStarter]: Computing trace abstraction results
[2025-02-05 11:59:44,132 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 11:59:44 BoogieIcfgContainer
[2025-02-05 11:59:44,132 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-02-05 11:59:44,133 INFO  L112        PluginConnector]: ------------------------Witness Printer----------------------------
[2025-02-05 11:59:44,133 INFO  L270        PluginConnector]: Initializing Witness Printer...
[2025-02-05 11:59:44,133 INFO  L274        PluginConnector]: Witness Printer initialized
[2025-02-05 11:59:44,134 INFO  L184        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:58:53" (3/4) ...
[2025-02-05 11:59:44,140 INFO  L146         WitnessPrinter]: Generating witness for correct program
[2025-02-05 11:59:44,179 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges
[2025-02-05 11:59:44,180 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2025-02-05 11:59:44,182 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2025-02-05 11:59:44,183 INFO  L919   BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2025-02-05 11:59:44,388 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2025-02-05 11:59:44,389 INFO  L149         WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2025-02-05 11:59:44,389 INFO  L131        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2025-02-05 11:59:44,389 INFO  L158              Benchmark]: Toolchain (without parser) took 53225.14ms. Allocated memory was 167.8MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 129.9MB in the beginning and 474.0MB in the end (delta: -344.0MB). Peak memory consumption was 787.8MB. Max. memory is 16.1GB.
[2025-02-05 11:59:44,389 INFO  L158              Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB.
[2025-02-05 11:59:44,390 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 561.98ms. Allocated memory is still 167.8MB. Free memory was 129.9MB in the beginning and 71.6MB in the end (delta: 58.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB.
[2025-02-05 11:59:44,390 INFO  L158              Benchmark]: Boogie Procedure Inliner took 118.39ms. Allocated memory is still 167.8MB. Free memory was 71.6MB in the beginning and 48.7MB in the end (delta: 22.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-02-05 11:59:44,390 INFO  L158              Benchmark]: Boogie Preprocessor took 229.91ms. Allocated memory is still 167.8MB. Free memory was 48.7MB in the beginning and 90.0MB in the end (delta: -41.3MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB.
[2025-02-05 11:59:44,390 INFO  L158              Benchmark]: IcfgBuilder took 1830.83ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 90.0MB in the beginning and 181.9MB in the end (delta: -91.9MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB.
[2025-02-05 11:59:44,390 INFO  L158              Benchmark]: TraceAbstraction took 50222.71ms. Allocated memory was 234.9MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 181.9MB in the beginning and 499.1MB in the end (delta: -317.2MB). Peak memory consumption was 751.9MB. Max. memory is 16.1GB.
[2025-02-05 11:59:44,391 INFO  L158              Benchmark]: Witness Printer took 255.51ms. Allocated memory is still 1.3GB. Free memory was 499.1MB in the beginning and 474.0MB in the end (delta: 25.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
[2025-02-05 11:59:44,392 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 561.98ms. Allocated memory is still 167.8MB. Free memory was 129.9MB in the beginning and 71.6MB in the end (delta: 58.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 118.39ms. Allocated memory is still 167.8MB. Free memory was 71.6MB in the beginning and 48.7MB in the end (delta: 22.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 229.91ms. Allocated memory is still 167.8MB. Free memory was 48.7MB in the beginning and 90.0MB in the end (delta: -41.3MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB.
 * IcfgBuilder took 1830.83ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 90.0MB in the beginning and 181.9MB in the end (delta: -91.9MB). Peak memory consumption was 58.6MB. Max. memory is 16.1GB.
 * TraceAbstraction took 50222.71ms. Allocated memory was 234.9MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 181.9MB in the beginning and 499.1MB in the end (delta: -317.2MB). Peak memory consumption was 751.9MB. Max. memory is 16.1GB.
 * Witness Printer took 255.51ms. Allocated memory is still 1.3GB. Free memory was 499.1MB in the beginning and 474.0MB in the end (delta: 25.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - PositiveResult [Line: 119]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 1 procedures, 396 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.6s, OverallIterations: 20, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 18.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6340 SdHoareTripleChecker+Valid, 16.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6340 mSDsluCounter, 5690 SdHoareTripleChecker+Invalid, 13.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 438 mSDsCounter, 2438 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24263 IncrementalHoareTripleChecker+Invalid, 26701 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2438 mSolverCounterUnsat, 5252 mSDtfsCounter, 24263 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11692 GetRequests, 11625 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10203occurred in iteration=17, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 20 MinimizatonAttempts, 1324 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 24.4s InterpolantComputationTime, 31326 NumberOfCodeBlocks, 31326 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 32994 ConstructedInterpolants, 0 QuantifiedInterpolants, 94440 SizeOfPredicates, 2 NumberOfNonLiveVariables, 11365 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 27 InterpolantComputations, 19 PerfectInterpolantSequences, 89695/93037 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
  - InvariantResult [Line: 1783]: Location Invariant
    Derived location invariant: ((((((((((((((((((((((((a16 == 9) && (a12 == 8)) && (a18 <= 133)) && (4 <= a15)) || (((a16 == 9) && (a12 == 8)) && (((long long) a18 + 156) <= 0))) || ((((a16 == 9) && (a18 <= 133)) && (a12 == 6)) && (4 <= a15))) || (((a16 == 8) && (a15 == 4)) && (7 == a12))) || ((a16 <= 8) && (a12 == 9))) || (((a16 == 9) && (a18 <= 133)) && (a15 == 3))) || (((a12 == 8) && (a16 == 12)) && (a15 == 3))) || (((a12 == 9) && (a16 == 9)) && (a18 <= 133))) || ((((a12 == 6) && (a16 != 9)) && (a16 <= 11)) && (4 <= a15))) || (((a12 == 9) && (a16 == 9)) && (a15 <= 3))) || ((((a12 == 8) && (a16 != 9)) && (a16 <= 11)) && (a15 == 3))) || (((((5 != a12) && (a18 <= 133)) && (a16 == 12)) && (a12 <= 7)) && (a15 == 3))) || (((a12 <= 5) && (a16 <= 11)) && (4 <= a15))) || (((a16 <= 8) && (a12 == 8)) && (a18 <= 133))) || (((a12 == 9) && (a16 == 12)) && (a15 == 3))) || ((((a12 <= 5) && (a16 == 12)) && (0 < ((long long) a18 + 156))) && (a15 == 3))) || ((((a12 == 9) && (a18 <= 133)) && (a16 <= 11)) && (a15 == 3))) || (((a12 != 6) && (a16 == 9)) && (a12 <= 7))) || ((a16 <= 8) && (a15 <= 3))) || (((a12 <= 7) && (a16 <= 11)) && (a15 == 3))) || (((a12 == 6) && (a16 == 12)) && (a15 == 3)))
RESULT: Ultimate proved your program to be correct!
[2025-02-05 11:59:44,408 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE