./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c --full-output --architecture 64bit


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


Checking for ERROR reachability
Using default analysis
Version e2fb8bed
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 64bit --witnessprinter.graph.data.programhash 0cc1df8b460086dc2c8e81ed9dc44fcfcc5d4615833dbf347c269d9f2b0ea709
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 09:25:51,764 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 09:25:51,824 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2025-03-08 09:25:51,830 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 09:25:51,830 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 09:25:51,852 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 09:25:51,854 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 09:25:51,854 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 09:25:51,854 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 09:25:51,854 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 09:25:51,855 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 09:25:51,855 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 09:25:51,855 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 09:25:51,855 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 09:25:51,856 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 09:25:51,856 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 09:25:51,856 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 09:25:51,856 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 09:25:51,856 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 09:25:51,856 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 09:25:51,857 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 09:25:51,857 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 09:25:51,857 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 09:25:51,857 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 09:25:51,857 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 09:25:51,857 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 09:25:51,857 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 09:25:51,857 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 09:25:51,857 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 09:25:51,857 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 09:25:51,858 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 09:25:51,858 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 09:25:51,858 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 09:25:51,858 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 09:25:51,858 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 09:25:51,858 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 09:25:51,858 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 09:25:51,858 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 09:25:51,858 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 09:25:51,858 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 09:25:51,858 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/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 -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0cc1df8b460086dc2c8e81ed9dc44fcfcc5d4615833dbf347c269d9f2b0ea709
[2025-03-08 09:25:52,074 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 09:25:52,081 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 09:25:52,082 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 09:25:52,083 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 09:25:52,083 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 09:25:52,085 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c
[2025-03-08 09:25:53,203 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd427edce/c93a3c4f54484c4f9e35888874189882/FLAG36696faf3
[2025-03-08 09:25:53,467 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 09:25:53,468 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c
[2025-03-08 09:25:53,478 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd427edce/c93a3c4f54484c4f9e35888874189882/FLAG36696faf3
[2025-03-08 09:25:53,762 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd427edce/c93a3c4f54484c4f9e35888874189882
[2025-03-08 09:25:53,764 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 09:25:53,765 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 09:25:53,766 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 09:25:53,766 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 09:25:53,769 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 09:25:53,770 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:25:53" (1/1) ...
[2025-03-08 09:25:53,770 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6342fb68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:53, skipping insertion in model container
[2025-03-08 09:25:53,771 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:25:53" (1/1) ...
[2025-03-08 09:25:53,798 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 09:25:53,914 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c[1311,1324]
[2025-03-08 09:25:54,110 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 09:25:54,117 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 09:25:54,126 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c[1311,1324]
[2025-03-08 09:25:54,222 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 09:25:54,231 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 09:25:54,232 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:54 WrapperNode
[2025-03-08 09:25:54,232 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 09:25:54,232 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 09:25:54,232 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 09:25:54,232 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 09:25:54,236 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:54" (1/1) ...
[2025-03-08 09:25:54,259 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:54" (1/1) ...
[2025-03-08 09:25:54,390 INFO  L138                Inliner]: procedures = 17, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1979
[2025-03-08 09:25:54,391 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 09:25:54,391 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 09:25:54,391 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 09:25:54,391 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 09:25:54,398 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:54" (1/1) ...
[2025-03-08 09:25:54,399 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:54" (1/1) ...
[2025-03-08 09:25:54,430 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:54" (1/1) ...
[2025-03-08 09:25:54,476 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-03-08 09:25:54,477 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:54" (1/1) ...
[2025-03-08 09:25:54,477 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:54" (1/1) ...
[2025-03-08 09:25:54,555 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:54" (1/1) ...
[2025-03-08 09:25:54,562 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:54" (1/1) ...
[2025-03-08 09:25:54,572 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:54" (1/1) ...
[2025-03-08 09:25:54,582 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:54" (1/1) ...
[2025-03-08 09:25:54,603 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 09:25:54,604 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 09:25:54,604 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 09:25:54,604 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 09:25:54,606 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:54" (1/1) ...
[2025-03-08 09:25:54,610 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 09:25:54,619 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 09:25:54,631 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-03-08 09:25:54,635 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-03-08 09:25:54,657 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 09:25:54,657 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-03-08 09:25:54,657 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-03-08 09:25:54,657 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 09:25:54,657 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 09:25:54,658 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 09:25:54,841 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 09:25:54,843 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 09:25:56,798 INFO  L?                        ?]: Removed 1004 outVars from TransFormulas that were not future-live.
[2025-03-08 09:25:56,799 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 09:25:56,903 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 09:25:56,903 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 09:25:56,904 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:25:56 BoogieIcfgContainer
[2025-03-08 09:25:56,904 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 09:25:56,908 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 09:25:56,909 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 09:25:56,912 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 09:25:56,913 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:25:53" (1/3) ...
[2025-03-08 09:25:56,913 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37346e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:25:56, skipping insertion in model container
[2025-03-08 09:25:56,913 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:25:54" (2/3) ...
[2025-03-08 09:25:56,914 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37346e4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:25:56, skipping insertion in model container
[2025-03-08 09:25:56,914 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:25:56" (3/3) ...
[2025-03-08 09:25:56,915 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c
[2025-03-08 09:25:56,928 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 09:25:56,930 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.safe_intersymbol_analog_estimation_convergence.c that has 2 procedures, 672 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 09:25:56,994 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 09:25:57,005 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;@2473e824, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 09:25:57,006 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 09:25:57,010 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 672 states, 667 states have (on average 1.5037481259370316) internal successors, (1003), 668 states have internal predecessors, (1003), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:25:57,030 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2025-03-08 09:25:57,031 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:25:57,032 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:25:57,032 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:25:57,037 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:25:57,037 INFO  L85        PathProgramCache]: Analyzing trace with hash 1241960342, now seen corresponding path program 1 times
[2025-03-08 09:25:57,043 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:25:57,044 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103815879]
[2025-03-08 09:25:57,045 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:25:57,046 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:25:57,156 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes.
[2025-03-08 09:25:57,210 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements.
[2025-03-08 09:25:57,211 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:25:57,211 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:25:57,470 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-03-08 09:25:57,470 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:25:57,471 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103815879]
[2025-03-08 09:25:57,471 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103815879] provided 0 perfect and 1 imperfect interpolant sequences
[2025-03-08 09:25:57,471 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963698195]
[2025-03-08 09:25:57,471 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:25:57,471 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-03-08 09:25:57,472 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 09:25:57,474 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-03-08 09:25:57,476 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-03-08 09:25:57,676 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes.
[2025-03-08 09:25:57,808 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements.
[2025-03-08 09:25:57,808 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:25:57,808 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:25:57,815 INFO  L256         TraceCheckSpWp]: Trace formula consists of 1097 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-03-08 09:25:57,825 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-03-08 09:25:57,847 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2025-03-08 09:25:57,847 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-03-08 09:25:57,847 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [963698195] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:25:57,847 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-03-08 09:25:57,848 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-03-08 09:25:57,849 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440270001]
[2025-03-08 09:25:57,853 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:25:57,857 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-03-08 09:25:57,858 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:25:57,882 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-03-08 09:25:57,882 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 09:25:57,885 INFO  L87              Difference]: Start difference. First operand  has 672 states, 667 states have (on average 1.5037481259370316) internal successors, (1003), 668 states have internal predecessors, (1003), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand  has 2 states, 2 states have (on average 110.0) internal successors, (220), 2 states have internal predecessors, (220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:25:58,134 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:25:58,134 INFO  L93              Difference]: Finished difference Result 1307 states and 1964 transitions.
[2025-03-08 09:25:58,135 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-03-08 09:25:58,136 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 110.0) internal successors, (220), 2 states have internal predecessors, (220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 225
[2025-03-08 09:25:58,136 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:25:58,146 INFO  L225             Difference]: With dead ends: 1307
[2025-03-08 09:25:58,146 INFO  L226             Difference]: Without dead ends: 669
[2025-03-08 09:25:58,151 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-03-08 09:25:58,155 INFO  L435           NwaCegarLoop]: 833 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 09:25:58,155 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 833 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 09:25:58,169 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 669 states.
[2025-03-08 09:25:58,197 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 669.
[2025-03-08 09:25:58,198 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 669 states, 665 states have (on average 1.4887218045112782) internal successors, (990), 665 states have internal predecessors, (990), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:25:58,202 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 994 transitions.
[2025-03-08 09:25:58,203 INFO  L78                 Accepts]: Start accepts. Automaton has 669 states and 994 transitions. Word has length 225
[2025-03-08 09:25:58,204 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:25:58,204 INFO  L471      AbstractCegarLoop]: Abstraction has 669 states and 994 transitions.
[2025-03-08 09:25:58,205 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 110.0) internal successors, (220), 2 states have internal predecessors, (220), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:25:58,205 INFO  L276                IsEmpty]: Start isEmpty. Operand 669 states and 994 transitions.
[2025-03-08 09:25:58,208 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 226
[2025-03-08 09:25:58,211 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:25:58,212 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:25:58,220 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-03-08 09:25:58,412 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-03-08 09:25:58,413 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:25:58,417 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:25:58,417 INFO  L85        PathProgramCache]: Analyzing trace with hash 1717725844, now seen corresponding path program 1 times
[2025-03-08 09:25:58,417 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:25:58,417 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590965131]
[2025-03-08 09:25:58,417 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:25:58,417 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:25:58,460 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes.
[2025-03-08 09:25:58,613 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements.
[2025-03-08 09:25:58,613 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:25:58,613 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:25:59,404 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:25:59,407 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:25:59,407 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590965131]
[2025-03-08 09:25:59,407 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590965131] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:25:59,407 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:25:59,407 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 09:25:59,407 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855766181]
[2025-03-08 09:25:59,407 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:25:59,408 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 09:25:59,408 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:25:59,409 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 09:25:59,409 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:25:59,409 INFO  L87              Difference]: Start difference. First operand 669 states and 994 transitions. Second operand  has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:25:59,792 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:25:59,792 INFO  L93              Difference]: Finished difference Result 1303 states and 1937 transitions.
[2025-03-08 09:25:59,792 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 09:25:59,792 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 225
[2025-03-08 09:25:59,793 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:25:59,795 INFO  L225             Difference]: With dead ends: 1303
[2025-03-08 09:25:59,795 INFO  L226             Difference]: Without dead ends: 668
[2025-03-08 09:25:59,798 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:25:59,799 INFO  L435           NwaCegarLoop]: 771 mSDtfsCounter, 958 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 09:25:59,799 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 1544 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 09:25:59,800 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 668 states.
[2025-03-08 09:25:59,819 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 668.
[2025-03-08 09:25:59,824 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 668 states, 664 states have (on average 1.4864457831325302) internal successors, (987), 664 states have internal predecessors, (987), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:25:59,827 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 991 transitions.
[2025-03-08 09:25:59,827 INFO  L78                 Accepts]: Start accepts. Automaton has 668 states and 991 transitions. Word has length 225
[2025-03-08 09:25:59,828 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:25:59,828 INFO  L471      AbstractCegarLoop]: Abstraction has 668 states and 991 transitions.
[2025-03-08 09:25:59,828 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 54.5) internal successors, (218), 4 states have internal predecessors, (218), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:25:59,828 INFO  L276                IsEmpty]: Start isEmpty. Operand 668 states and 991 transitions.
[2025-03-08 09:25:59,830 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 227
[2025-03-08 09:25:59,830 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:25:59,830 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:25:59,833 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 09:25:59,834 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:25:59,834 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:25:59,834 INFO  L85        PathProgramCache]: Analyzing trace with hash 311033795, now seen corresponding path program 1 times
[2025-03-08 09:25:59,834 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:25:59,834 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244951104]
[2025-03-08 09:25:59,834 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:25:59,834 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:25:59,870 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes.
[2025-03-08 09:25:59,940 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements.
[2025-03-08 09:25:59,941 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:25:59,941 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:00,520 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:00,520 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:00,520 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244951104]
[2025-03-08 09:26:00,521 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244951104] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:00,521 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:00,521 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 09:26:00,521 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400970316]
[2025-03-08 09:26:00,522 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:00,522 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 09:26:00,523 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:00,524 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 09:26:00,524 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:26:00,524 INFO  L87              Difference]: Start difference. First operand 668 states and 991 transitions. Second operand  has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:00,817 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:00,817 INFO  L93              Difference]: Finished difference Result 672 states and 995 transitions.
[2025-03-08 09:26:00,817 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 09:26:00,817 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 226
[2025-03-08 09:26:00,818 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:00,821 INFO  L225             Difference]: With dead ends: 672
[2025-03-08 09:26:00,822 INFO  L226             Difference]: Without dead ends: 670
[2025-03-08 09:26:00,823 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:26:00,823 INFO  L435           NwaCegarLoop]: 829 mSDtfsCounter, 0 mSDsluCounter, 1653 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2482 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:00,824 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2482 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 09:26:00,825 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 670 states.
[2025-03-08 09:26:00,838 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670.
[2025-03-08 09:26:00,839 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 670 states, 666 states have (on average 1.484984984984985) internal successors, (989), 666 states have internal predecessors, (989), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:26:00,841 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 993 transitions.
[2025-03-08 09:26:00,841 INFO  L78                 Accepts]: Start accepts. Automaton has 670 states and 993 transitions. Word has length 226
[2025-03-08 09:26:00,842 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:00,842 INFO  L471      AbstractCegarLoop]: Abstraction has 670 states and 993 transitions.
[2025-03-08 09:26:00,842 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:00,843 INFO  L276                IsEmpty]: Start isEmpty. Operand 670 states and 993 transitions.
[2025-03-08 09:26:00,845 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 228
[2025-03-08 09:26:00,845 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:00,845 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:00,846 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 09:26:00,846 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:00,846 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:00,847 INFO  L85        PathProgramCache]: Analyzing trace with hash 1056792613, now seen corresponding path program 1 times
[2025-03-08 09:26:00,847 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:00,847 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888685129]
[2025-03-08 09:26:00,847 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:00,847 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:00,879 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes.
[2025-03-08 09:26:00,932 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements.
[2025-03-08 09:26:00,932 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:00,932 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:01,241 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:01,241 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:01,241 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888685129]
[2025-03-08 09:26:01,241 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888685129] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:01,241 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:01,241 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 09:26:01,242 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931141851]
[2025-03-08 09:26:01,242 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:01,242 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 09:26:01,242 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:01,243 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 09:26:01,243 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:26:01,243 INFO  L87              Difference]: Start difference. First operand 670 states and 993 transitions. Second operand  has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:01,546 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:01,547 INFO  L93              Difference]: Finished difference Result 1308 states and 1939 transitions.
[2025-03-08 09:26:01,547 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 09:26:01,547 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 227
[2025-03-08 09:26:01,548 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:01,550 INFO  L225             Difference]: With dead ends: 1308
[2025-03-08 09:26:01,550 INFO  L226             Difference]: Without dead ends: 672
[2025-03-08 09:26:01,552 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:26:01,553 INFO  L435           NwaCegarLoop]: 829 mSDtfsCounter, 0 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2479 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:01,553 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2479 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 09:26:01,555 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 672 states.
[2025-03-08 09:26:01,566 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672.
[2025-03-08 09:26:01,567 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 672 states, 668 states have (on average 1.4835329341317365) internal successors, (991), 668 states have internal predecessors, (991), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:26:01,569 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 995 transitions.
[2025-03-08 09:26:01,569 INFO  L78                 Accepts]: Start accepts. Automaton has 672 states and 995 transitions. Word has length 227
[2025-03-08 09:26:01,569 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:01,569 INFO  L471      AbstractCegarLoop]: Abstraction has 672 states and 995 transitions.
[2025-03-08 09:26:01,569 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 55.0) internal successors, (220), 4 states have internal predecessors, (220), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:01,569 INFO  L276                IsEmpty]: Start isEmpty. Operand 672 states and 995 transitions.
[2025-03-08 09:26:01,571 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 229
[2025-03-08 09:26:01,571 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:01,571 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:01,571 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 09:26:01,571 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:01,572 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:01,572 INFO  L85        PathProgramCache]: Analyzing trace with hash 332342270, now seen corresponding path program 1 times
[2025-03-08 09:26:01,572 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:01,572 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999344742]
[2025-03-08 09:26:01,572 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:01,572 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:01,601 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes.
[2025-03-08 09:26:01,646 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements.
[2025-03-08 09:26:01,648 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:01,648 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:02,007 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:02,008 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:02,008 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999344742]
[2025-03-08 09:26:02,008 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999344742] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:02,008 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:02,008 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 09:26:02,009 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38434434]
[2025-03-08 09:26:02,009 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:02,009 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 09:26:02,009 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:02,010 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 09:26:02,010 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:26:02,010 INFO  L87              Difference]: Start difference. First operand 672 states and 995 transitions. Second operand  has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:02,294 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:02,294 INFO  L93              Difference]: Finished difference Result 1310 states and 1940 transitions.
[2025-03-08 09:26:02,294 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 09:26:02,295 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 228
[2025-03-08 09:26:02,295 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:02,297 INFO  L225             Difference]: With dead ends: 1310
[2025-03-08 09:26:02,297 INFO  L226             Difference]: Without dead ends: 672
[2025-03-08 09:26:02,298 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:26:02,301 INFO  L435           NwaCegarLoop]: 818 mSDtfsCounter, 948 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:02,301 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 1638 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 09:26:02,302 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 672 states.
[2025-03-08 09:26:02,311 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672.
[2025-03-08 09:26:02,312 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 672 states, 668 states have (on average 1.4820359281437125) internal successors, (990), 668 states have internal predecessors, (990), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:26:02,314 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 994 transitions.
[2025-03-08 09:26:02,314 INFO  L78                 Accepts]: Start accepts. Automaton has 672 states and 994 transitions. Word has length 228
[2025-03-08 09:26:02,314 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:02,315 INFO  L471      AbstractCegarLoop]: Abstraction has 672 states and 994 transitions.
[2025-03-08 09:26:02,315 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 55.25) internal successors, (221), 4 states have internal predecessors, (221), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:02,317 INFO  L276                IsEmpty]: Start isEmpty. Operand 672 states and 994 transitions.
[2025-03-08 09:26:02,318 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 230
[2025-03-08 09:26:02,318 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:02,319 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:02,319 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 09:26:02,319 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:02,319 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:02,319 INFO  L85        PathProgramCache]: Analyzing trace with hash -1797360523, now seen corresponding path program 1 times
[2025-03-08 09:26:02,319 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:02,319 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376198318]
[2025-03-08 09:26:02,319 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:02,320 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:02,354 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes.
[2025-03-08 09:26:02,524 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements.
[2025-03-08 09:26:02,525 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:02,525 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:02,727 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:02,727 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:02,727 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376198318]
[2025-03-08 09:26:02,728 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376198318] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:02,728 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:02,728 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 09:26:02,728 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028496661]
[2025-03-08 09:26:02,728 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:02,728 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 09:26:02,728 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:02,729 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 09:26:02,729 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:26:02,729 INFO  L87              Difference]: Start difference. First operand 672 states and 994 transitions. Second operand  has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:03,047 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:03,048 INFO  L93              Difference]: Finished difference Result 1310 states and 1938 transitions.
[2025-03-08 09:26:03,048 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 09:26:03,048 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 229
[2025-03-08 09:26:03,049 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:03,051 INFO  L225             Difference]: With dead ends: 1310
[2025-03-08 09:26:03,051 INFO  L226             Difference]: Without dead ends: 672
[2025-03-08 09:26:03,052 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:26:03,052 INFO  L435           NwaCegarLoop]: 818 mSDtfsCounter, 946 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 946 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:03,052 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [946 Valid, 1638 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 09:26:03,053 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 672 states.
[2025-03-08 09:26:03,097 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 672.
[2025-03-08 09:26:03,098 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 672 states, 668 states have (on average 1.4805389221556886) internal successors, (989), 668 states have internal predecessors, (989), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:26:03,100 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 993 transitions.
[2025-03-08 09:26:03,101 INFO  L78                 Accepts]: Start accepts. Automaton has 672 states and 993 transitions. Word has length 229
[2025-03-08 09:26:03,101 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:03,101 INFO  L471      AbstractCegarLoop]: Abstraction has 672 states and 993 transitions.
[2025-03-08 09:26:03,101 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 55.5) internal successors, (222), 4 states have internal predecessors, (222), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:03,101 INFO  L276                IsEmpty]: Start isEmpty. Operand 672 states and 993 transitions.
[2025-03-08 09:26:03,103 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 231
[2025-03-08 09:26:03,103 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:03,103 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:03,103 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 09:26:03,103 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:03,104 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:03,104 INFO  L85        PathProgramCache]: Analyzing trace with hash 2010975194, now seen corresponding path program 1 times
[2025-03-08 09:26:03,104 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:03,104 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739204341]
[2025-03-08 09:26:03,104 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:03,105 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:03,135 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes.
[2025-03-08 09:26:03,283 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements.
[2025-03-08 09:26:03,283 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:03,283 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:03,693 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:03,694 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:03,694 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739204341]
[2025-03-08 09:26:03,694 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739204341] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:03,694 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:03,694 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:26:03,694 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657038829]
[2025-03-08 09:26:03,694 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:03,695 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:26:03,695 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:03,695 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:26:03,695 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:26:03,695 INFO  L87              Difference]: Start difference. First operand 672 states and 993 transitions. Second operand  has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:04,194 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:04,194 INFO  L93              Difference]: Finished difference Result 1828 states and 2704 transitions.
[2025-03-08 09:26:04,195 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:26:04,195 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 230
[2025-03-08 09:26:04,195 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:04,199 INFO  L225             Difference]: With dead ends: 1828
[2025-03-08 09:26:04,199 INFO  L226             Difference]: Without dead ends: 1190
[2025-03-08 09:26:04,199 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:26:04,200 INFO  L435           NwaCegarLoop]: 816 mSDtfsCounter, 739 mSDsluCounter, 2431 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 739 SdHoareTripleChecker+Valid, 3247 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:04,200 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [739 Valid, 3247 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:26:04,201 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1190 states.
[2025-03-08 09:26:04,211 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 710.
[2025-03-08 09:26:04,212 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 710 states, 704 states have (on average 1.4744318181818181) internal successors, (1038), 704 states have internal predecessors, (1038), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2025-03-08 09:26:04,214 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1046 transitions.
[2025-03-08 09:26:04,214 INFO  L78                 Accepts]: Start accepts. Automaton has 710 states and 1046 transitions. Word has length 230
[2025-03-08 09:26:04,215 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:04,215 INFO  L471      AbstractCegarLoop]: Abstraction has 710 states and 1046 transitions.
[2025-03-08 09:26:04,215 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 44.6) internal successors, (223), 5 states have internal predecessors, (223), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:04,215 INFO  L276                IsEmpty]: Start isEmpty. Operand 710 states and 1046 transitions.
[2025-03-08 09:26:04,216 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 232
[2025-03-08 09:26:04,216 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:04,217 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:04,217 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 09:26:04,217 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:04,217 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:04,217 INFO  L85        PathProgramCache]: Analyzing trace with hash -298273740, now seen corresponding path program 1 times
[2025-03-08 09:26:04,217 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:04,217 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417125880]
[2025-03-08 09:26:04,218 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:04,218 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:04,248 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes.
[2025-03-08 09:26:04,284 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements.
[2025-03-08 09:26:04,285 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:04,285 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:04,482 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:04,483 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:04,483 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417125880]
[2025-03-08 09:26:04,483 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417125880] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:04,483 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:04,483 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 09:26:04,483 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582184872]
[2025-03-08 09:26:04,483 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:04,483 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 09:26:04,484 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:04,484 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 09:26:04,484 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:26:04,484 INFO  L87              Difference]: Start difference. First operand 710 states and 1046 transitions. Second operand  has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:04,735 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:04,735 INFO  L93              Difference]: Finished difference Result 1386 states and 2042 transitions.
[2025-03-08 09:26:04,736 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 09:26:04,736 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 231
[2025-03-08 09:26:04,736 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:04,739 INFO  L225             Difference]: With dead ends: 1386
[2025-03-08 09:26:04,739 INFO  L226             Difference]: Without dead ends: 710
[2025-03-08 09:26:04,741 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-03-08 09:26:04,741 INFO  L435           NwaCegarLoop]: 822 mSDtfsCounter, 941 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 1648 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:04,741 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 1648 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 09:26:04,742 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 710 states.
[2025-03-08 09:26:04,751 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710.
[2025-03-08 09:26:04,753 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 710 states, 704 states have (on average 1.4730113636363635) internal successors, (1037), 704 states have internal predecessors, (1037), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2025-03-08 09:26:04,755 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1045 transitions.
[2025-03-08 09:26:04,756 INFO  L78                 Accepts]: Start accepts. Automaton has 710 states and 1045 transitions. Word has length 231
[2025-03-08 09:26:04,757 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:04,757 INFO  L471      AbstractCegarLoop]: Abstraction has 710 states and 1045 transitions.
[2025-03-08 09:26:04,757 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:04,757 INFO  L276                IsEmpty]: Start isEmpty. Operand 710 states and 1045 transitions.
[2025-03-08 09:26:04,759 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 232
[2025-03-08 09:26:04,759 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:04,759 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:04,759 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 09:26:04,759 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:04,759 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:04,760 INFO  L85        PathProgramCache]: Analyzing trace with hash -1883931045, now seen corresponding path program 1 times
[2025-03-08 09:26:04,760 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:04,760 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66686216]
[2025-03-08 09:26:04,760 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:04,760 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:04,790 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes.
[2025-03-08 09:26:04,829 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements.
[2025-03-08 09:26:04,829 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:04,829 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:05,220 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:05,220 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:05,220 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66686216]
[2025-03-08 09:26:05,220 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66686216] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:05,220 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:05,220 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 09:26:05,221 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608134112]
[2025-03-08 09:26:05,221 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:05,221 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 09:26:05,221 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:05,221 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 09:26:05,221 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:26:05,222 INFO  L87              Difference]: Start difference. First operand 710 states and 1045 transitions. Second operand  has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:05,929 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:05,929 INFO  L93              Difference]: Finished difference Result 1904 states and 2807 transitions.
[2025-03-08 09:26:05,930 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 09:26:05,930 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 231
[2025-03-08 09:26:05,930 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:05,934 INFO  L225             Difference]: With dead ends: 1904
[2025-03-08 09:26:05,934 INFO  L226             Difference]: Without dead ends: 1228
[2025-03-08 09:26:05,935 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:26:05,936 INFO  L435           NwaCegarLoop]: 1449 mSDtfsCounter, 572 mSDsluCounter, 4512 mSDsCounter, 0 mSdLazyCounter, 1264 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 5961 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:05,936 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 5961 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1264 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 09:26:05,937 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1228 states.
[2025-03-08 09:26:05,954 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1084.
[2025-03-08 09:26:05,956 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1084 states, 1076 states have (on average 1.4767657992565055) internal successors, (1589), 1076 states have internal predecessors, (1589), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6)
[2025-03-08 09:26:05,959 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1601 transitions.
[2025-03-08 09:26:05,959 INFO  L78                 Accepts]: Start accepts. Automaton has 1084 states and 1601 transitions. Word has length 231
[2025-03-08 09:26:05,959 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:05,960 INFO  L471      AbstractCegarLoop]: Abstraction has 1084 states and 1601 transitions.
[2025-03-08 09:26:05,960 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 37.333333333333336) internal successors, (224), 6 states have internal predecessors, (224), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:05,960 INFO  L276                IsEmpty]: Start isEmpty. Operand 1084 states and 1601 transitions.
[2025-03-08 09:26:05,962 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 233
[2025-03-08 09:26:05,962 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:05,962 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:05,962 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 09:26:05,962 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:05,963 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:05,963 INFO  L85        PathProgramCache]: Analyzing trace with hash 1418315805, now seen corresponding path program 1 times
[2025-03-08 09:26:05,963 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:05,963 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502253428]
[2025-03-08 09:26:05,963 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:05,963 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:05,994 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes.
[2025-03-08 09:26:06,155 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements.
[2025-03-08 09:26:06,156 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:06,156 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:06,461 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:06,461 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:06,461 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502253428]
[2025-03-08 09:26:06,462 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502253428] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:06,462 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:06,462 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 09:26:06,462 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111556003]
[2025-03-08 09:26:06,462 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:06,462 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 09:26:06,462 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:06,462 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 09:26:06,463 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:26:06,463 INFO  L87              Difference]: Start difference. First operand 1084 states and 1601 transitions. Second operand  has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:07,015 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:07,015 INFO  L93              Difference]: Finished difference Result 2667 states and 3938 transitions.
[2025-03-08 09:26:07,015 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 09:26:07,016 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 232
[2025-03-08 09:26:07,016 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:07,021 INFO  L225             Difference]: With dead ends: 2667
[2025-03-08 09:26:07,021 INFO  L226             Difference]: Without dead ends: 1617
[2025-03-08 09:26:07,023 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2025-03-08 09:26:07,024 INFO  L435           NwaCegarLoop]: 1059 mSDtfsCounter, 351 mSDsluCounter, 3934 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 4993 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:07,024 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 4993 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 09:26:07,025 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1617 states.
[2025-03-08 09:26:07,048 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1617 to 1443.
[2025-03-08 09:26:07,050 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1443 states, 1429 states have (on average 1.470258922323303) internal successors, (2101), 1429 states have internal predecessors, (2101), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12)
[2025-03-08 09:26:07,055 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1443 states to 1443 states and 2125 transitions.
[2025-03-08 09:26:07,056 INFO  L78                 Accepts]: Start accepts. Automaton has 1443 states and 2125 transitions. Word has length 232
[2025-03-08 09:26:07,056 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:07,056 INFO  L471      AbstractCegarLoop]: Abstraction has 1443 states and 2125 transitions.
[2025-03-08 09:26:07,056 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 37.5) internal successors, (225), 6 states have internal predecessors, (225), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:07,056 INFO  L276                IsEmpty]: Start isEmpty. Operand 1443 states and 2125 transitions.
[2025-03-08 09:26:07,059 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 234
[2025-03-08 09:26:07,059 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:07,060 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:07,060 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-08 09:26:07,060 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:07,060 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:07,060 INFO  L85        PathProgramCache]: Analyzing trace with hash -1093841506, now seen corresponding path program 1 times
[2025-03-08 09:26:07,060 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:07,060 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733485023]
[2025-03-08 09:26:07,061 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:07,061 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:07,091 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes.
[2025-03-08 09:26:07,172 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements.
[2025-03-08 09:26:07,173 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:07,173 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:07,494 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:07,496 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:07,496 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733485023]
[2025-03-08 09:26:07,497 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733485023] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:07,497 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:07,497 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 09:26:07,497 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721342723]
[2025-03-08 09:26:07,497 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:07,497 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 09:26:07,497 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:07,498 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 09:26:07,498 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:26:07,498 INFO  L87              Difference]: Start difference. First operand 1443 states and 2125 transitions. Second operand  has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:07,966 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:07,966 INFO  L93              Difference]: Finished difference Result 2920 states and 4304 transitions.
[2025-03-08 09:26:07,966 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 09:26:07,966 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 233
[2025-03-08 09:26:07,967 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:07,972 INFO  L225             Difference]: With dead ends: 2920
[2025-03-08 09:26:07,973 INFO  L226             Difference]: Without dead ends: 1870
[2025-03-08 09:26:07,974 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:26:07,974 INFO  L435           NwaCegarLoop]: 897 mSDtfsCounter, 194 mSDsluCounter, 3500 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 4397 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:07,975 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 4397 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:26:07,976 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1870 states.
[2025-03-08 09:26:08,001 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1866.
[2025-03-08 09:26:08,003 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1866 states, 1846 states have (on average 1.4674972914409534) internal successors, (2709), 1846 states have internal predecessors, (2709), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2025-03-08 09:26:08,009 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1866 states to 1866 states and 2745 transitions.
[2025-03-08 09:26:08,009 INFO  L78                 Accepts]: Start accepts. Automaton has 1866 states and 2745 transitions. Word has length 233
[2025-03-08 09:26:08,009 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:08,009 INFO  L471      AbstractCegarLoop]: Abstraction has 1866 states and 2745 transitions.
[2025-03-08 09:26:08,010 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:08,010 INFO  L276                IsEmpty]: Start isEmpty. Operand 1866 states and 2745 transitions.
[2025-03-08 09:26:08,014 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 234
[2025-03-08 09:26:08,014 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:08,014 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:08,014 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-08 09:26:08,014 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:08,015 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:08,015 INFO  L85        PathProgramCache]: Analyzing trace with hash -1264073046, now seen corresponding path program 1 times
[2025-03-08 09:26:08,016 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:08,016 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020014370]
[2025-03-08 09:26:08,016 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:08,016 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:08,047 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes.
[2025-03-08 09:26:08,185 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements.
[2025-03-08 09:26:08,186 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:08,186 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:08,487 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:08,488 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:08,488 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020014370]
[2025-03-08 09:26:08,488 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020014370] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:08,488 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:08,488 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 09:26:08,488 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477545901]
[2025-03-08 09:26:08,488 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:08,488 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 09:26:08,488 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:08,489 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 09:26:08,489 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:26:08,489 INFO  L87              Difference]: Start difference. First operand 1866 states and 2745 transitions. Second operand  has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:08,985 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:08,986 INFO  L93              Difference]: Finished difference Result 3090 states and 4556 transitions.
[2025-03-08 09:26:08,986 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 09:26:08,987 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 233
[2025-03-08 09:26:08,987 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:08,994 INFO  L225             Difference]: With dead ends: 3090
[2025-03-08 09:26:08,994 INFO  L226             Difference]: Without dead ends: 2040
[2025-03-08 09:26:08,996 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2025-03-08 09:26:08,996 INFO  L435           NwaCegarLoop]: 917 mSDtfsCounter, 340 mSDsluCounter, 3523 mSDsCounter, 0 mSdLazyCounter, 960 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 4440 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 960 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:08,997 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [340 Valid, 4440 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 960 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:26:08,999 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2040 states.
[2025-03-08 09:26:09,029 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 1898.
[2025-03-08 09:26:09,031 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1898 states, 1878 states have (on average 1.466986155484558) internal successors, (2755), 1878 states have internal predecessors, (2755), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2025-03-08 09:26:09,038 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 2791 transitions.
[2025-03-08 09:26:09,038 INFO  L78                 Accepts]: Start accepts. Automaton has 1898 states and 2791 transitions. Word has length 233
[2025-03-08 09:26:09,039 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:09,039 INFO  L471      AbstractCegarLoop]: Abstraction has 1898 states and 2791 transitions.
[2025-03-08 09:26:09,039 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 37.666666666666664) internal successors, (226), 6 states have internal predecessors, (226), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:09,039 INFO  L276                IsEmpty]: Start isEmpty. Operand 1898 states and 2791 transitions.
[2025-03-08 09:26:09,043 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 235
[2025-03-08 09:26:09,043 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:09,044 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:09,044 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-08 09:26:09,044 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:09,044 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:09,044 INFO  L85        PathProgramCache]: Analyzing trace with hash 2092984097, now seen corresponding path program 1 times
[2025-03-08 09:26:09,044 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:09,044 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605049226]
[2025-03-08 09:26:09,045 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:09,045 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:09,075 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes.
[2025-03-08 09:26:09,175 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements.
[2025-03-08 09:26:09,175 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:09,175 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:09,550 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:09,551 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:09,551 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605049226]
[2025-03-08 09:26:09,551 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605049226] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:09,551 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:09,551 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 09:26:09,551 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45775639]
[2025-03-08 09:26:09,551 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:09,551 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 09:26:09,551 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:09,552 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 09:26:09,552 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:26:09,552 INFO  L87              Difference]: Start difference. First operand 1898 states and 2791 transitions. Second operand  has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:09,950 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:09,950 INFO  L93              Difference]: Finished difference Result 2956 states and 4354 transitions.
[2025-03-08 09:26:09,950 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 09:26:09,950 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 234
[2025-03-08 09:26:09,951 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:09,956 INFO  L225             Difference]: With dead ends: 2956
[2025-03-08 09:26:09,956 INFO  L226             Difference]: Without dead ends: 1906
[2025-03-08 09:26:09,957 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-03-08 09:26:09,958 INFO  L435           NwaCegarLoop]: 818 mSDtfsCounter, 870 mSDsluCounter, 2438 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 3256 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:09,958 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 3256 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:26:09,959 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1906 states.
[2025-03-08 09:26:09,984 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1906 to 1902.
[2025-03-08 09:26:09,986 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1902 states, 1882 states have (on average 1.4659936238044633) internal successors, (2759), 1882 states have internal predecessors, (2759), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2025-03-08 09:26:09,991 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 2795 transitions.
[2025-03-08 09:26:09,991 INFO  L78                 Accepts]: Start accepts. Automaton has 1902 states and 2795 transitions. Word has length 234
[2025-03-08 09:26:09,992 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:09,992 INFO  L471      AbstractCegarLoop]: Abstraction has 1902 states and 2795 transitions.
[2025-03-08 09:26:09,992 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:09,993 INFO  L276                IsEmpty]: Start isEmpty. Operand 1902 states and 2795 transitions.
[2025-03-08 09:26:09,996 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 235
[2025-03-08 09:26:09,996 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:09,996 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:09,996 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-08 09:26:09,996 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:09,997 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:09,997 INFO  L85        PathProgramCache]: Analyzing trace with hash 1156021794, now seen corresponding path program 1 times
[2025-03-08 09:26:09,997 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:09,998 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315755293]
[2025-03-08 09:26:09,998 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:09,998 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:10,028 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes.
[2025-03-08 09:26:10,131 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements.
[2025-03-08 09:26:10,131 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:10,132 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:10,398 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:10,398 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:10,398 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315755293]
[2025-03-08 09:26:10,398 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315755293] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:10,398 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:10,398 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 09:26:10,400 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749773919]
[2025-03-08 09:26:10,400 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:10,400 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 09:26:10,400 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:10,401 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 09:26:10,401 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:26:10,401 INFO  L87              Difference]: Start difference. First operand 1902 states and 2795 transitions. Second operand  has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:10,950 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:10,950 INFO  L93              Difference]: Finished difference Result 3866 states and 5699 transitions.
[2025-03-08 09:26:10,950 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 09:26:10,950 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 234
[2025-03-08 09:26:10,951 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:10,958 INFO  L225             Difference]: With dead ends: 3866
[2025-03-08 09:26:10,959 INFO  L226             Difference]: Without dead ends: 2648
[2025-03-08 09:26:10,961 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2025-03-08 09:26:10,961 INFO  L435           NwaCegarLoop]: 808 mSDtfsCounter, 852 mSDsluCounter, 3234 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 4042 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:10,961 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 4042 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 09:26:10,963 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2648 states.
[2025-03-08 09:26:10,997 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 2046.
[2025-03-08 09:26:11,001 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2046 states, 2026 states have (on average 1.4654491609081934) internal successors, (2969), 2026 states have internal predecessors, (2969), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2025-03-08 09:26:11,007 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 3005 transitions.
[2025-03-08 09:26:11,008 INFO  L78                 Accepts]: Start accepts. Automaton has 2046 states and 3005 transitions. Word has length 234
[2025-03-08 09:26:11,008 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:11,008 INFO  L471      AbstractCegarLoop]: Abstraction has 2046 states and 3005 transitions.
[2025-03-08 09:26:11,009 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:11,009 INFO  L276                IsEmpty]: Start isEmpty. Operand 2046 states and 3005 transitions.
[2025-03-08 09:26:11,013 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 235
[2025-03-08 09:26:11,014 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:11,014 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:11,014 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-08 09:26:11,014 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:11,014 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:11,014 INFO  L85        PathProgramCache]: Analyzing trace with hash -240154060, now seen corresponding path program 1 times
[2025-03-08 09:26:11,014 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:11,014 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18721894]
[2025-03-08 09:26:11,014 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:11,014 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:11,046 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes.
[2025-03-08 09:26:11,095 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements.
[2025-03-08 09:26:11,095 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:11,095 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:11,355 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:11,355 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:11,356 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18721894]
[2025-03-08 09:26:11,356 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18721894] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:11,356 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:11,356 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 09:26:11,357 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544750807]
[2025-03-08 09:26:11,357 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:11,357 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 09:26:11,357 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:11,358 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 09:26:11,358 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:26:11,358 INFO  L87              Difference]: Start difference. First operand 2046 states and 3005 transitions. Second operand  has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:12,024 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:12,024 INFO  L93              Difference]: Finished difference Result 3472 states and 5107 transitions.
[2025-03-08 09:26:12,025 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 09:26:12,025 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 234
[2025-03-08 09:26:12,026 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:12,032 INFO  L225             Difference]: With dead ends: 3472
[2025-03-08 09:26:12,032 INFO  L226             Difference]: Without dead ends: 2190
[2025-03-08 09:26:12,033 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:26:12,034 INFO  L435           NwaCegarLoop]: 1449 mSDtfsCounter, 718 mSDsluCounter, 4514 mSDsCounter, 0 mSdLazyCounter, 1257 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 5963 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:12,034 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 5963 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1257 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 09:26:12,035 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2190 states.
[2025-03-08 09:26:12,065 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 2046.
[2025-03-08 09:26:12,068 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2046 states, 2026 states have (on average 1.4639684106614017) internal successors, (2966), 2026 states have internal predecessors, (2966), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18)
[2025-03-08 09:26:12,071 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 3002 transitions.
[2025-03-08 09:26:12,072 INFO  L78                 Accepts]: Start accepts. Automaton has 2046 states and 3002 transitions. Word has length 234
[2025-03-08 09:26:12,072 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:12,072 INFO  L471      AbstractCegarLoop]: Abstraction has 2046 states and 3002 transitions.
[2025-03-08 09:26:12,072 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:12,072 INFO  L276                IsEmpty]: Start isEmpty. Operand 2046 states and 3002 transitions.
[2025-03-08 09:26:12,075 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 235
[2025-03-08 09:26:12,075 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:12,075 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:12,076 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-08 09:26:12,076 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:12,076 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:12,076 INFO  L85        PathProgramCache]: Analyzing trace with hash -1479325419, now seen corresponding path program 1 times
[2025-03-08 09:26:12,076 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:12,076 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316648925]
[2025-03-08 09:26:12,076 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:12,076 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:12,107 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes.
[2025-03-08 09:26:12,199 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements.
[2025-03-08 09:26:12,200 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:12,200 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:12,627 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:12,628 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:12,628 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316648925]
[2025-03-08 09:26:12,628 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316648925] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:12,628 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:12,628 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 09:26:12,629 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505802936]
[2025-03-08 09:26:12,629 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:12,629 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 09:26:12,629 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:12,629 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 09:26:12,630 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:26:12,630 INFO  L87              Difference]: Start difference. First operand 2046 states and 3002 transitions. Second operand  has 7 states, 7 states have (on average 32.42857142857143) internal successors, (227), 7 states have internal predecessors, (227), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:13,295 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:13,295 INFO  L93              Difference]: Finished difference Result 3768 states and 5536 transitions.
[2025-03-08 09:26:13,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 09:26:13,296 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 32.42857142857143) internal successors, (227), 7 states have internal predecessors, (227), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 234
[2025-03-08 09:26:13,296 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:13,304 INFO  L225             Difference]: With dead ends: 3768
[2025-03-08 09:26:13,305 INFO  L226             Difference]: Without dead ends: 2606
[2025-03-08 09:26:13,308 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2025-03-08 09:26:13,309 INFO  L435           NwaCegarLoop]: 758 mSDtfsCounter, 1578 mSDsluCounter, 2981 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1580 SdHoareTripleChecker+Valid, 3739 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:13,310 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1580 Valid, 3739 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 09:26:13,312 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2606 states.
[2025-03-08 09:26:13,346 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2606 to 2428.
[2025-03-08 09:26:13,349 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2428 states, 2402 states have (on average 1.4604496253122399) internal successors, (3508), 2402 states have internal predecessors, (3508), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:13,358 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 3556 transitions.
[2025-03-08 09:26:13,358 INFO  L78                 Accepts]: Start accepts. Automaton has 2428 states and 3556 transitions. Word has length 234
[2025-03-08 09:26:13,359 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:13,359 INFO  L471      AbstractCegarLoop]: Abstraction has 2428 states and 3556 transitions.
[2025-03-08 09:26:13,359 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 32.42857142857143) internal successors, (227), 7 states have internal predecessors, (227), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:13,359 INFO  L276                IsEmpty]: Start isEmpty. Operand 2428 states and 3556 transitions.
[2025-03-08 09:26:13,362 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 235
[2025-03-08 09:26:13,362 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:13,363 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:13,363 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-08 09:26:13,363 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:13,363 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:13,363 INFO  L85        PathProgramCache]: Analyzing trace with hash -1842915108, now seen corresponding path program 1 times
[2025-03-08 09:26:13,363 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:13,364 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852955633]
[2025-03-08 09:26:13,364 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:13,364 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:13,404 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes.
[2025-03-08 09:26:13,523 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements.
[2025-03-08 09:26:13,523 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:13,523 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:13,937 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:13,937 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:13,937 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852955633]
[2025-03-08 09:26:13,937 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852955633] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:13,938 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:13,938 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 09:26:13,938 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111948117]
[2025-03-08 09:26:13,938 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:13,938 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 09:26:13,938 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:13,939 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 09:26:13,939 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:26:13,939 INFO  L87              Difference]: Start difference. First operand 2428 states and 3556 transitions. Second operand  has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:14,395 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:14,395 INFO  L93              Difference]: Finished difference Result 4262 states and 6265 transitions.
[2025-03-08 09:26:14,395 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 09:26:14,396 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 234
[2025-03-08 09:26:14,396 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:14,405 INFO  L225             Difference]: With dead ends: 4262
[2025-03-08 09:26:14,406 INFO  L226             Difference]: Without dead ends: 2428
[2025-03-08 09:26:14,408 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:26:14,409 INFO  L435           NwaCegarLoop]: 761 mSDtfsCounter, 1672 mSDsluCounter, 1666 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1672 SdHoareTripleChecker+Valid, 2427 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:14,409 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1672 Valid, 2427 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:26:14,412 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2428 states.
[2025-03-08 09:26:14,443 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 2428.
[2025-03-08 09:26:14,450 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2428 states, 2402 states have (on average 1.4571190674437968) internal successors, (3500), 2402 states have internal predecessors, (3500), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:14,454 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 3548 transitions.
[2025-03-08 09:26:14,455 INFO  L78                 Accepts]: Start accepts. Automaton has 2428 states and 3548 transitions. Word has length 234
[2025-03-08 09:26:14,455 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:14,455 INFO  L471      AbstractCegarLoop]: Abstraction has 2428 states and 3548 transitions.
[2025-03-08 09:26:14,456 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:14,456 INFO  L276                IsEmpty]: Start isEmpty. Operand 2428 states and 3548 transitions.
[2025-03-08 09:26:14,459 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 236
[2025-03-08 09:26:14,459 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:14,459 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:14,460 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-08 09:26:14,460 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:14,460 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:14,460 INFO  L85        PathProgramCache]: Analyzing trace with hash -324300639, now seen corresponding path program 1 times
[2025-03-08 09:26:14,460 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:14,460 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115590038]
[2025-03-08 09:26:14,460 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:14,460 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:14,502 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes.
[2025-03-08 09:26:14,582 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements.
[2025-03-08 09:26:14,582 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:14,582 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:15,189 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:15,190 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:15,190 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115590038]
[2025-03-08 09:26:15,190 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115590038] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:15,190 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:15,190 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 09:26:15,190 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596113080]
[2025-03-08 09:26:15,190 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:15,190 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 09:26:15,190 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:15,191 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 09:26:15,191 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2025-03-08 09:26:15,191 INFO  L87              Difference]: Start difference. First operand 2428 states and 3548 transitions. Second operand  has 10 states, 10 states have (on average 22.8) internal successors, (228), 10 states have internal predecessors, (228), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:16,029 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:16,030 INFO  L93              Difference]: Finished difference Result 4418 states and 6485 transitions.
[2025-03-08 09:26:16,030 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 09:26:16,030 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 22.8) internal successors, (228), 10 states have internal predecessors, (228), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 235
[2025-03-08 09:26:16,031 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:16,043 INFO  L225             Difference]: With dead ends: 4418
[2025-03-08 09:26:16,045 INFO  L226             Difference]: Without dead ends: 3106
[2025-03-08 09:26:16,047 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210
[2025-03-08 09:26:16,048 INFO  L435           NwaCegarLoop]: 798 mSDtfsCounter, 1824 mSDsluCounter, 4861 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1826 SdHoareTripleChecker+Valid, 5659 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:16,048 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1826 Valid, 5659 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 09:26:16,050 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3106 states.
[2025-03-08 09:26:16,082 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 2440.
[2025-03-08 09:26:16,085 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2440 states, 2414 states have (on average 1.456503728251864) internal successors, (3516), 2414 states have internal predecessors, (3516), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:16,088 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 3564 transitions.
[2025-03-08 09:26:16,088 INFO  L78                 Accepts]: Start accepts. Automaton has 2440 states and 3564 transitions. Word has length 235
[2025-03-08 09:26:16,088 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:16,088 INFO  L471      AbstractCegarLoop]: Abstraction has 2440 states and 3564 transitions.
[2025-03-08 09:26:16,089 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 22.8) internal successors, (228), 10 states have internal predecessors, (228), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:16,089 INFO  L276                IsEmpty]: Start isEmpty. Operand 2440 states and 3564 transitions.
[2025-03-08 09:26:16,092 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 237
[2025-03-08 09:26:16,092 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:16,092 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:16,092 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-08 09:26:16,093 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:16,093 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:16,093 INFO  L85        PathProgramCache]: Analyzing trace with hash 617532100, now seen corresponding path program 1 times
[2025-03-08 09:26:16,094 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:16,094 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567265779]
[2025-03-08 09:26:16,094 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:16,094 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:16,122 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes.
[2025-03-08 09:26:16,207 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements.
[2025-03-08 09:26:16,207 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:16,207 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:16,656 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:16,656 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:16,657 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567265779]
[2025-03-08 09:26:16,657 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567265779] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:16,657 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:16,657 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 09:26:16,657 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483282087]
[2025-03-08 09:26:16,657 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:16,657 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 09:26:16,657 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:16,658 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 09:26:16,658 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:26:16,658 INFO  L87              Difference]: Start difference. First operand 2440 states and 3564 transitions. Second operand  has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:17,256 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:17,256 INFO  L93              Difference]: Finished difference Result 4401 states and 6455 transitions.
[2025-03-08 09:26:17,257 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 09:26:17,257 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 236
[2025-03-08 09:26:17,258 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:17,266 INFO  L225             Difference]: With dead ends: 4401
[2025-03-08 09:26:17,266 INFO  L226             Difference]: Without dead ends: 3098
[2025-03-08 09:26:17,268 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2025-03-08 09:26:17,269 INFO  L435           NwaCegarLoop]: 807 mSDtfsCounter, 844 mSDsluCounter, 4036 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 4843 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:17,269 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 4843 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 09:26:17,271 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3098 states.
[2025-03-08 09:26:17,296 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3098 to 2468.
[2025-03-08 09:26:17,298 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2468 states, 2442 states have (on average 1.4545454545454546) internal successors, (3552), 2442 states have internal predecessors, (3552), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:17,302 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2468 states to 2468 states and 3600 transitions.
[2025-03-08 09:26:17,303 INFO  L78                 Accepts]: Start accepts. Automaton has 2468 states and 3600 transitions. Word has length 236
[2025-03-08 09:26:17,303 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:17,303 INFO  L471      AbstractCegarLoop]: Abstraction has 2468 states and 3600 transitions.
[2025-03-08 09:26:17,303 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 32.714285714285715) internal successors, (229), 7 states have internal predecessors, (229), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:17,303 INFO  L276                IsEmpty]: Start isEmpty. Operand 2468 states and 3600 transitions.
[2025-03-08 09:26:17,307 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 237
[2025-03-08 09:26:17,307 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:17,307 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:17,307 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-08 09:26:17,307 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:17,308 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:17,308 INFO  L85        PathProgramCache]: Analyzing trace with hash 1610119903, now seen corresponding path program 1 times
[2025-03-08 09:26:17,308 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:17,308 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257711920]
[2025-03-08 09:26:17,308 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:17,308 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:17,335 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes.
[2025-03-08 09:26:17,439 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements.
[2025-03-08 09:26:17,440 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:17,440 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:17,674 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:17,674 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:17,674 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257711920]
[2025-03-08 09:26:17,674 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257711920] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:17,674 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:17,675 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 09:26:17,675 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235469225]
[2025-03-08 09:26:17,675 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:17,675 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 09:26:17,675 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:17,675 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 09:26:17,675 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:26:17,676 INFO  L87              Difference]: Start difference. First operand 2468 states and 3600 transitions. Second operand  has 6 states, 6 states have (on average 38.166666666666664) internal successors, (229), 6 states have internal predecessors, (229), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:18,193 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:18,193 INFO  L93              Difference]: Finished difference Result 3726 states and 5451 transitions.
[2025-03-08 09:26:18,194 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 09:26:18,194 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 38.166666666666664) internal successors, (229), 6 states have internal predecessors, (229), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 236
[2025-03-08 09:26:18,195 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:18,202 INFO  L225             Difference]: With dead ends: 3726
[2025-03-08 09:26:18,202 INFO  L226             Difference]: Without dead ends: 2614
[2025-03-08 09:26:18,204 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2025-03-08 09:26:18,204 INFO  L435           NwaCegarLoop]: 1053 mSDtfsCounter, 330 mSDsluCounter, 3917 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 4970 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:18,204 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 4970 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 09:26:18,206 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2614 states.
[2025-03-08 09:26:18,229 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2614 to 2484.
[2025-03-08 09:26:18,231 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2484 states, 2458 states have (on average 1.454027664768104) internal successors, (3574), 2458 states have internal predecessors, (3574), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:18,234 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2484 states to 2484 states and 3622 transitions.
[2025-03-08 09:26:18,235 INFO  L78                 Accepts]: Start accepts. Automaton has 2484 states and 3622 transitions. Word has length 236
[2025-03-08 09:26:18,235 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:18,235 INFO  L471      AbstractCegarLoop]: Abstraction has 2484 states and 3622 transitions.
[2025-03-08 09:26:18,235 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 38.166666666666664) internal successors, (229), 6 states have internal predecessors, (229), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:18,236 INFO  L276                IsEmpty]: Start isEmpty. Operand 2484 states and 3622 transitions.
[2025-03-08 09:26:18,239 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 238
[2025-03-08 09:26:18,239 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:18,239 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:18,239 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-08 09:26:18,240 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:18,241 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:18,241 INFO  L85        PathProgramCache]: Analyzing trace with hash 348601231, now seen corresponding path program 1 times
[2025-03-08 09:26:18,241 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:18,241 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480965982]
[2025-03-08 09:26:18,241 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:18,242 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:18,267 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes.
[2025-03-08 09:26:18,380 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements.
[2025-03-08 09:26:18,380 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:18,380 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:18,791 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:18,795 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:18,796 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480965982]
[2025-03-08 09:26:18,796 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480965982] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:18,796 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:18,796 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 09:26:18,796 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325355279]
[2025-03-08 09:26:18,796 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:18,796 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 09:26:18,796 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:18,797 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 09:26:18,797 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:26:18,797 INFO  L87              Difference]: Start difference. First operand 2484 states and 3622 transitions. Second operand  has 7 states, 7 states have (on average 32.857142857142854) internal successors, (230), 7 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:19,503 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:19,504 INFO  L93              Difference]: Finished difference Result 3802 states and 5561 transitions.
[2025-03-08 09:26:19,504 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 09:26:19,504 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 32.857142857142854) internal successors, (230), 7 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 237
[2025-03-08 09:26:19,504 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:19,509 INFO  L225             Difference]: With dead ends: 3802
[2025-03-08 09:26:19,509 INFO  L226             Difference]: Without dead ends: 2662
[2025-03-08 09:26:19,511 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2025-03-08 09:26:19,512 INFO  L435           NwaCegarLoop]: 757 mSDtfsCounter, 1550 mSDsluCounter, 2977 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 3734 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:19,512 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1552 Valid, 3734 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 09:26:19,514 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2662 states.
[2025-03-08 09:26:19,538 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2662 to 2516.
[2025-03-08 09:26:19,540 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2516 states, 2490 states have (on average 1.453012048192771) internal successors, (3618), 2490 states have internal predecessors, (3618), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:19,542 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2516 states to 2516 states and 3666 transitions.
[2025-03-08 09:26:19,543 INFO  L78                 Accepts]: Start accepts. Automaton has 2516 states and 3666 transitions. Word has length 237
[2025-03-08 09:26:19,544 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:19,544 INFO  L471      AbstractCegarLoop]: Abstraction has 2516 states and 3666 transitions.
[2025-03-08 09:26:19,544 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 32.857142857142854) internal successors, (230), 7 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:19,544 INFO  L276                IsEmpty]: Start isEmpty. Operand 2516 states and 3666 transitions.
[2025-03-08 09:26:19,547 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 238
[2025-03-08 09:26:19,547 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:19,547 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:19,548 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-03-08 09:26:19,548 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:19,548 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:19,548 INFO  L85        PathProgramCache]: Analyzing trace with hash -734813174, now seen corresponding path program 1 times
[2025-03-08 09:26:19,548 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:19,548 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271083476]
[2025-03-08 09:26:19,548 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:19,548 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:19,576 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes.
[2025-03-08 09:26:19,679 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements.
[2025-03-08 09:26:19,679 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:19,679 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:19,959 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:19,959 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:19,959 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271083476]
[2025-03-08 09:26:19,959 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271083476] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:19,959 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:19,959 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 09:26:19,959 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782060017]
[2025-03-08 09:26:19,959 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:19,960 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 09:26:19,960 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:19,960 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 09:26:19,960 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:26:19,960 INFO  L87              Difference]: Start difference. First operand 2516 states and 3666 transitions. Second operand  has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:20,374 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:20,376 INFO  L93              Difference]: Finished difference Result 3758 states and 5493 transitions.
[2025-03-08 09:26:20,376 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 09:26:20,376 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 237
[2025-03-08 09:26:20,377 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:20,380 INFO  L225             Difference]: With dead ends: 3758
[2025-03-08 09:26:20,381 INFO  L226             Difference]: Without dead ends: 2646
[2025-03-08 09:26:20,382 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-03-08 09:26:20,383 INFO  L435           NwaCegarLoop]: 1070 mSDtfsCounter, 320 mSDsluCounter, 3971 mSDsCounter, 0 mSdLazyCounter, 1082 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 5041 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:20,384 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 5041 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1082 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:26:20,385 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2646 states.
[2025-03-08 09:26:20,407 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2646 to 2552.
[2025-03-08 09:26:20,409 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2552 states, 2526 states have (on average 1.4520981789390341) internal successors, (3668), 2526 states have internal predecessors, (3668), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:20,411 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3716 transitions.
[2025-03-08 09:26:20,412 INFO  L78                 Accepts]: Start accepts. Automaton has 2552 states and 3716 transitions. Word has length 237
[2025-03-08 09:26:20,412 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:20,412 INFO  L471      AbstractCegarLoop]: Abstraction has 2552 states and 3716 transitions.
[2025-03-08 09:26:20,412 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:20,412 INFO  L276                IsEmpty]: Start isEmpty. Operand 2552 states and 3716 transitions.
[2025-03-08 09:26:20,415 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 239
[2025-03-08 09:26:20,415 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:20,415 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:20,415 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-03-08 09:26:20,415 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:20,416 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:20,416 INFO  L85        PathProgramCache]: Analyzing trace with hash -556685724, now seen corresponding path program 1 times
[2025-03-08 09:26:20,416 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:20,416 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465835383]
[2025-03-08 09:26:20,416 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:20,416 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:20,452 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes.
[2025-03-08 09:26:20,524 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements.
[2025-03-08 09:26:20,524 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:20,524 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:21,105 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:21,105 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:21,105 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465835383]
[2025-03-08 09:26:21,106 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465835383] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:21,106 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:21,106 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 09:26:21,106 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348837736]
[2025-03-08 09:26:21,106 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:21,106 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 09:26:21,106 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:21,107 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 09:26:21,107 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2025-03-08 09:26:21,107 INFO  L87              Difference]: Start difference. First operand 2552 states and 3716 transitions. Second operand  has 10 states, 10 states have (on average 23.1) internal successors, (231), 10 states have internal predecessors, (231), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:26:21,715 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:21,715 INFO  L93              Difference]: Finished difference Result 4192 states and 6123 transitions.
[2025-03-08 09:26:21,716 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 09:26:21,716 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 23.1) internal successors, (231), 10 states have internal predecessors, (231), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 238
[2025-03-08 09:26:21,716 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:21,720 INFO  L225             Difference]: With dead ends: 4192
[2025-03-08 09:26:21,720 INFO  L226             Difference]: Without dead ends: 2552
[2025-03-08 09:26:21,722 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210
[2025-03-08 09:26:21,722 INFO  L435           NwaCegarLoop]: 770 mSDtfsCounter, 1786 mSDsluCounter, 3379 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1786 SdHoareTripleChecker+Valid, 4149 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:21,723 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1786 Valid, 4149 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 09:26:21,724 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2552 states.
[2025-03-08 09:26:21,754 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2552.
[2025-03-08 09:26:21,757 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2552 states, 2526 states have (on average 1.4489311163895486) internal successors, (3660), 2526 states have internal predecessors, (3660), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:21,761 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2552 states to 2552 states and 3708 transitions.
[2025-03-08 09:26:21,762 INFO  L78                 Accepts]: Start accepts. Automaton has 2552 states and 3708 transitions. Word has length 238
[2025-03-08 09:26:21,762 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:21,762 INFO  L471      AbstractCegarLoop]: Abstraction has 2552 states and 3708 transitions.
[2025-03-08 09:26:21,762 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 23.1) internal successors, (231), 10 states have internal predecessors, (231), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:26:21,762 INFO  L276                IsEmpty]: Start isEmpty. Operand 2552 states and 3708 transitions.
[2025-03-08 09:26:21,766 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 240
[2025-03-08 09:26:21,766 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:21,766 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:21,766 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-03-08 09:26:21,767 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:21,767 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:21,767 INFO  L85        PathProgramCache]: Analyzing trace with hash -607145481, now seen corresponding path program 1 times
[2025-03-08 09:26:21,767 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:21,767 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832980169]
[2025-03-08 09:26:21,767 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:21,768 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:21,797 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes.
[2025-03-08 09:26:21,829 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements.
[2025-03-08 09:26:21,830 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:21,830 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:22,061 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:22,061 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:22,061 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832980169]
[2025-03-08 09:26:22,061 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832980169] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:22,061 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:22,061 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:26:22,062 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909133884]
[2025-03-08 09:26:22,062 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:22,062 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:26:22,062 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:22,062 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:26:22,063 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:26:22,063 INFO  L87              Difference]: Start difference. First operand 2552 states and 3708 transitions. Second operand  has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:22,334 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:22,334 INFO  L93              Difference]: Finished difference Result 4184 states and 6097 transitions.
[2025-03-08 09:26:22,334 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:26:22,334 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 239
[2025-03-08 09:26:22,335 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:22,339 INFO  L225             Difference]: With dead ends: 4184
[2025-03-08 09:26:22,339 INFO  L226             Difference]: Without dead ends: 2592
[2025-03-08 09:26:22,341 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:26:22,341 INFO  L435           NwaCegarLoop]: 821 mSDtfsCounter, 2 mSDsluCounter, 2452 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3273 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:22,342 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3273 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 09:26:22,343 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2592 states.
[2025-03-08 09:26:22,362 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 2584.
[2025-03-08 09:26:22,364 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2584 states, 2558 states have (on average 1.4464425332290851) internal successors, (3700), 2558 states have internal predecessors, (3700), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:22,367 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2584 states to 2584 states and 3748 transitions.
[2025-03-08 09:26:22,368 INFO  L78                 Accepts]: Start accepts. Automaton has 2584 states and 3748 transitions. Word has length 239
[2025-03-08 09:26:22,369 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:22,369 INFO  L471      AbstractCegarLoop]: Abstraction has 2584 states and 3748 transitions.
[2025-03-08 09:26:22,369 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:22,369 INFO  L276                IsEmpty]: Start isEmpty. Operand 2584 states and 3748 transitions.
[2025-03-08 09:26:22,372 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 240
[2025-03-08 09:26:22,372 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:22,372 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:22,373 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-03-08 09:26:22,373 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:22,373 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:22,373 INFO  L85        PathProgramCache]: Analyzing trace with hash 1656134503, now seen corresponding path program 1 times
[2025-03-08 09:26:22,373 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:22,373 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347959299]
[2025-03-08 09:26:22,373 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:22,373 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:22,401 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes.
[2025-03-08 09:26:22,473 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements.
[2025-03-08 09:26:22,473 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:22,473 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:22,642 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:22,642 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:22,642 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347959299]
[2025-03-08 09:26:22,642 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347959299] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:22,642 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:22,643 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 09:26:22,643 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711768019]
[2025-03-08 09:26:22,643 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:22,643 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 09:26:22,644 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:22,644 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 09:26:22,644 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:26:22,644 INFO  L87              Difference]: Start difference. First operand 2584 states and 3748 transitions. Second operand  has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:22,844 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:22,844 INFO  L93              Difference]: Finished difference Result 4319 states and 6274 transitions.
[2025-03-08 09:26:22,845 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 09:26:22,845 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 239
[2025-03-08 09:26:22,845 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:22,849 INFO  L225             Difference]: With dead ends: 4319
[2025-03-08 09:26:22,849 INFO  L226             Difference]: Without dead ends: 2620
[2025-03-08 09:26:22,850 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:26:22,851 INFO  L435           NwaCegarLoop]: 823 mSDtfsCounter, 0 mSDsluCounter, 1640 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:22,851 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2463 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 09:26:22,852 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2620 states.
[2025-03-08 09:26:22,870 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2620 to 2620.
[2025-03-08 09:26:22,872 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2620 states, 2594 states have (on average 1.4402467232074017) internal successors, (3736), 2594 states have internal predecessors, (3736), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:22,875 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2620 states to 2620 states and 3784 transitions.
[2025-03-08 09:26:22,876 INFO  L78                 Accepts]: Start accepts. Automaton has 2620 states and 3784 transitions. Word has length 239
[2025-03-08 09:26:22,876 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:22,876 INFO  L471      AbstractCegarLoop]: Abstraction has 2620 states and 3784 transitions.
[2025-03-08 09:26:22,876 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:22,876 INFO  L276                IsEmpty]: Start isEmpty. Operand 2620 states and 3784 transitions.
[2025-03-08 09:26:22,879 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 240
[2025-03-08 09:26:22,879 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:22,879 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:22,879 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-03-08 09:26:22,879 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:22,879 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:22,880 INFO  L85        PathProgramCache]: Analyzing trace with hash -1027514298, now seen corresponding path program 1 times
[2025-03-08 09:26:22,880 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:22,880 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083490217]
[2025-03-08 09:26:22,880 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:22,880 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:22,905 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 239 statements into 1 equivalence classes.
[2025-03-08 09:26:22,980 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 239 of 239 statements.
[2025-03-08 09:26:22,980 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:22,980 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:23,738 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:23,738 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:23,739 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083490217]
[2025-03-08 09:26:23,739 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083490217] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:23,739 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:23,739 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-03-08 09:26:23,739 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189388511]
[2025-03-08 09:26:23,739 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:23,739 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-03-08 09:26:23,739 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:23,740 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-03-08 09:26:23,740 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132
[2025-03-08 09:26:23,740 INFO  L87              Difference]: Start difference. First operand 2620 states and 3784 transitions. Second operand  has 12 states, 12 states have (on average 19.333333333333332) internal successors, (232), 12 states have internal predecessors, (232), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:26:24,550 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:24,551 INFO  L93              Difference]: Finished difference Result 4293 states and 6232 transitions.
[2025-03-08 09:26:24,551 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-03-08 09:26:24,552 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 19.333333333333332) internal successors, (232), 12 states have internal predecessors, (232), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 239
[2025-03-08 09:26:24,552 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:24,559 INFO  L225             Difference]: With dead ends: 4293
[2025-03-08 09:26:24,559 INFO  L226             Difference]: Without dead ends: 2660
[2025-03-08 09:26:24,560 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342
[2025-03-08 09:26:24,561 INFO  L435           NwaCegarLoop]: 761 mSDtfsCounter, 1802 mSDsluCounter, 4854 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1802 SdHoareTripleChecker+Valid, 5615 SdHoareTripleChecker+Invalid, 1762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:24,561 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1802 Valid, 5615 Invalid, 1762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 09:26:24,562 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2660 states.
[2025-03-08 09:26:24,591 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2636.
[2025-03-08 09:26:24,593 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2636 states, 2610 states have (on average 1.4375478927203065) internal successors, (3752), 2610 states have internal predecessors, (3752), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:24,596 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3800 transitions.
[2025-03-08 09:26:24,596 INFO  L78                 Accepts]: Start accepts. Automaton has 2636 states and 3800 transitions. Word has length 239
[2025-03-08 09:26:24,596 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:24,596 INFO  L471      AbstractCegarLoop]: Abstraction has 2636 states and 3800 transitions.
[2025-03-08 09:26:24,596 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 19.333333333333332) internal successors, (232), 12 states have internal predecessors, (232), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:26:24,596 INFO  L276                IsEmpty]: Start isEmpty. Operand 2636 states and 3800 transitions.
[2025-03-08 09:26:24,598 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 241
[2025-03-08 09:26:24,599 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:24,599 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:24,599 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2025-03-08 09:26:24,599 INFO  L396      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:24,599 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:24,599 INFO  L85        PathProgramCache]: Analyzing trace with hash -539134659, now seen corresponding path program 1 times
[2025-03-08 09:26:24,599 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:24,600 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546235042]
[2025-03-08 09:26:24,600 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:24,600 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:24,624 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes.
[2025-03-08 09:26:24,699 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements.
[2025-03-08 09:26:24,699 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:24,699 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:25,051 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:25,052 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:25,052 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546235042]
[2025-03-08 09:26:25,052 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546235042] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:25,052 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:25,052 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 09:26:25,052 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126723648]
[2025-03-08 09:26:25,052 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:25,052 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 09:26:25,052 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:25,053 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 09:26:25,053 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:26:25,053 INFO  L87              Difference]: Start difference. First operand 2636 states and 3800 transitions. Second operand  has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:25,594 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:25,594 INFO  L93              Difference]: Finished difference Result 4661 states and 6765 transitions.
[2025-03-08 09:26:25,595 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 09:26:25,595 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 240
[2025-03-08 09:26:25,595 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:25,600 INFO  L225             Difference]: With dead ends: 4661
[2025-03-08 09:26:25,600 INFO  L226             Difference]: Without dead ends: 3312
[2025-03-08 09:26:25,602 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2025-03-08 09:26:25,602 INFO  L435           NwaCegarLoop]: 807 mSDtfsCounter, 836 mSDsluCounter, 4035 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 4842 SdHoareTripleChecker+Invalid, 1083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:25,602 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 4842 Invalid, 1083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 09:26:25,604 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3312 states.
[2025-03-08 09:26:25,623 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3312 to 2672.
[2025-03-08 09:26:25,625 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2672 states, 2646 states have (on average 1.436130007558579) internal successors, (3800), 2646 states have internal predecessors, (3800), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:25,628 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2672 states to 2672 states and 3848 transitions.
[2025-03-08 09:26:25,628 INFO  L78                 Accepts]: Start accepts. Automaton has 2672 states and 3848 transitions. Word has length 240
[2025-03-08 09:26:25,628 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:25,628 INFO  L471      AbstractCegarLoop]: Abstraction has 2672 states and 3848 transitions.
[2025-03-08 09:26:25,629 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 33.285714285714285) internal successors, (233), 7 states have internal predecessors, (233), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:25,629 INFO  L276                IsEmpty]: Start isEmpty. Operand 2672 states and 3848 transitions.
[2025-03-08 09:26:25,631 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 241
[2025-03-08 09:26:25,632 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:25,632 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:25,632 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2025-03-08 09:26:25,632 INFO  L396      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:25,632 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:25,632 INFO  L85        PathProgramCache]: Analyzing trace with hash 292745151, now seen corresponding path program 1 times
[2025-03-08 09:26:25,633 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:25,633 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619071959]
[2025-03-08 09:26:25,633 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:25,633 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:25,658 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 240 statements into 1 equivalence classes.
[2025-03-08 09:26:25,742 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 240 of 240 statements.
[2025-03-08 09:26:25,742 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:25,742 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:26,377 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:26,378 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:26,378 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619071959]
[2025-03-08 09:26:26,378 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619071959] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:26,378 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:26,378 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 09:26:26,378 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498063923]
[2025-03-08 09:26:26,378 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:26,378 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 09:26:26,378 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:26,378 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 09:26:26,379 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56
[2025-03-08 09:26:26,379 INFO  L87              Difference]: Start difference. First operand 2672 states and 3848 transitions. Second operand  has 8 states, 8 states have (on average 29.125) internal successors, (233), 8 states have internal predecessors, (233), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:26,760 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:26,760 INFO  L93              Difference]: Finished difference Result 4060 states and 5884 transitions.
[2025-03-08 09:26:26,760 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 09:26:26,760 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 29.125) internal successors, (233), 8 states have internal predecessors, (233), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 240
[2025-03-08 09:26:26,760 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:26,764 INFO  L225             Difference]: With dead ends: 4060
[2025-03-08 09:26:26,764 INFO  L226             Difference]: Without dead ends: 2918
[2025-03-08 09:26:26,765 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2025-03-08 09:26:26,766 INFO  L435           NwaCegarLoop]: 765 mSDtfsCounter, 1774 mSDsluCounter, 2426 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1774 SdHoareTripleChecker+Valid, 3191 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:26,766 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1774 Valid, 3191 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 09:26:26,767 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2918 states.
[2025-03-08 09:26:26,786 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2918 to 2916.
[2025-03-08 09:26:26,789 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2916 states, 2890 states have (on average 1.4408304498269897) internal successors, (4164), 2890 states have internal predecessors, (4164), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:26,791 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 4212 transitions.
[2025-03-08 09:26:26,791 INFO  L78                 Accepts]: Start accepts. Automaton has 2916 states and 4212 transitions. Word has length 240
[2025-03-08 09:26:26,791 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:26,791 INFO  L471      AbstractCegarLoop]: Abstraction has 2916 states and 4212 transitions.
[2025-03-08 09:26:26,792 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 29.125) internal successors, (233), 8 states have internal predecessors, (233), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:26,792 INFO  L276                IsEmpty]: Start isEmpty. Operand 2916 states and 4212 transitions.
[2025-03-08 09:26:26,794 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 242
[2025-03-08 09:26:26,794 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:26,794 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:26,794 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2025-03-08 09:26:26,795 INFO  L396      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:26,795 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:26,795 INFO  L85        PathProgramCache]: Analyzing trace with hash 265305136, now seen corresponding path program 1 times
[2025-03-08 09:26:26,795 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:26,795 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718855317]
[2025-03-08 09:26:26,795 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:26,795 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:26,821 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes.
[2025-03-08 09:26:26,907 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements.
[2025-03-08 09:26:26,907 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:26,907 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:27,105 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:27,106 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:27,106 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718855317]
[2025-03-08 09:26:27,106 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718855317] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:27,106 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:27,106 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:26:27,106 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012029607]
[2025-03-08 09:26:27,106 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:27,106 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:26:27,106 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:27,107 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:26:27,107 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:26:27,107 INFO  L87              Difference]: Start difference. First operand 2916 states and 4212 transitions. Second operand  has 5 states, 5 states have (on average 46.8) internal successors, (234), 5 states have internal predecessors, (234), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:27,435 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:27,436 INFO  L93              Difference]: Finished difference Result 4860 states and 7046 transitions.
[2025-03-08 09:26:27,436 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:26:27,436 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 46.8) internal successors, (234), 5 states have internal predecessors, (234), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 241
[2025-03-08 09:26:27,437 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:27,441 INFO  L225             Difference]: With dead ends: 4860
[2025-03-08 09:26:27,441 INFO  L226             Difference]: Without dead ends: 2940
[2025-03-08 09:26:27,444 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:26:27,447 INFO  L435           NwaCegarLoop]: 817 mSDtfsCounter, 911 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 2449 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:27,447 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 2449 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 09:26:27,448 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2940 states.
[2025-03-08 09:26:27,482 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2928.
[2025-03-08 09:26:27,484 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2928 states, 2902 states have (on average 1.4390075809786353) internal successors, (4176), 2902 states have internal predecessors, (4176), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:27,488 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 4224 transitions.
[2025-03-08 09:26:27,488 INFO  L78                 Accepts]: Start accepts. Automaton has 2928 states and 4224 transitions. Word has length 241
[2025-03-08 09:26:27,489 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:27,489 INFO  L471      AbstractCegarLoop]: Abstraction has 2928 states and 4224 transitions.
[2025-03-08 09:26:27,489 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 46.8) internal successors, (234), 5 states have internal predecessors, (234), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:27,489 INFO  L276                IsEmpty]: Start isEmpty. Operand 2928 states and 4224 transitions.
[2025-03-08 09:26:27,493 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 243
[2025-03-08 09:26:27,493 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:27,493 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:27,493 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2025-03-08 09:26:27,493 INFO  L396      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:27,494 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:27,494 INFO  L85        PathProgramCache]: Analyzing trace with hash 99696765, now seen corresponding path program 1 times
[2025-03-08 09:26:27,494 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:27,494 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958017086]
[2025-03-08 09:26:27,494 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:27,494 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:27,529 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes.
[2025-03-08 09:26:27,622 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements.
[2025-03-08 09:26:27,622 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:27,622 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:28,151 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:28,151 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:28,151 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958017086]
[2025-03-08 09:26:28,151 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958017086] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:28,153 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:28,153 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 09:26:28,153 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316986513]
[2025-03-08 09:26:28,153 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:28,154 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 09:26:28,154 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:28,154 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 09:26:28,154 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2025-03-08 09:26:28,155 INFO  L87              Difference]: Start difference. First operand 2928 states and 4224 transitions. Second operand  has 10 states, 10 states have (on average 23.5) internal successors, (235), 10 states have internal predecessors, (235), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:28,828 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:28,828 INFO  L93              Difference]: Finished difference Result 5323 states and 7737 transitions.
[2025-03-08 09:26:28,828 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 09:26:28,828 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 23.5) internal successors, (235), 10 states have internal predecessors, (235), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 242
[2025-03-08 09:26:28,828 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:28,832 INFO  L225             Difference]: With dead ends: 5323
[2025-03-08 09:26:28,832 INFO  L226             Difference]: Without dead ends: 3706
[2025-03-08 09:26:28,834 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210
[2025-03-08 09:26:28,835 INFO  L435           NwaCegarLoop]: 798 mSDtfsCounter, 2402 mSDsluCounter, 4858 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2404 SdHoareTripleChecker+Valid, 5656 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:28,835 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2404 Valid, 5656 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 09:26:28,836 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3706 states.
[2025-03-08 09:26:28,858 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3706 to 2936.
[2025-03-08 09:26:28,860 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2936 states, 2910 states have (on average 1.4378006872852234) internal successors, (4184), 2910 states have internal predecessors, (4184), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:28,862 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 4232 transitions.
[2025-03-08 09:26:28,862 INFO  L78                 Accepts]: Start accepts. Automaton has 2936 states and 4232 transitions. Word has length 242
[2025-03-08 09:26:28,863 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:28,863 INFO  L471      AbstractCegarLoop]: Abstraction has 2936 states and 4232 transitions.
[2025-03-08 09:26:28,863 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 23.5) internal successors, (235), 10 states have internal predecessors, (235), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:28,863 INFO  L276                IsEmpty]: Start isEmpty. Operand 2936 states and 4232 transitions.
[2025-03-08 09:26:28,865 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 243
[2025-03-08 09:26:28,865 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:28,865 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:28,866 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2025-03-08 09:26:28,866 INFO  L396      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:28,866 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:28,866 INFO  L85        PathProgramCache]: Analyzing trace with hash -1923300695, now seen corresponding path program 1 times
[2025-03-08 09:26:28,866 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:28,866 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684024854]
[2025-03-08 09:26:28,866 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:28,866 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:28,890 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes.
[2025-03-08 09:26:28,961 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements.
[2025-03-08 09:26:28,961 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:28,961 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:29,427 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:29,427 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:29,428 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684024854]
[2025-03-08 09:26:29,428 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684024854] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:29,428 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:29,428 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 09:26:29,428 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087125411]
[2025-03-08 09:26:29,428 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:29,428 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 09:26:29,428 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:29,429 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 09:26:29,429 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2025-03-08 09:26:29,429 INFO  L87              Difference]: Start difference. First operand 2936 states and 4232 transitions. Second operand  has 10 states, 10 states have (on average 23.5) internal successors, (235), 10 states have internal predecessors, (235), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:26:30,050 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:30,051 INFO  L93              Difference]: Finished difference Result 4807 states and 6969 transitions.
[2025-03-08 09:26:30,051 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 09:26:30,051 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 23.5) internal successors, (235), 10 states have internal predecessors, (235), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 242
[2025-03-08 09:26:30,051 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:30,053 INFO  L225             Difference]: With dead ends: 4807
[2025-03-08 09:26:30,053 INFO  L226             Difference]: Without dead ends: 2936
[2025-03-08 09:26:30,055 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210
[2025-03-08 09:26:30,055 INFO  L435           NwaCegarLoop]: 769 mSDtfsCounter, 2526 mSDsluCounter, 4029 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2526 SdHoareTripleChecker+Valid, 4798 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:30,055 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2526 Valid, 4798 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 09:26:30,056 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2936 states.
[2025-03-08 09:26:30,073 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2936 to 2936.
[2025-03-08 09:26:30,076 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2936 states, 2910 states have (on average 1.4323024054982818) internal successors, (4168), 2910 states have internal predecessors, (4168), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:30,078 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2936 states to 2936 states and 4216 transitions.
[2025-03-08 09:26:30,078 INFO  L78                 Accepts]: Start accepts. Automaton has 2936 states and 4216 transitions. Word has length 242
[2025-03-08 09:26:30,078 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:30,078 INFO  L471      AbstractCegarLoop]: Abstraction has 2936 states and 4216 transitions.
[2025-03-08 09:26:30,079 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 23.5) internal successors, (235), 10 states have internal predecessors, (235), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:26:30,079 INFO  L276                IsEmpty]: Start isEmpty. Operand 2936 states and 4216 transitions.
[2025-03-08 09:26:30,081 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 244
[2025-03-08 09:26:30,081 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:30,081 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:30,081 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2025-03-08 09:26:30,082 INFO  L396      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:30,082 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:30,082 INFO  L85        PathProgramCache]: Analyzing trace with hash -1004186000, now seen corresponding path program 1 times
[2025-03-08 09:26:30,082 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:30,082 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90540449]
[2025-03-08 09:26:30,082 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:30,082 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:30,109 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes.
[2025-03-08 09:26:30,134 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements.
[2025-03-08 09:26:30,134 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:30,134 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:30,305 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:30,305 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:30,306 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90540449]
[2025-03-08 09:26:30,306 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90540449] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:30,306 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:30,306 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:26:30,306 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145689374]
[2025-03-08 09:26:30,306 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:30,306 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:26:30,306 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:30,307 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:26:30,308 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:26:30,308 INFO  L87              Difference]: Start difference. First operand 2936 states and 4216 transitions. Second operand  has 5 states, 5 states have (on average 47.2) internal successors, (236), 5 states have internal predecessors, (236), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:30,631 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:30,631 INFO  L93              Difference]: Finished difference Result 4799 states and 6933 transitions.
[2025-03-08 09:26:30,632 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:26:30,632 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 47.2) internal successors, (236), 5 states have internal predecessors, (236), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 243
[2025-03-08 09:26:30,632 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:30,634 INFO  L225             Difference]: With dead ends: 4799
[2025-03-08 09:26:30,635 INFO  L226             Difference]: Without dead ends: 2976
[2025-03-08 09:26:30,638 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:26:30,638 INFO  L435           NwaCegarLoop]: 820 mSDtfsCounter, 2 mSDsluCounter, 2449 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3269 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:30,638 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3269 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 09:26:30,643 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2976 states.
[2025-03-08 09:26:30,670 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 2968.
[2025-03-08 09:26:30,672 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2968 states, 2942 states have (on average 1.4303195105370496) internal successors, (4208), 2942 states have internal predecessors, (4208), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:30,675 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2968 states to 2968 states and 4256 transitions.
[2025-03-08 09:26:30,675 INFO  L78                 Accepts]: Start accepts. Automaton has 2968 states and 4256 transitions. Word has length 243
[2025-03-08 09:26:30,675 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:30,676 INFO  L471      AbstractCegarLoop]: Abstraction has 2968 states and 4256 transitions.
[2025-03-08 09:26:30,676 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 47.2) internal successors, (236), 5 states have internal predecessors, (236), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:30,676 INFO  L276                IsEmpty]: Start isEmpty. Operand 2968 states and 4256 transitions.
[2025-03-08 09:26:30,678 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 244
[2025-03-08 09:26:30,678 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:30,678 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:30,679 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2025-03-08 09:26:30,679 INFO  L396      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:30,679 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:30,679 INFO  L85        PathProgramCache]: Analyzing trace with hash -1785378103, now seen corresponding path program 1 times
[2025-03-08 09:26:30,679 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:30,679 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300927164]
[2025-03-08 09:26:30,679 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:30,679 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:30,704 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes.
[2025-03-08 09:26:30,766 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements.
[2025-03-08 09:26:30,766 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:30,766 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:31,094 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:31,095 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:31,095 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300927164]
[2025-03-08 09:26:31,095 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300927164] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:31,095 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:31,095 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 09:26:31,095 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488029873]
[2025-03-08 09:26:31,095 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:31,095 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 09:26:31,095 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:31,096 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 09:26:31,096 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:26:31,096 INFO  L87              Difference]: Start difference. First operand 2968 states and 4256 transitions. Second operand  has 6 states, 6 states have (on average 39.333333333333336) internal successors, (236), 6 states have internal predecessors, (236), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:31,530 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:31,530 INFO  L93              Difference]: Finished difference Result 5325 states and 7706 transitions.
[2025-03-08 09:26:31,530 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 09:26:31,530 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 39.333333333333336) internal successors, (236), 6 states have internal predecessors, (236), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 243
[2025-03-08 09:26:31,530 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:31,534 INFO  L225             Difference]: With dead ends: 5325
[2025-03-08 09:26:31,534 INFO  L226             Difference]: Without dead ends: 3734
[2025-03-08 09:26:31,536 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2025-03-08 09:26:31,536 INFO  L435           NwaCegarLoop]: 807 mSDtfsCounter, 828 mSDsluCounter, 3228 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 828 SdHoareTripleChecker+Valid, 4035 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:31,536 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [828 Valid, 4035 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:26:31,538 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3734 states.
[2025-03-08 09:26:31,559 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3734 to 3004.
[2025-03-08 09:26:31,561 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3004 states, 2978 states have (on average 1.4291470785762257) internal successors, (4256), 2978 states have internal predecessors, (4256), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:31,564 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 4304 transitions.
[2025-03-08 09:26:31,565 INFO  L78                 Accepts]: Start accepts. Automaton has 3004 states and 4304 transitions. Word has length 243
[2025-03-08 09:26:31,565 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:31,565 INFO  L471      AbstractCegarLoop]: Abstraction has 3004 states and 4304 transitions.
[2025-03-08 09:26:31,565 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 39.333333333333336) internal successors, (236), 6 states have internal predecessors, (236), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:31,565 INFO  L276                IsEmpty]: Start isEmpty. Operand 3004 states and 4304 transitions.
[2025-03-08 09:26:31,568 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 244
[2025-03-08 09:26:31,568 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:31,568 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:31,568 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2025-03-08 09:26:31,568 INFO  L396      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:31,569 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:31,569 INFO  L85        PathProgramCache]: Analyzing trace with hash -335381099, now seen corresponding path program 1 times
[2025-03-08 09:26:31,569 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:31,569 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590118350]
[2025-03-08 09:26:31,569 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:31,569 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:31,594 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes.
[2025-03-08 09:26:31,670 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements.
[2025-03-08 09:26:31,671 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:31,671 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:32,327 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:32,327 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:32,327 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590118350]
[2025-03-08 09:26:32,327 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590118350] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:32,328 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:32,328 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-03-08 09:26:32,328 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751839471]
[2025-03-08 09:26:32,328 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:32,328 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-03-08 09:26:32,328 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:32,329 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-03-08 09:26:32,329 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132
[2025-03-08 09:26:32,329 INFO  L87              Difference]: Start difference. First operand 3004 states and 4304 transitions. Second operand  has 12 states, 12 states have (on average 19.666666666666668) internal successors, (236), 12 states have internal predecessors, (236), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:26:33,151 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:33,151 INFO  L93              Difference]: Finished difference Result 4908 states and 7083 transitions.
[2025-03-08 09:26:33,151 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-03-08 09:26:33,151 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 19.666666666666668) internal successors, (236), 12 states have internal predecessors, (236), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 243
[2025-03-08 09:26:33,151 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:33,154 INFO  L225             Difference]: With dead ends: 4908
[2025-03-08 09:26:33,154 INFO  L226             Difference]: Without dead ends: 3044
[2025-03-08 09:26:33,155 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342
[2025-03-08 09:26:33,156 INFO  L435           NwaCegarLoop]: 760 mSDtfsCounter, 1792 mSDsluCounter, 5508 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1792 SdHoareTripleChecker+Valid, 6268 SdHoareTripleChecker+Invalid, 1947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:33,156 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1792 Valid, 6268 Invalid, 1947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1944 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 09:26:33,157 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3044 states.
[2025-03-08 09:26:33,177 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3044 to 3020.
[2025-03-08 09:26:33,179 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3020 states, 2994 states have (on average 1.4268537074148298) internal successors, (4272), 2994 states have internal predecessors, (4272), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:33,182 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3020 states to 3020 states and 4320 transitions.
[2025-03-08 09:26:33,182 INFO  L78                 Accepts]: Start accepts. Automaton has 3020 states and 4320 transitions. Word has length 243
[2025-03-08 09:26:33,183 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:33,183 INFO  L471      AbstractCegarLoop]: Abstraction has 3020 states and 4320 transitions.
[2025-03-08 09:26:33,183 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 19.666666666666668) internal successors, (236), 12 states have internal predecessors, (236), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:26:33,183 INFO  L276                IsEmpty]: Start isEmpty. Operand 3020 states and 4320 transitions.
[2025-03-08 09:26:33,185 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 245
[2025-03-08 09:26:33,186 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:33,186 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:33,186 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2025-03-08 09:26:33,186 INFO  L396      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:33,187 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:33,187 INFO  L85        PathProgramCache]: Analyzing trace with hash 187354121, now seen corresponding path program 1 times
[2025-03-08 09:26:33,187 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:33,187 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663867198]
[2025-03-08 09:26:33,187 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:33,187 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:33,212 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes.
[2025-03-08 09:26:33,320 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements.
[2025-03-08 09:26:33,320 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:33,320 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:33,804 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:33,804 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:33,804 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663867198]
[2025-03-08 09:26:33,804 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663867198] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:33,804 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:33,804 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 09:26:33,804 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625808353]
[2025-03-08 09:26:33,805 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:33,805 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 09:26:33,805 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:33,805 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 09:26:33,805 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2025-03-08 09:26:33,806 INFO  L87              Difference]: Start difference. First operand 3020 states and 4320 transitions. Second operand  has 10 states, 10 states have (on average 23.7) internal successors, (237), 10 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:34,436 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:34,436 INFO  L93              Difference]: Finished difference Result 5382 states and 7773 transitions.
[2025-03-08 09:26:34,436 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 09:26:34,436 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 23.7) internal successors, (237), 10 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 244
[2025-03-08 09:26:34,437 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:34,440 INFO  L225             Difference]: With dead ends: 5382
[2025-03-08 09:26:34,440 INFO  L226             Difference]: Without dead ends: 3766
[2025-03-08 09:26:34,442 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210
[2025-03-08 09:26:34,442 INFO  L435           NwaCegarLoop]: 797 mSDtfsCounter, 2491 mSDsluCounter, 4845 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2493 SdHoareTripleChecker+Valid, 5642 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:34,442 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2493 Valid, 5642 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 09:26:34,443 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3766 states.
[2025-03-08 09:26:34,480 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3766 to 3028.
[2025-03-08 09:26:34,482 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3028 states, 3002 states have (on average 1.4257161892071952) internal successors, (4280), 3002 states have internal predecessors, (4280), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:34,485 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 3028 states and 4328 transitions.
[2025-03-08 09:26:34,485 INFO  L78                 Accepts]: Start accepts. Automaton has 3028 states and 4328 transitions. Word has length 244
[2025-03-08 09:26:34,485 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:34,485 INFO  L471      AbstractCegarLoop]: Abstraction has 3028 states and 4328 transitions.
[2025-03-08 09:26:34,485 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 23.7) internal successors, (237), 10 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:34,485 INFO  L276                IsEmpty]: Start isEmpty. Operand 3028 states and 4328 transitions.
[2025-03-08 09:26:34,488 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 245
[2025-03-08 09:26:34,488 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:34,488 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:34,488 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2025-03-08 09:26:34,488 INFO  L396      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:34,489 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:34,489 INFO  L85        PathProgramCache]: Analyzing trace with hash 60006638, now seen corresponding path program 1 times
[2025-03-08 09:26:34,489 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:34,489 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666167258]
[2025-03-08 09:26:34,489 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:34,489 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:34,514 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes.
[2025-03-08 09:26:34,596 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements.
[2025-03-08 09:26:34,597 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:34,597 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:34,713 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:34,713 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:34,713 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666167258]
[2025-03-08 09:26:34,713 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666167258] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:34,714 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:34,714 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:26:34,714 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617347475]
[2025-03-08 09:26:34,714 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:34,714 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:26:34,714 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:34,715 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:26:34,715 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:26:34,715 INFO  L87              Difference]: Start difference. First operand 3028 states and 4328 transitions. Second operand  has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:34,988 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:34,988 INFO  L93              Difference]: Finished difference Result 4952 states and 7119 transitions.
[2025-03-08 09:26:34,989 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:26:34,989 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 244
[2025-03-08 09:26:34,989 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:34,991 INFO  L225             Difference]: With dead ends: 4952
[2025-03-08 09:26:34,991 INFO  L226             Difference]: Without dead ends: 3052
[2025-03-08 09:26:34,993 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:26:34,993 INFO  L435           NwaCegarLoop]: 816 mSDtfsCounter, 903 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 2446 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:34,993 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 2446 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 09:26:34,994 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3052 states.
[2025-03-08 09:26:35,015 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 3040.
[2025-03-08 09:26:35,017 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3040 states, 3014 states have (on average 1.4240212342402123) internal successors, (4292), 3014 states have internal predecessors, (4292), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:35,019 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3040 states to 3040 states and 4340 transitions.
[2025-03-08 09:26:35,020 INFO  L78                 Accepts]: Start accepts. Automaton has 3040 states and 4340 transitions. Word has length 244
[2025-03-08 09:26:35,020 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:35,020 INFO  L471      AbstractCegarLoop]: Abstraction has 3040 states and 4340 transitions.
[2025-03-08 09:26:35,020 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:35,020 INFO  L276                IsEmpty]: Start isEmpty. Operand 3040 states and 4340 transitions.
[2025-03-08 09:26:35,023 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 245
[2025-03-08 09:26:35,023 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:35,023 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:35,023 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2025-03-08 09:26:35,023 INFO  L396      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:35,024 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:35,024 INFO  L85        PathProgramCache]: Analyzing trace with hash 311901557, now seen corresponding path program 1 times
[2025-03-08 09:26:35,024 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:35,024 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630077853]
[2025-03-08 09:26:35,024 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:35,024 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:35,049 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes.
[2025-03-08 09:26:35,120 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements.
[2025-03-08 09:26:35,120 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:35,120 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:35,514 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:35,514 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:35,514 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630077853]
[2025-03-08 09:26:35,514 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630077853] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:35,514 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:35,514 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 09:26:35,514 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974534565]
[2025-03-08 09:26:35,514 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:35,514 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 09:26:35,514 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:35,515 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 09:26:35,515 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:26:35,515 INFO  L87              Difference]: Start difference. First operand 3040 states and 4340 transitions. Second operand  has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:36,039 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:36,039 INFO  L93              Difference]: Finished difference Result 4615 states and 6636 transitions.
[2025-03-08 09:26:36,039 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 09:26:36,039 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 244
[2025-03-08 09:26:36,039 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:36,042 INFO  L225             Difference]: With dead ends: 4615
[2025-03-08 09:26:36,043 INFO  L226             Difference]: Without dead ends: 3186
[2025-03-08 09:26:36,044 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72
[2025-03-08 09:26:36,044 INFO  L435           NwaCegarLoop]: 755 mSDtfsCounter, 1519 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 3730 SdHoareTripleChecker+Invalid, 1145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:36,045 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 3730 Invalid, 1145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 09:26:36,046 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3186 states.
[2025-03-08 09:26:36,071 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3186 to 3056.
[2025-03-08 09:26:36,073 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3056 states, 3030 states have (on average 1.4231023102310232) internal successors, (4312), 3030 states have internal predecessors, (4312), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:36,075 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3056 states to 3056 states and 4360 transitions.
[2025-03-08 09:26:36,075 INFO  L78                 Accepts]: Start accepts. Automaton has 3056 states and 4360 transitions. Word has length 244
[2025-03-08 09:26:36,075 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:36,075 INFO  L471      AbstractCegarLoop]: Abstraction has 3056 states and 4360 transitions.
[2025-03-08 09:26:36,075 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:36,076 INFO  L276                IsEmpty]: Start isEmpty. Operand 3056 states and 4360 transitions.
[2025-03-08 09:26:36,078 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 245
[2025-03-08 09:26:36,078 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:36,078 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:36,078 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2025-03-08 09:26:36,078 INFO  L396      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:36,079 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:36,079 INFO  L85        PathProgramCache]: Analyzing trace with hash -1073258780, now seen corresponding path program 1 times
[2025-03-08 09:26:36,079 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:36,079 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589959475]
[2025-03-08 09:26:36,079 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:36,079 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:36,103 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes.
[2025-03-08 09:26:36,177 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements.
[2025-03-08 09:26:36,177 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:36,177 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:36,395 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:36,395 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:36,395 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589959475]
[2025-03-08 09:26:36,395 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589959475] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:36,395 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:36,395 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 09:26:36,395 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320200973]
[2025-03-08 09:26:36,395 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:36,396 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 09:26:36,396 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:36,396 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 09:26:36,396 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:26:36,396 INFO  L87              Difference]: Start difference. First operand 3056 states and 4360 transitions. Second operand  has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:36,760 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:36,760 INFO  L93              Difference]: Finished difference Result 4567 states and 6564 transitions.
[2025-03-08 09:26:36,760 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 09:26:36,760 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 244
[2025-03-08 09:26:36,760 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:36,763 INFO  L225             Difference]: With dead ends: 4567
[2025-03-08 09:26:36,763 INFO  L226             Difference]: Without dead ends: 3150
[2025-03-08 09:26:36,764 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-03-08 09:26:36,765 INFO  L435           NwaCegarLoop]: 1031 mSDtfsCounter, 307 mSDsluCounter, 3851 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 4882 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:36,765 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 4882 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 09:26:36,767 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3150 states.
[2025-03-08 09:26:36,788 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3150 to 3072.
[2025-03-08 09:26:36,790 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3072 states, 3046 states have (on average 1.42284963887065) internal successors, (4334), 3046 states have internal predecessors, (4334), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:36,793 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 4382 transitions.
[2025-03-08 09:26:36,794 INFO  L78                 Accepts]: Start accepts. Automaton has 3072 states and 4382 transitions. Word has length 244
[2025-03-08 09:26:36,794 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:36,794 INFO  L471      AbstractCegarLoop]: Abstraction has 3072 states and 4382 transitions.
[2025-03-08 09:26:36,794 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:36,794 INFO  L276                IsEmpty]: Start isEmpty. Operand 3072 states and 4382 transitions.
[2025-03-08 09:26:36,797 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 246
[2025-03-08 09:26:36,797 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:36,797 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:36,797 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2025-03-08 09:26:36,797 INFO  L396      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:36,797 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:36,797 INFO  L85        PathProgramCache]: Analyzing trace with hash 938472832, now seen corresponding path program 1 times
[2025-03-08 09:26:36,798 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:36,798 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317266522]
[2025-03-08 09:26:36,798 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:36,798 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:36,822 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes.
[2025-03-08 09:26:36,912 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements.
[2025-03-08 09:26:36,912 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:36,912 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:37,222 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:37,222 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:37,222 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317266522]
[2025-03-08 09:26:37,222 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317266522] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:37,222 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:37,222 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 09:26:37,222 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345714525]
[2025-03-08 09:26:37,222 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:37,222 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 09:26:37,223 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:37,223 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 09:26:37,223 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:26:37,223 INFO  L87              Difference]: Start difference. First operand 3072 states and 4382 transitions. Second operand  has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:37,712 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:37,712 INFO  L93              Difference]: Finished difference Result 4619 states and 6638 transitions.
[2025-03-08 09:26:37,712 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 09:26:37,712 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 245
[2025-03-08 09:26:37,713 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:37,715 INFO  L225             Difference]: With dead ends: 4619
[2025-03-08 09:26:37,715 INFO  L226             Difference]: Without dead ends: 3202
[2025-03-08 09:26:37,717 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2025-03-08 09:26:37,717 INFO  L435           NwaCegarLoop]: 755 mSDtfsCounter, 1246 mSDsluCounter, 2991 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1248 SdHoareTripleChecker+Valid, 3746 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:37,717 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1248 Valid, 3746 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:26:37,718 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3202 states.
[2025-03-08 09:26:37,737 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3202 to 3108.
[2025-03-08 09:26:37,738 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3108 states, 3082 states have (on average 1.4224529526281635) internal successors, (4384), 3082 states have internal predecessors, (4384), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:37,741 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3108 states to 3108 states and 4432 transitions.
[2025-03-08 09:26:37,741 INFO  L78                 Accepts]: Start accepts. Automaton has 3108 states and 4432 transitions. Word has length 245
[2025-03-08 09:26:37,741 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:37,741 INFO  L471      AbstractCegarLoop]: Abstraction has 3108 states and 4432 transitions.
[2025-03-08 09:26:37,741 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:37,741 INFO  L276                IsEmpty]: Start isEmpty. Operand 3108 states and 4432 transitions.
[2025-03-08 09:26:37,743 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 246
[2025-03-08 09:26:37,743 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:37,744 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:37,744 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2025-03-08 09:26:37,744 INFO  L396      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:37,744 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:37,744 INFO  L85        PathProgramCache]: Analyzing trace with hash -2121014449, now seen corresponding path program 1 times
[2025-03-08 09:26:37,744 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:37,744 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904450870]
[2025-03-08 09:26:37,744 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:37,744 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:37,765 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes.
[2025-03-08 09:26:37,835 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements.
[2025-03-08 09:26:37,835 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:37,835 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:38,071 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:38,071 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:38,071 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904450870]
[2025-03-08 09:26:38,071 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904450870] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:38,071 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:38,071 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 09:26:38,071 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387074610]
[2025-03-08 09:26:38,071 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:38,072 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 09:26:38,072 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:38,072 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 09:26:38,072 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:26:38,072 INFO  L87              Difference]: Start difference. First operand 3108 states and 4432 transitions. Second operand  has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:38,432 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:38,432 INFO  L93              Difference]: Finished difference Result 4603 states and 6612 transitions.
[2025-03-08 09:26:38,432 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 09:26:38,432 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 245
[2025-03-08 09:26:38,433 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:38,435 INFO  L225             Difference]: With dead ends: 4603
[2025-03-08 09:26:38,435 INFO  L226             Difference]: Without dead ends: 3186
[2025-03-08 09:26:38,436 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-03-08 09:26:38,437 INFO  L435           NwaCegarLoop]: 1021 mSDtfsCounter, 301 mSDsluCounter, 3821 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 4842 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:38,437 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 4842 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 09:26:38,438 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3186 states.
[2025-03-08 09:26:38,456 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3186 to 3124.
[2025-03-08 09:26:38,458 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3124 states, 3098 states have (on average 1.422207876049064) internal successors, (4406), 3098 states have internal predecessors, (4406), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:38,460 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 4454 transitions.
[2025-03-08 09:26:38,460 INFO  L78                 Accepts]: Start accepts. Automaton has 3124 states and 4454 transitions. Word has length 245
[2025-03-08 09:26:38,461 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:38,461 INFO  L471      AbstractCegarLoop]: Abstraction has 3124 states and 4454 transitions.
[2025-03-08 09:26:38,461 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 39.666666666666664) internal successors, (238), 6 states have internal predecessors, (238), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:38,461 INFO  L276                IsEmpty]: Start isEmpty. Operand 3124 states and 4454 transitions.
[2025-03-08 09:26:38,463 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 247
[2025-03-08 09:26:38,463 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:38,463 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:38,463 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2025-03-08 09:26:38,463 INFO  L396      AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:38,463 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:38,463 INFO  L85        PathProgramCache]: Analyzing trace with hash -602720919, now seen corresponding path program 1 times
[2025-03-08 09:26:38,463 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:38,463 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570320485]
[2025-03-08 09:26:38,464 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:38,464 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:38,489 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes.
[2025-03-08 09:26:38,555 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements.
[2025-03-08 09:26:38,555 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:38,555 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:39,004 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:39,004 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:39,004 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570320485]
[2025-03-08 09:26:39,004 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570320485] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:39,004 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:39,004 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 09:26:39,004 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379264998]
[2025-03-08 09:26:39,004 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:39,005 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 09:26:39,005 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:39,005 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 09:26:39,005 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2025-03-08 09:26:39,005 INFO  L87              Difference]: Start difference. First operand 3124 states and 4454 transitions. Second operand  has 10 states, 10 states have (on average 23.9) internal successors, (239), 10 states have internal predecessors, (239), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:26:39,542 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:39,542 INFO  L93              Difference]: Finished difference Result 5057 states and 7260 transitions.
[2025-03-08 09:26:39,543 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 09:26:39,543 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 23.9) internal successors, (239), 10 states have internal predecessors, (239), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 246
[2025-03-08 09:26:39,543 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:39,546 INFO  L225             Difference]: With dead ends: 5057
[2025-03-08 09:26:39,546 INFO  L226             Difference]: Without dead ends: 3124
[2025-03-08 09:26:39,547 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210
[2025-03-08 09:26:39,547 INFO  L435           NwaCegarLoop]: 768 mSDtfsCounter, 1767 mSDsluCounter, 3371 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1767 SdHoareTripleChecker+Valid, 4139 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:39,548 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1767 Valid, 4139 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 09:26:39,549 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3124 states.
[2025-03-08 09:26:39,568 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 3124.
[2025-03-08 09:26:39,570 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3124 states, 3098 states have (on average 1.4170432537120723) internal successors, (4390), 3098 states have internal predecessors, (4390), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:39,572 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 4438 transitions.
[2025-03-08 09:26:39,572 INFO  L78                 Accepts]: Start accepts. Automaton has 3124 states and 4438 transitions. Word has length 246
[2025-03-08 09:26:39,573 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:39,573 INFO  L471      AbstractCegarLoop]: Abstraction has 3124 states and 4438 transitions.
[2025-03-08 09:26:39,573 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 23.9) internal successors, (239), 10 states have internal predecessors, (239), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:26:39,573 INFO  L276                IsEmpty]: Start isEmpty. Operand 3124 states and 4438 transitions.
[2025-03-08 09:26:39,575 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 248
[2025-03-08 09:26:39,575 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:39,575 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:39,575 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2025-03-08 09:26:39,575 INFO  L396      AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:39,575 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:39,576 INFO  L85        PathProgramCache]: Analyzing trace with hash 318023778, now seen corresponding path program 1 times
[2025-03-08 09:26:39,576 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:39,576 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901127918]
[2025-03-08 09:26:39,576 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:39,576 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:39,597 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes.
[2025-03-08 09:26:39,621 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements.
[2025-03-08 09:26:39,621 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:39,621 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:39,774 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:39,774 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:39,774 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901127918]
[2025-03-08 09:26:39,774 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901127918] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:39,774 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:39,775 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:26:39,775 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073201880]
[2025-03-08 09:26:39,775 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:39,775 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:26:39,775 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:39,775 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:26:39,775 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:26:39,775 INFO  L87              Difference]: Start difference. First operand 3124 states and 4438 transitions. Second operand  has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:40,026 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:40,027 INFO  L93              Difference]: Finished difference Result 5049 states and 7224 transitions.
[2025-03-08 09:26:40,027 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:26:40,027 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 247
[2025-03-08 09:26:40,027 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:40,029 INFO  L225             Difference]: With dead ends: 5049
[2025-03-08 09:26:40,030 INFO  L226             Difference]: Without dead ends: 3164
[2025-03-08 09:26:40,031 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:26:40,031 INFO  L435           NwaCegarLoop]: 819 mSDtfsCounter, 2 mSDsluCounter, 2446 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3265 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:40,031 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3265 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 09:26:40,032 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3164 states.
[2025-03-08 09:26:40,051 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3164 to 3156.
[2025-03-08 09:26:40,053 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3156 states, 3130 states have (on average 1.415335463258786) internal successors, (4430), 3130 states have internal predecessors, (4430), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:40,055 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3156 states to 3156 states and 4478 transitions.
[2025-03-08 09:26:40,055 INFO  L78                 Accepts]: Start accepts. Automaton has 3156 states and 4478 transitions. Word has length 247
[2025-03-08 09:26:40,056 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:40,056 INFO  L471      AbstractCegarLoop]: Abstraction has 3156 states and 4478 transitions.
[2025-03-08 09:26:40,056 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 48.0) internal successors, (240), 5 states have internal predecessors, (240), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:40,056 INFO  L276                IsEmpty]: Start isEmpty. Operand 3156 states and 4478 transitions.
[2025-03-08 09:26:40,058 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 248
[2025-03-08 09:26:40,058 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:40,058 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:40,058 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2025-03-08 09:26:40,058 INFO  L396      AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:40,058 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:40,058 INFO  L85        PathProgramCache]: Analyzing trace with hash 151362534, now seen corresponding path program 1 times
[2025-03-08 09:26:40,058 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:40,058 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041407383]
[2025-03-08 09:26:40,058 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:40,058 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:40,083 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes.
[2025-03-08 09:26:40,154 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements.
[2025-03-08 09:26:40,154 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:40,154 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:40,299 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:40,299 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:40,299 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041407383]
[2025-03-08 09:26:40,299 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041407383] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:40,299 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:40,300 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 09:26:40,300 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088061175]
[2025-03-08 09:26:40,300 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:40,314 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 09:26:40,314 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:40,315 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 09:26:40,315 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:26:40,315 INFO  L87              Difference]: Start difference. First operand 3156 states and 4478 transitions. Second operand  has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:40,503 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:40,503 INFO  L93              Difference]: Finished difference Result 5184 states and 7401 transitions.
[2025-03-08 09:26:40,504 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 09:26:40,504 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 247
[2025-03-08 09:26:40,504 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:40,507 INFO  L225             Difference]: With dead ends: 5184
[2025-03-08 09:26:40,507 INFO  L226             Difference]: Without dead ends: 3192
[2025-03-08 09:26:40,509 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:26:40,509 INFO  L435           NwaCegarLoop]: 821 mSDtfsCounter, 0 mSDsluCounter, 1636 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2457 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:40,509 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2457 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 09:26:40,510 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3192 states.
[2025-03-08 09:26:40,531 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3192 to 3192.
[2025-03-08 09:26:40,533 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3192 states, 3166 states have (on average 1.410612760581175) internal successors, (4466), 3166 states have internal predecessors, (4466), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:40,535 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3192 states to 3192 states and 4514 transitions.
[2025-03-08 09:26:40,536 INFO  L78                 Accepts]: Start accepts. Automaton has 3192 states and 4514 transitions. Word has length 247
[2025-03-08 09:26:40,536 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:40,536 INFO  L471      AbstractCegarLoop]: Abstraction has 3192 states and 4514 transitions.
[2025-03-08 09:26:40,536 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 60.0) internal successors, (240), 4 states have internal predecessors, (240), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:40,536 INFO  L276                IsEmpty]: Start isEmpty. Operand 3192 states and 4514 transitions.
[2025-03-08 09:26:40,538 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 248
[2025-03-08 09:26:40,538 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:40,538 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:40,538 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2025-03-08 09:26:40,538 INFO  L396      AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:40,539 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:40,539 INFO  L85        PathProgramCache]: Analyzing trace with hash -651635833, now seen corresponding path program 1 times
[2025-03-08 09:26:40,539 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:40,539 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201678712]
[2025-03-08 09:26:40,539 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:40,539 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:40,563 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes.
[2025-03-08 09:26:40,628 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements.
[2025-03-08 09:26:40,628 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:40,628 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:41,222 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:41,222 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:41,222 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201678712]
[2025-03-08 09:26:41,222 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201678712] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:41,222 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:41,222 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-03-08 09:26:41,222 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82214042]
[2025-03-08 09:26:41,222 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:41,222 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-03-08 09:26:41,222 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:41,223 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-03-08 09:26:41,223 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132
[2025-03-08 09:26:41,223 INFO  L87              Difference]: Start difference. First operand 3192 states and 4514 transitions. Second operand  has 12 states, 12 states have (on average 20.0) internal successors, (240), 12 states have internal predecessors, (240), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:26:42,048 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:42,049 INFO  L93              Difference]: Finished difference Result 5158 states and 7359 transitions.
[2025-03-08 09:26:42,049 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-03-08 09:26:42,049 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 20.0) internal successors, (240), 12 states have internal predecessors, (240), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 247
[2025-03-08 09:26:42,049 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:42,052 INFO  L225             Difference]: With dead ends: 5158
[2025-03-08 09:26:42,052 INFO  L226             Difference]: Without dead ends: 3232
[2025-03-08 09:26:42,054 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342
[2025-03-08 09:26:42,055 INFO  L435           NwaCegarLoop]: 759 mSDtfsCounter, 2537 mSDsluCounter, 5490 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2537 SdHoareTripleChecker+Valid, 6249 SdHoareTripleChecker+Invalid, 1948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:42,055 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2537 Valid, 6249 Invalid, 1948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1944 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 09:26:42,056 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3232 states.
[2025-03-08 09:26:42,078 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3232 to 3208.
[2025-03-08 09:26:42,079 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3208 states, 3182 states have (on average 1.4085480829666877) internal successors, (4482), 3182 states have internal predecessors, (4482), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:42,082 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3208 states to 3208 states and 4530 transitions.
[2025-03-08 09:26:42,082 INFO  L78                 Accepts]: Start accepts. Automaton has 3208 states and 4530 transitions. Word has length 247
[2025-03-08 09:26:42,082 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:42,083 INFO  L471      AbstractCegarLoop]: Abstraction has 3208 states and 4530 transitions.
[2025-03-08 09:26:42,083 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 20.0) internal successors, (240), 12 states have internal predecessors, (240), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:26:42,083 INFO  L276                IsEmpty]: Start isEmpty. Operand 3208 states and 4530 transitions.
[2025-03-08 09:26:42,085 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 249
[2025-03-08 09:26:42,085 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:42,085 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:42,085 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2025-03-08 09:26:42,085 INFO  L396      AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:42,085 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:42,085 INFO  L85        PathProgramCache]: Analyzing trace with hash 906458691, now seen corresponding path program 1 times
[2025-03-08 09:26:42,085 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:42,085 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736142711]
[2025-03-08 09:26:42,085 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:42,085 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:42,108 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes.
[2025-03-08 09:26:42,178 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements.
[2025-03-08 09:26:42,178 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:42,178 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:42,701 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:42,702 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:42,702 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736142711]
[2025-03-08 09:26:42,702 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736142711] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:42,702 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:42,702 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 09:26:42,702 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302698742]
[2025-03-08 09:26:42,702 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:42,702 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 09:26:42,702 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:42,703 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 09:26:42,703 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2025-03-08 09:26:42,703 INFO  L87              Difference]: Start difference. First operand 3208 states and 4530 transitions. Second operand  has 10 states, 10 states have (on average 24.1) internal successors, (241), 10 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:43,441 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:43,441 INFO  L93              Difference]: Finished difference Result 5660 states and 8092 transitions.
[2025-03-08 09:26:43,441 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 09:26:43,441 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 24.1) internal successors, (241), 10 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 248
[2025-03-08 09:26:43,442 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:43,445 INFO  L225             Difference]: With dead ends: 5660
[2025-03-08 09:26:43,445 INFO  L226             Difference]: Without dead ends: 4000
[2025-03-08 09:26:43,447 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210
[2025-03-08 09:26:43,447 INFO  L435           NwaCegarLoop]: 798 mSDtfsCounter, 1793 mSDsluCounter, 5562 mSDsCounter, 0 mSdLazyCounter, 1533 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1795 SdHoareTripleChecker+Valid, 6360 SdHoareTripleChecker+Invalid, 1533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:43,448 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1795 Valid, 6360 Invalid, 1533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1533 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 09:26:43,449 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4000 states.
[2025-03-08 09:26:43,486 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4000 to 3220.
[2025-03-08 09:26:43,488 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3220 states, 3194 states have (on average 1.4082654978083908) internal successors, (4498), 3194 states have internal predecessors, (4498), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:43,492 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3220 states to 3220 states and 4546 transitions.
[2025-03-08 09:26:43,493 INFO  L78                 Accepts]: Start accepts. Automaton has 3220 states and 4546 transitions. Word has length 248
[2025-03-08 09:26:43,493 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:43,493 INFO  L471      AbstractCegarLoop]: Abstraction has 3220 states and 4546 transitions.
[2025-03-08 09:26:43,493 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 24.1) internal successors, (241), 10 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:43,493 INFO  L276                IsEmpty]: Start isEmpty. Operand 3220 states and 4546 transitions.
[2025-03-08 09:26:43,497 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 249
[2025-03-08 09:26:43,497 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:43,497 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:43,497 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2025-03-08 09:26:43,497 INFO  L396      AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:43,498 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:43,498 INFO  L85        PathProgramCache]: Analyzing trace with hash 1051263503, now seen corresponding path program 1 times
[2025-03-08 09:26:43,498 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:43,498 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330681758]
[2025-03-08 09:26:43,498 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:43,498 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:43,531 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes.
[2025-03-08 09:26:43,622 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements.
[2025-03-08 09:26:43,623 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:43,623 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:43,961 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:43,961 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:43,961 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330681758]
[2025-03-08 09:26:43,961 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330681758] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:43,961 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:43,961 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 09:26:43,961 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791309652]
[2025-03-08 09:26:43,961 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:43,962 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 09:26:43,962 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:43,962 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 09:26:43,962 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:26:43,962 INFO  L87              Difference]: Start difference. First operand 3220 states and 4546 transitions. Second operand  has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:44,364 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:44,364 INFO  L93              Difference]: Finished difference Result 5643 states and 8062 transitions.
[2025-03-08 09:26:44,364 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 09:26:44,365 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 248
[2025-03-08 09:26:44,365 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:44,368 INFO  L225             Difference]: With dead ends: 5643
[2025-03-08 09:26:44,368 INFO  L226             Difference]: Without dead ends: 3992
[2025-03-08 09:26:44,370 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2025-03-08 09:26:44,370 INFO  L435           NwaCegarLoop]: 807 mSDtfsCounter, 819 mSDsluCounter, 3325 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 4132 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:44,370 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 4132 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:26:44,371 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3992 states.
[2025-03-08 09:26:44,390 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3992 to 3252.
[2025-03-08 09:26:44,392 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3252 states, 3226 states have (on average 1.406695598264104) internal successors, (4538), 3226 states have internal predecessors, (4538), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:44,395 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3252 states to 3252 states and 4586 transitions.
[2025-03-08 09:26:44,395 INFO  L78                 Accepts]: Start accepts. Automaton has 3252 states and 4586 transitions. Word has length 248
[2025-03-08 09:26:44,395 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:44,395 INFO  L471      AbstractCegarLoop]: Abstraction has 3252 states and 4586 transitions.
[2025-03-08 09:26:44,395 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:44,395 INFO  L276                IsEmpty]: Start isEmpty. Operand 3252 states and 4586 transitions.
[2025-03-08 09:26:44,397 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 249
[2025-03-08 09:26:44,397 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:44,397 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:44,397 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2025-03-08 09:26:44,397 INFO  L396      AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:44,398 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:44,398 INFO  L85        PathProgramCache]: Analyzing trace with hash -1253447890, now seen corresponding path program 1 times
[2025-03-08 09:26:44,398 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:44,398 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274132450]
[2025-03-08 09:26:44,398 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:44,398 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:44,420 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes.
[2025-03-08 09:26:44,516 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements.
[2025-03-08 09:26:44,516 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:44,516 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:44,854 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:44,854 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:44,854 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274132450]
[2025-03-08 09:26:44,854 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274132450] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:44,854 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:44,854 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 09:26:44,854 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190989125]
[2025-03-08 09:26:44,854 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:44,854 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 09:26:44,854 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:44,855 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 09:26:44,855 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:26:44,855 INFO  L87              Difference]: Start difference. First operand 3252 states and 4586 transitions. Second operand  has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:45,329 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:45,329 INFO  L93              Difference]: Finished difference Result 4795 states and 6823 transitions.
[2025-03-08 09:26:45,329 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 09:26:45,329 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 248
[2025-03-08 09:26:45,329 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:45,333 INFO  L225             Difference]: With dead ends: 4795
[2025-03-08 09:26:45,333 INFO  L226             Difference]: Without dead ends: 3346
[2025-03-08 09:26:45,334 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2025-03-08 09:26:45,334 INFO  L435           NwaCegarLoop]: 754 mSDtfsCounter, 1308 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1310 SdHoareTripleChecker+Valid, 3729 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:45,335 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1310 Valid, 3729 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:26:45,336 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3346 states.
[2025-03-08 09:26:45,359 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 3268.
[2025-03-08 09:26:45,361 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3268 states, 3242 states have (on average 1.406539173349784) internal successors, (4560), 3242 states have internal predecessors, (4560), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:45,364 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3268 states to 3268 states and 4608 transitions.
[2025-03-08 09:26:45,364 INFO  L78                 Accepts]: Start accepts. Automaton has 3268 states and 4608 transitions. Word has length 248
[2025-03-08 09:26:45,365 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:45,365 INFO  L471      AbstractCegarLoop]: Abstraction has 3268 states and 4608 transitions.
[2025-03-08 09:26:45,365 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:45,365 INFO  L276                IsEmpty]: Start isEmpty. Operand 3268 states and 4608 transitions.
[2025-03-08 09:26:45,367 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 249
[2025-03-08 09:26:45,367 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:45,367 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:45,368 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2025-03-08 09:26:45,368 INFO  L396      AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:45,368 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:45,368 INFO  L85        PathProgramCache]: Analyzing trace with hash 225074643, now seen corresponding path program 1 times
[2025-03-08 09:26:45,368 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:45,368 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515131734]
[2025-03-08 09:26:45,369 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:45,369 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:45,393 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes.
[2025-03-08 09:26:45,474 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements.
[2025-03-08 09:26:45,474 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:45,474 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:45,691 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:45,691 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:45,691 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515131734]
[2025-03-08 09:26:45,692 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515131734] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:45,692 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:45,692 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 09:26:45,692 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588082754]
[2025-03-08 09:26:45,692 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:45,692 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 09:26:45,692 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:45,692 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 09:26:45,692 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:26:45,692 INFO  L87              Difference]: Start difference. First operand 3268 states and 4608 transitions. Second operand  has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:46,029 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:46,029 INFO  L93              Difference]: Finished difference Result 4779 states and 6797 transitions.
[2025-03-08 09:26:46,029 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 09:26:46,029 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 248
[2025-03-08 09:26:46,030 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:46,032 INFO  L225             Difference]: With dead ends: 4779
[2025-03-08 09:26:46,032 INFO  L226             Difference]: Without dead ends: 3330
[2025-03-08 09:26:46,033 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-03-08 09:26:46,033 INFO  L435           NwaCegarLoop]: 833 mSDtfsCounter, 292 mSDsluCounter, 3305 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 4138 SdHoareTripleChecker+Invalid, 894 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:46,033 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 4138 Invalid, 894 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 09:26:46,034 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3330 states.
[2025-03-08 09:26:46,052 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3330 to 3284.
[2025-03-08 09:26:46,053 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3284 states, 3258 states have (on average 1.4063842848373236) internal successors, (4582), 3258 states have internal predecessors, (4582), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:46,056 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3284 states to 3284 states and 4630 transitions.
[2025-03-08 09:26:46,056 INFO  L78                 Accepts]: Start accepts. Automaton has 3284 states and 4630 transitions. Word has length 248
[2025-03-08 09:26:46,056 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:46,056 INFO  L471      AbstractCegarLoop]: Abstraction has 3284 states and 4630 transitions.
[2025-03-08 09:26:46,056 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 40.166666666666664) internal successors, (241), 6 states have internal predecessors, (241), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:46,057 INFO  L276                IsEmpty]: Start isEmpty. Operand 3284 states and 4630 transitions.
[2025-03-08 09:26:46,058 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 250
[2025-03-08 09:26:46,059 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:46,059 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:46,059 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47
[2025-03-08 09:26:46,059 INFO  L396      AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:46,059 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:46,059 INFO  L85        PathProgramCache]: Analyzing trace with hash 883057733, now seen corresponding path program 1 times
[2025-03-08 09:26:46,059 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:46,059 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440651979]
[2025-03-08 09:26:46,060 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:46,060 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:46,082 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes.
[2025-03-08 09:26:46,153 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements.
[2025-03-08 09:26:46,153 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:46,153 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:46,561 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:46,561 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:46,561 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440651979]
[2025-03-08 09:26:46,561 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440651979] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:46,561 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:46,561 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 09:26:46,561 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999045204]
[2025-03-08 09:26:46,561 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:46,562 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 09:26:46,562 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:46,562 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 09:26:46,562 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2025-03-08 09:26:46,562 INFO  L87              Difference]: Start difference. First operand 3284 states and 4630 transitions. Second operand  has 10 states, 10 states have (on average 24.2) internal successors, (242), 10 states have internal predecessors, (242), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:26:47,133 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:47,133 INFO  L93              Difference]: Finished difference Result 5233 states and 7441 transitions.
[2025-03-08 09:26:47,133 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 09:26:47,133 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 24.2) internal successors, (242), 10 states have internal predecessors, (242), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 249
[2025-03-08 09:26:47,134 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:47,136 INFO  L225             Difference]: With dead ends: 5233
[2025-03-08 09:26:47,136 INFO  L226             Difference]: Without dead ends: 3284
[2025-03-08 09:26:47,137 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210
[2025-03-08 09:26:47,137 INFO  L435           NwaCegarLoop]: 767 mSDtfsCounter, 1758 mSDsluCounter, 4033 mSDsCounter, 0 mSdLazyCounter, 1433 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1758 SdHoareTripleChecker+Valid, 4800 SdHoareTripleChecker+Invalid, 1436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:47,138 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1758 Valid, 4800 Invalid, 1436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1433 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 09:26:47,139 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3284 states.
[2025-03-08 09:26:47,158 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3284 to 3284.
[2025-03-08 09:26:47,159 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3284 states, 3258 states have (on average 1.401473296500921) internal successors, (4566), 3258 states have internal predecessors, (4566), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:47,162 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3284 states to 3284 states and 4614 transitions.
[2025-03-08 09:26:47,162 INFO  L78                 Accepts]: Start accepts. Automaton has 3284 states and 4614 transitions. Word has length 249
[2025-03-08 09:26:47,162 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:47,162 INFO  L471      AbstractCegarLoop]: Abstraction has 3284 states and 4614 transitions.
[2025-03-08 09:26:47,162 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 24.2) internal successors, (242), 10 states have internal predecessors, (242), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:26:47,162 INFO  L276                IsEmpty]: Start isEmpty. Operand 3284 states and 4614 transitions.
[2025-03-08 09:26:47,164 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 251
[2025-03-08 09:26:47,164 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:47,164 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:47,164 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48
[2025-03-08 09:26:47,164 INFO  L396      AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:47,165 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:47,165 INFO  L85        PathProgramCache]: Analyzing trace with hash -52967138, now seen corresponding path program 1 times
[2025-03-08 09:26:47,165 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:47,165 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777417653]
[2025-03-08 09:26:47,165 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:47,165 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:47,186 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes.
[2025-03-08 09:26:47,279 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements.
[2025-03-08 09:26:47,279 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:47,279 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:47,459 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:47,459 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:47,459 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777417653]
[2025-03-08 09:26:47,459 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777417653] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:47,459 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:47,459 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 09:26:47,459 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953775112]
[2025-03-08 09:26:47,459 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:47,460 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 09:26:47,460 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:47,460 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 09:26:47,460 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:26:47,460 INFO  L87              Difference]: Start difference. First operand 3284 states and 4614 transitions. Second operand  has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:47,845 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:47,845 INFO  L93              Difference]: Finished difference Result 5691 states and 8100 transitions.
[2025-03-08 09:26:47,845 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 09:26:47,845 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 250
[2025-03-08 09:26:47,845 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:47,849 INFO  L225             Difference]: With dead ends: 5691
[2025-03-08 09:26:47,849 INFO  L226             Difference]: Without dead ends: 4040
[2025-03-08 09:26:47,850 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2025-03-08 09:26:47,850 INFO  L435           NwaCegarLoop]: 808 mSDtfsCounter, 812 mSDsluCounter, 3229 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 4037 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:47,851 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 4037 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 897 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 09:26:47,852 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4040 states.
[2025-03-08 09:26:47,872 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4040 to 3316.
[2025-03-08 09:26:47,874 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3316 states, 3290 states have (on average 1.4012158054711246) internal successors, (4610), 3290 states have internal predecessors, (4610), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:47,876 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3316 states to 3316 states and 4658 transitions.
[2025-03-08 09:26:47,877 INFO  L78                 Accepts]: Start accepts. Automaton has 3316 states and 4658 transitions. Word has length 250
[2025-03-08 09:26:47,877 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:47,877 INFO  L471      AbstractCegarLoop]: Abstraction has 3316 states and 4658 transitions.
[2025-03-08 09:26:47,877 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 40.5) internal successors, (243), 6 states have internal predecessors, (243), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:47,877 INFO  L276                IsEmpty]: Start isEmpty. Operand 3316 states and 4658 transitions.
[2025-03-08 09:26:47,879 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 252
[2025-03-08 09:26:47,879 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:47,879 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:47,879 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49
[2025-03-08 09:26:47,879 INFO  L396      AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:47,879 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:47,880 INFO  L85        PathProgramCache]: Analyzing trace with hash 858586810, now seen corresponding path program 1 times
[2025-03-08 09:26:47,880 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:47,880 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918427659]
[2025-03-08 09:26:47,880 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:47,880 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:47,901 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes.
[2025-03-08 09:26:47,972 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements.
[2025-03-08 09:26:47,972 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:47,972 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:48,505 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:48,505 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:48,505 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918427659]
[2025-03-08 09:26:48,505 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918427659] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:48,505 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:48,506 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 09:26:48,506 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926459908]
[2025-03-08 09:26:48,506 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:48,506 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 09:26:48,506 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:48,506 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 09:26:48,506 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2025-03-08 09:26:48,506 INFO  L87              Difference]: Start difference. First operand 3316 states and 4658 transitions. Second operand  has 10 states, 10 states have (on average 24.4) internal successors, (244), 10 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:49,155 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:49,155 INFO  L93              Difference]: Finished difference Result 5727 states and 8146 transitions.
[2025-03-08 09:26:49,156 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 09:26:49,156 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 24.4) internal successors, (244), 10 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 251
[2025-03-08 09:26:49,156 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:49,160 INFO  L225             Difference]: With dead ends: 5727
[2025-03-08 09:26:49,160 INFO  L226             Difference]: Without dead ends: 4056
[2025-03-08 09:26:49,161 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210
[2025-03-08 09:26:49,162 INFO  L435           NwaCegarLoop]: 798 mSDtfsCounter, 1783 mSDsluCounter, 4864 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1785 SdHoareTripleChecker+Valid, 5662 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:49,162 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1785 Valid, 5662 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 09:26:49,163 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4056 states.
[2025-03-08 09:26:49,186 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4056 to 3324.
[2025-03-08 09:26:49,187 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3324 states, 3298 states have (on average 1.4002425712553062) internal successors, (4618), 3298 states have internal predecessors, (4618), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:49,190 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3324 states to 3324 states and 4666 transitions.
[2025-03-08 09:26:49,190 INFO  L78                 Accepts]: Start accepts. Automaton has 3324 states and 4666 transitions. Word has length 251
[2025-03-08 09:26:49,190 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:49,190 INFO  L471      AbstractCegarLoop]: Abstraction has 3324 states and 4666 transitions.
[2025-03-08 09:26:49,190 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 24.4) internal successors, (244), 10 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:49,190 INFO  L276                IsEmpty]: Start isEmpty. Operand 3324 states and 4666 transitions.
[2025-03-08 09:26:49,192 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 252
[2025-03-08 09:26:49,192 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:49,193 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:49,193 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50
[2025-03-08 09:26:49,193 INFO  L396      AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:49,193 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:49,193 INFO  L85        PathProgramCache]: Analyzing trace with hash 289953946, now seen corresponding path program 1 times
[2025-03-08 09:26:49,193 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:49,193 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539761688]
[2025-03-08 09:26:49,193 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:49,193 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:49,216 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes.
[2025-03-08 09:26:49,298 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements.
[2025-03-08 09:26:49,298 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:49,298 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:49,628 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:49,628 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:49,628 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539761688]
[2025-03-08 09:26:49,628 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539761688] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:49,628 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:49,628 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 09:26:49,628 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240081343]
[2025-03-08 09:26:49,628 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:49,629 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 09:26:49,629 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:49,629 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 09:26:49,629 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:26:49,629 INFO  L87              Difference]: Start difference. First operand 3324 states and 4666 transitions. Second operand  has 7 states, 7 states have (on average 34.857142857142854) internal successors, (244), 7 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:50,109 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:50,109 INFO  L93              Difference]: Finished difference Result 4861 states and 6888 transitions.
[2025-03-08 09:26:50,109 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 09:26:50,109 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 34.857142857142854) internal successors, (244), 7 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 251
[2025-03-08 09:26:50,110 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:50,113 INFO  L225             Difference]: With dead ends: 4861
[2025-03-08 09:26:50,113 INFO  L226             Difference]: Without dead ends: 3402
[2025-03-08 09:26:50,114 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2025-03-08 09:26:50,114 INFO  L435           NwaCegarLoop]: 753 mSDtfsCounter, 1459 mSDsluCounter, 2971 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1461 SdHoareTripleChecker+Valid, 3724 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:50,114 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1461 Valid, 3724 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:26:50,115 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3402 states.
[2025-03-08 09:26:50,137 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3340.
[2025-03-08 09:26:50,138 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3340 states, 3314 states have (on average 1.40012070006035) internal successors, (4640), 3314 states have internal predecessors, (4640), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:50,141 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3340 states to 3340 states and 4688 transitions.
[2025-03-08 09:26:50,141 INFO  L78                 Accepts]: Start accepts. Automaton has 3340 states and 4688 transitions. Word has length 251
[2025-03-08 09:26:50,141 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:50,141 INFO  L471      AbstractCegarLoop]: Abstraction has 3340 states and 4688 transitions.
[2025-03-08 09:26:50,142 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 34.857142857142854) internal successors, (244), 7 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:50,142 INFO  L276                IsEmpty]: Start isEmpty. Operand 3340 states and 4688 transitions.
[2025-03-08 09:26:50,143 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 252
[2025-03-08 09:26:50,143 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:50,144 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:50,144 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51
[2025-03-08 09:26:50,144 INFO  L396      AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:50,144 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:50,144 INFO  L85        PathProgramCache]: Analyzing trace with hash 724100265, now seen corresponding path program 1 times
[2025-03-08 09:26:50,144 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:50,144 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598676327]
[2025-03-08 09:26:50,144 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:50,144 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:50,168 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes.
[2025-03-08 09:26:50,259 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements.
[2025-03-08 09:26:50,259 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:50,259 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:50,841 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:50,841 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:50,841 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598676327]
[2025-03-08 09:26:50,842 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598676327] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:50,842 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:50,842 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-03-08 09:26:50,842 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461170329]
[2025-03-08 09:26:50,842 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:50,842 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-03-08 09:26:50,842 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:50,842 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-03-08 09:26:50,842 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132
[2025-03-08 09:26:50,843 INFO  L87              Difference]: Start difference. First operand 3340 states and 4688 transitions. Second operand  has 12 states, 12 states have (on average 20.333333333333332) internal successors, (244), 12 states have internal predecessors, (244), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:26:51,587 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:51,587 INFO  L93              Difference]: Finished difference Result 5331 states and 7554 transitions.
[2025-03-08 09:26:51,587 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-03-08 09:26:51,587 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 20.333333333333332) internal successors, (244), 12 states have internal predecessors, (244), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 251
[2025-03-08 09:26:51,587 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:51,590 INFO  L225             Difference]: With dead ends: 5331
[2025-03-08 09:26:51,590 INFO  L226             Difference]: Without dead ends: 3380
[2025-03-08 09:26:51,591 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342
[2025-03-08 09:26:51,592 INFO  L435           NwaCegarLoop]: 758 mSDtfsCounter, 1775 mSDsluCounter, 4836 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1775 SdHoareTripleChecker+Valid, 5594 SdHoareTripleChecker+Invalid, 1762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:51,592 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1775 Valid, 5594 Invalid, 1762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 09:26:51,593 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3380 states.
[2025-03-08 09:26:51,611 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3380 to 3356.
[2025-03-08 09:26:51,613 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3356 states, 3330 states have (on average 1.3981981981981981) internal successors, (4656), 3330 states have internal predecessors, (4656), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:51,615 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3356 states to 3356 states and 4704 transitions.
[2025-03-08 09:26:51,616 INFO  L78                 Accepts]: Start accepts. Automaton has 3356 states and 4704 transitions. Word has length 251
[2025-03-08 09:26:51,616 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:51,616 INFO  L471      AbstractCegarLoop]: Abstraction has 3356 states and 4704 transitions.
[2025-03-08 09:26:51,616 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 20.333333333333332) internal successors, (244), 12 states have internal predecessors, (244), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:26:51,616 INFO  L276                IsEmpty]: Start isEmpty. Operand 3356 states and 4704 transitions.
[2025-03-08 09:26:51,618 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 252
[2025-03-08 09:26:51,618 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:51,618 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:51,618 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52
[2025-03-08 09:26:51,618 INFO  L396      AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:51,618 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:51,618 INFO  L85        PathProgramCache]: Analyzing trace with hash -1837877923, now seen corresponding path program 1 times
[2025-03-08 09:26:51,618 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:51,618 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872907735]
[2025-03-08 09:26:51,618 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:51,619 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:51,641 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes.
[2025-03-08 09:26:51,740 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements.
[2025-03-08 09:26:51,740 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:51,740 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:51,927 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:51,927 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:51,927 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872907735]
[2025-03-08 09:26:51,927 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872907735] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:51,927 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:51,927 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 09:26:51,927 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402077937]
[2025-03-08 09:26:51,927 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:51,927 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 09:26:51,927 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:51,928 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 09:26:51,928 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:26:51,928 INFO  L87              Difference]: Start difference. First operand 3356 states and 4704 transitions. Second operand  has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:52,306 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:52,307 INFO  L93              Difference]: Finished difference Result 4865 states and 6882 transitions.
[2025-03-08 09:26:52,307 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 09:26:52,307 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 251
[2025-03-08 09:26:52,307 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:52,309 INFO  L225             Difference]: With dead ends: 4865
[2025-03-08 09:26:52,309 INFO  L226             Difference]: Without dead ends: 3402
[2025-03-08 09:26:52,310 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56
[2025-03-08 09:26:52,311 INFO  L435           NwaCegarLoop]: 995 mSDtfsCounter, 283 mSDsluCounter, 3741 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 4736 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:52,311 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 4736 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-08 09:26:52,312 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3402 states.
[2025-03-08 09:26:52,336 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3372.
[2025-03-08 09:26:52,338 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3372 states, 3346 states have (on average 1.3980872683801555) internal successors, (4678), 3346 states have internal predecessors, (4678), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:52,341 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3372 states to 3372 states and 4726 transitions.
[2025-03-08 09:26:52,341 INFO  L78                 Accepts]: Start accepts. Automaton has 3372 states and 4726 transitions. Word has length 251
[2025-03-08 09:26:52,342 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:52,342 INFO  L471      AbstractCegarLoop]: Abstraction has 3372 states and 4726 transitions.
[2025-03-08 09:26:52,342 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 40.666666666666664) internal successors, (244), 6 states have internal predecessors, (244), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:52,342 INFO  L276                IsEmpty]: Start isEmpty. Operand 3372 states and 4726 transitions.
[2025-03-08 09:26:52,344 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-03-08 09:26:52,344 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:52,344 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:52,344 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53
[2025-03-08 09:26:52,344 INFO  L396      AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:52,344 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:52,344 INFO  L85        PathProgramCache]: Analyzing trace with hash 427018479, now seen corresponding path program 1 times
[2025-03-08 09:26:52,344 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:52,344 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089637184]
[2025-03-08 09:26:52,344 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:52,344 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:52,367 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-03-08 09:26:52,457 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-03-08 09:26:52,457 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:52,457 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:52,929 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:52,929 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:52,929 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089637184]
[2025-03-08 09:26:52,929 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089637184] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:52,929 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:52,929 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 09:26:52,929 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820473330]
[2025-03-08 09:26:52,929 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:52,930 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 09:26:52,930 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:52,930 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 09:26:52,930 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2025-03-08 09:26:52,930 INFO  L87              Difference]: Start difference. First operand 3372 states and 4726 transitions. Second operand  has 10 states, 10 states have (on average 24.5) internal successors, (245), 10 states have internal predecessors, (245), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:26:53,436 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:53,436 INFO  L93              Difference]: Finished difference Result 5319 states and 7522 transitions.
[2025-03-08 09:26:53,436 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 09:26:53,436 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 24.5) internal successors, (245), 10 states have internal predecessors, (245), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 252
[2025-03-08 09:26:53,437 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:53,439 INFO  L225             Difference]: With dead ends: 5319
[2025-03-08 09:26:53,439 INFO  L226             Difference]: Without dead ends: 3372
[2025-03-08 09:26:53,440 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210
[2025-03-08 09:26:53,440 INFO  L435           NwaCegarLoop]: 766 mSDtfsCounter, 2496 mSDsluCounter, 3351 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2496 SdHoareTripleChecker+Valid, 4117 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:53,440 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2496 Valid, 4117 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:26:53,441 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3372 states.
[2025-03-08 09:26:53,459 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3372 to 3372.
[2025-03-08 09:26:53,460 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3372 states, 3346 states have (on average 1.3956963538553497) internal successors, (4670), 3346 states have internal predecessors, (4670), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:53,463 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3372 states to 3372 states and 4718 transitions.
[2025-03-08 09:26:53,463 INFO  L78                 Accepts]: Start accepts. Automaton has 3372 states and 4718 transitions. Word has length 252
[2025-03-08 09:26:53,463 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:53,463 INFO  L471      AbstractCegarLoop]: Abstraction has 3372 states and 4718 transitions.
[2025-03-08 09:26:53,463 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 24.5) internal successors, (245), 10 states have internal predecessors, (245), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:26:53,463 INFO  L276                IsEmpty]: Start isEmpty. Operand 3372 states and 4718 transitions.
[2025-03-08 09:26:53,465 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 254
[2025-03-08 09:26:53,465 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:53,465 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:53,465 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54
[2025-03-08 09:26:53,465 INFO  L396      AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:53,465 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:53,465 INFO  L85        PathProgramCache]: Analyzing trace with hash 255573764, now seen corresponding path program 1 times
[2025-03-08 09:26:53,465 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:53,465 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337094257]
[2025-03-08 09:26:53,466 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:53,466 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:53,487 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes.
[2025-03-08 09:26:53,511 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements.
[2025-03-08 09:26:53,512 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:53,512 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:53,674 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:53,675 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:53,675 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337094257]
[2025-03-08 09:26:53,675 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337094257] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:53,675 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:53,675 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:26:53,675 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607509477]
[2025-03-08 09:26:53,675 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:53,675 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:26:53,675 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:53,675 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:26:53,676 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:26:53,676 INFO  L87              Difference]: Start difference. First operand 3372 states and 4718 transitions. Second operand  has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:53,926 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:53,926 INFO  L93              Difference]: Finished difference Result 5311 states and 7496 transitions.
[2025-03-08 09:26:53,927 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:26:53,927 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 253
[2025-03-08 09:26:53,927 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:53,929 INFO  L225             Difference]: With dead ends: 5311
[2025-03-08 09:26:53,929 INFO  L226             Difference]: Without dead ends: 3412
[2025-03-08 09:26:53,931 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:26:53,931 INFO  L435           NwaCegarLoop]: 817 mSDtfsCounter, 2 mSDsluCounter, 2440 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3257 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:53,931 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3257 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 09:26:53,932 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3412 states.
[2025-03-08 09:26:53,950 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3412 to 3404.
[2025-03-08 09:26:53,951 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3404 states, 3378 states have (on average 1.3943161634103018) internal successors, (4710), 3378 states have internal predecessors, (4710), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:53,954 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3404 states to 3404 states and 4758 transitions.
[2025-03-08 09:26:53,954 INFO  L78                 Accepts]: Start accepts. Automaton has 3404 states and 4758 transitions. Word has length 253
[2025-03-08 09:26:53,954 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:53,954 INFO  L471      AbstractCegarLoop]: Abstraction has 3404 states and 4758 transitions.
[2025-03-08 09:26:53,954 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:53,955 INFO  L276                IsEmpty]: Start isEmpty. Operand 3404 states and 4758 transitions.
[2025-03-08 09:26:53,956 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 254
[2025-03-08 09:26:53,957 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:53,957 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:53,957 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55
[2025-03-08 09:26:53,957 INFO  L396      AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:53,957 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:53,957 INFO  L85        PathProgramCache]: Analyzing trace with hash -284685480, now seen corresponding path program 1 times
[2025-03-08 09:26:53,957 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:53,957 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394421574]
[2025-03-08 09:26:53,957 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:53,957 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:53,981 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes.
[2025-03-08 09:26:54,059 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements.
[2025-03-08 09:26:54,059 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:54,059 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:54,203 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:54,203 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:54,203 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394421574]
[2025-03-08 09:26:54,203 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394421574] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:54,203 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:54,203 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 09:26:54,203 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488293553]
[2025-03-08 09:26:54,203 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:54,204 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 09:26:54,204 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:54,204 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 09:26:54,204 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:26:54,204 INFO  L87              Difference]: Start difference. First operand 3404 states and 4758 transitions. Second operand  has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:54,399 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:54,399 INFO  L93              Difference]: Finished difference Result 5446 states and 7673 transitions.
[2025-03-08 09:26:54,399 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 09:26:54,399 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 253
[2025-03-08 09:26:54,400 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:54,402 INFO  L225             Difference]: With dead ends: 5446
[2025-03-08 09:26:54,402 INFO  L226             Difference]: Without dead ends: 3440
[2025-03-08 09:26:54,403 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:26:54,404 INFO  L435           NwaCegarLoop]: 819 mSDtfsCounter, 0 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2451 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:54,404 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2451 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 09:26:54,405 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3440 states.
[2025-03-08 09:26:54,440 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3440 to 3440.
[2025-03-08 09:26:54,442 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3440 states, 3414 states have (on average 1.390158172231986) internal successors, (4746), 3414 states have internal predecessors, (4746), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:54,444 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3440 states to 3440 states and 4794 transitions.
[2025-03-08 09:26:54,445 INFO  L78                 Accepts]: Start accepts. Automaton has 3440 states and 4794 transitions. Word has length 253
[2025-03-08 09:26:54,445 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:54,445 INFO  L471      AbstractCegarLoop]: Abstraction has 3440 states and 4794 transitions.
[2025-03-08 09:26:54,445 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:54,445 INFO  L276                IsEmpty]: Start isEmpty. Operand 3440 states and 4794 transitions.
[2025-03-08 09:26:54,447 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 254
[2025-03-08 09:26:54,447 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:54,447 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:54,447 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56
[2025-03-08 09:26:54,447 INFO  L396      AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:54,447 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:54,447 INFO  L85        PathProgramCache]: Analyzing trace with hash -651086231, now seen corresponding path program 1 times
[2025-03-08 09:26:54,447 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:54,447 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939196378]
[2025-03-08 09:26:54,448 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:54,448 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:54,470 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes.
[2025-03-08 09:26:54,567 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements.
[2025-03-08 09:26:54,567 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:54,567 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:54,671 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:54,671 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:54,671 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939196378]
[2025-03-08 09:26:54,672 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939196378] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:54,672 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:54,672 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:26:54,672 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250313054]
[2025-03-08 09:26:54,672 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:54,672 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:26:54,672 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:54,672 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:26:54,672 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:26:54,672 INFO  L87              Difference]: Start difference. First operand 3440 states and 4794 transitions. Second operand  has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:54,908 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:54,908 INFO  L93              Difference]: Finished difference Result 5611 states and 7865 transitions.
[2025-03-08 09:26:54,909 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:26:54,909 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 253
[2025-03-08 09:26:54,909 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:54,912 INFO  L225             Difference]: With dead ends: 5611
[2025-03-08 09:26:54,912 INFO  L226             Difference]: Without dead ends: 3464
[2025-03-08 09:26:54,913 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:26:54,913 INFO  L435           NwaCegarLoop]: 813 mSDtfsCounter, 894 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 2437 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:54,913 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 2437 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 09:26:54,914 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3464 states.
[2025-03-08 09:26:54,932 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3464 to 3452.
[2025-03-08 09:26:54,934 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3452 states, 3426 states have (on average 1.3887915936952715) internal successors, (4758), 3426 states have internal predecessors, (4758), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:54,936 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 4806 transitions.
[2025-03-08 09:26:54,937 INFO  L78                 Accepts]: Start accepts. Automaton has 3452 states and 4806 transitions. Word has length 253
[2025-03-08 09:26:54,937 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:54,937 INFO  L471      AbstractCegarLoop]: Abstraction has 3452 states and 4806 transitions.
[2025-03-08 09:26:54,937 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 49.2) internal successors, (246), 5 states have internal predecessors, (246), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:54,937 INFO  L276                IsEmpty]: Start isEmpty. Operand 3452 states and 4806 transitions.
[2025-03-08 09:26:54,939 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 255
[2025-03-08 09:26:54,939 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:54,939 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:54,939 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57
[2025-03-08 09:26:54,939 INFO  L396      AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:54,939 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:54,939 INFO  L85        PathProgramCache]: Analyzing trace with hash 139497931, now seen corresponding path program 1 times
[2025-03-08 09:26:54,939 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:54,939 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126120401]
[2025-03-08 09:26:54,939 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:54,939 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:54,961 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes.
[2025-03-08 09:26:55,051 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements.
[2025-03-08 09:26:55,052 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:55,052 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:55,519 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:55,519 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:55,519 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126120401]
[2025-03-08 09:26:55,519 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126120401] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:55,519 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:55,519 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 09:26:55,519 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779751699]
[2025-03-08 09:26:55,519 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:55,519 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 09:26:55,519 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:55,520 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 09:26:55,520 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2025-03-08 09:26:55,520 INFO  L87              Difference]: Start difference. First operand 3452 states and 4806 transitions. Second operand  has 10 states, 10 states have (on average 24.7) internal successors, (247), 10 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:56,133 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:56,133 INFO  L93              Difference]: Finished difference Result 5901 states and 8335 transitions.
[2025-03-08 09:26:56,134 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 09:26:56,134 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 24.7) internal successors, (247), 10 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 254
[2025-03-08 09:26:56,134 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:56,137 INFO  L225             Difference]: With dead ends: 5901
[2025-03-08 09:26:56,137 INFO  L226             Difference]: Without dead ends: 4212
[2025-03-08 09:26:56,139 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210
[2025-03-08 09:26:56,139 INFO  L435           NwaCegarLoop]: 798 mSDtfsCounter, 1775 mSDsluCounter, 4869 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1777 SdHoareTripleChecker+Valid, 5667 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:56,139 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1777 Valid, 5667 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 09:26:56,140 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4212 states.
[2025-03-08 09:26:56,160 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4212 to 3464.
[2025-03-08 09:26:56,162 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3464 states, 3438 states have (on average 1.3885980221058756) internal successors, (4774), 3438 states have internal predecessors, (4774), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:56,164 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3464 states to 3464 states and 4822 transitions.
[2025-03-08 09:26:56,164 INFO  L78                 Accepts]: Start accepts. Automaton has 3464 states and 4822 transitions. Word has length 254
[2025-03-08 09:26:56,164 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:56,164 INFO  L471      AbstractCegarLoop]: Abstraction has 3464 states and 4822 transitions.
[2025-03-08 09:26:56,165 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 24.7) internal successors, (247), 10 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:56,165 INFO  L276                IsEmpty]: Start isEmpty. Operand 3464 states and 4822 transitions.
[2025-03-08 09:26:56,166 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 255
[2025-03-08 09:26:56,166 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:56,166 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:56,167 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58
[2025-03-08 09:26:56,167 INFO  L396      AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:56,167 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:56,167 INFO  L85        PathProgramCache]: Analyzing trace with hash 431512136, now seen corresponding path program 1 times
[2025-03-08 09:26:56,167 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:56,167 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778376574]
[2025-03-08 09:26:56,167 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:56,167 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:56,189 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes.
[2025-03-08 09:26:56,213 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements.
[2025-03-08 09:26:56,213 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:56,213 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:56,357 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:56,357 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:56,357 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778376574]
[2025-03-08 09:26:56,357 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778376574] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:56,357 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:56,357 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:26:56,357 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838274713]
[2025-03-08 09:26:56,357 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:56,357 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:26:56,357 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:56,358 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:26:56,358 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:26:56,358 INFO  L87              Difference]: Start difference. First operand 3464 states and 4822 transitions. Second operand  has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:56,608 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:56,608 INFO  L93              Difference]: Finished difference Result 5533 states and 7765 transitions.
[2025-03-08 09:26:56,608 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:26:56,609 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 254
[2025-03-08 09:26:56,609 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:56,611 INFO  L225             Difference]: With dead ends: 5533
[2025-03-08 09:26:56,611 INFO  L226             Difference]: Without dead ends: 3512
[2025-03-08 09:26:56,613 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:26:56,613 INFO  L435           NwaCegarLoop]: 817 mSDtfsCounter, 2 mSDsluCounter, 2441 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3258 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:56,613 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3258 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 09:26:56,614 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3512 states.
[2025-03-08 09:26:56,637 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3512 to 3500.
[2025-03-08 09:26:56,638 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3500 states, 3474 states have (on average 1.3845710995970064) internal successors, (4810), 3474 states have internal predecessors, (4810), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:56,641 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3500 states to 3500 states and 4858 transitions.
[2025-03-08 09:26:56,641 INFO  L78                 Accepts]: Start accepts. Automaton has 3500 states and 4858 transitions. Word has length 254
[2025-03-08 09:26:56,641 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:56,641 INFO  L471      AbstractCegarLoop]: Abstraction has 3500 states and 4858 transitions.
[2025-03-08 09:26:56,641 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:56,641 INFO  L276                IsEmpty]: Start isEmpty. Operand 3500 states and 4858 transitions.
[2025-03-08 09:26:56,643 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 255
[2025-03-08 09:26:56,643 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:56,643 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:56,643 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59
[2025-03-08 09:26:56,643 INFO  L396      AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:56,644 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:56,644 INFO  L85        PathProgramCache]: Analyzing trace with hash 846317686, now seen corresponding path program 1 times
[2025-03-08 09:26:56,644 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:56,644 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888260497]
[2025-03-08 09:26:56,644 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:56,644 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:56,668 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes.
[2025-03-08 09:26:56,748 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements.
[2025-03-08 09:26:56,749 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:56,749 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:56,895 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:56,896 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:56,896 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888260497]
[2025-03-08 09:26:56,896 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888260497] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:56,896 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:56,896 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 09:26:56,896 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176598973]
[2025-03-08 09:26:56,896 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:56,896 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 09:26:56,896 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:56,897 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 09:26:56,897 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:26:56,897 INFO  L87              Difference]: Start difference. First operand 3500 states and 4858 transitions. Second operand  has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:57,086 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:57,087 INFO  L93              Difference]: Finished difference Result 5707 states and 7969 transitions.
[2025-03-08 09:26:57,087 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 09:26:57,087 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 254
[2025-03-08 09:26:57,087 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:57,090 INFO  L225             Difference]: With dead ends: 5707
[2025-03-08 09:26:57,090 INFO  L226             Difference]: Without dead ends: 3536
[2025-03-08 09:26:57,091 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:26:57,092 INFO  L435           NwaCegarLoop]: 819 mSDtfsCounter, 0 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2451 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:57,092 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2451 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 09:26:57,093 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3536 states.
[2025-03-08 09:26:57,131 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3536 to 3536.
[2025-03-08 09:26:57,133 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3536 states, 3510 states have (on average 1.3806267806267807) internal successors, (4846), 3510 states have internal predecessors, (4846), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:57,136 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3536 states to 3536 states and 4894 transitions.
[2025-03-08 09:26:57,136 INFO  L78                 Accepts]: Start accepts. Automaton has 3536 states and 4894 transitions. Word has length 254
[2025-03-08 09:26:57,136 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:57,136 INFO  L471      AbstractCegarLoop]: Abstraction has 3536 states and 4894 transitions.
[2025-03-08 09:26:57,136 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 61.75) internal successors, (247), 4 states have internal predecessors, (247), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:57,136 INFO  L276                IsEmpty]: Start isEmpty. Operand 3536 states and 4894 transitions.
[2025-03-08 09:26:57,138 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 255
[2025-03-08 09:26:57,138 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:57,138 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:57,138 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60
[2025-03-08 09:26:57,138 INFO  L396      AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:57,138 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:57,139 INFO  L85        PathProgramCache]: Analyzing trace with hash 2131708517, now seen corresponding path program 1 times
[2025-03-08 09:26:57,139 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:57,139 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4462564]
[2025-03-08 09:26:57,139 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:57,139 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:57,161 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes.
[2025-03-08 09:26:57,248 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements.
[2025-03-08 09:26:57,248 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:57,248 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:57,843 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:57,843 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:57,843 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4462564]
[2025-03-08 09:26:57,843 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4462564] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:57,843 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:57,843 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-03-08 09:26:57,844 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918524918]
[2025-03-08 09:26:57,844 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:57,844 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-03-08 09:26:57,844 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:57,844 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-03-08 09:26:57,844 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132
[2025-03-08 09:26:57,844 INFO  L87              Difference]: Start difference. First operand 3536 states and 4894 transitions. Second operand  has 12 states, 12 states have (on average 20.583333333333332) internal successors, (247), 12 states have internal predecessors, (247), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:26:58,611 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:58,611 INFO  L93              Difference]: Finished difference Result 5540 states and 7756 transitions.
[2025-03-08 09:26:58,611 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-03-08 09:26:58,612 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 20.583333333333332) internal successors, (247), 12 states have internal predecessors, (247), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 254
[2025-03-08 09:26:58,612 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:58,615 INFO  L225             Difference]: With dead ends: 5540
[2025-03-08 09:26:58,615 INFO  L226             Difference]: Without dead ends: 3576
[2025-03-08 09:26:58,616 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342
[2025-03-08 09:26:58,617 INFO  L435           NwaCegarLoop]: 757 mSDtfsCounter, 2516 mSDsluCounter, 4818 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2516 SdHoareTripleChecker+Valid, 5575 SdHoareTripleChecker+Invalid, 1763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:58,617 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2516 Valid, 5575 Invalid, 1763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 09:26:58,618 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3576 states.
[2025-03-08 09:26:58,660 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3576 to 3552.
[2025-03-08 09:26:58,662 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3552 states, 3526 states have (on average 1.378899602949518) internal successors, (4862), 3526 states have internal predecessors, (4862), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:58,664 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3552 states to 3552 states and 4910 transitions.
[2025-03-08 09:26:58,665 INFO  L78                 Accepts]: Start accepts. Automaton has 3552 states and 4910 transitions. Word has length 254
[2025-03-08 09:26:58,665 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:58,665 INFO  L471      AbstractCegarLoop]: Abstraction has 3552 states and 4910 transitions.
[2025-03-08 09:26:58,665 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 20.583333333333332) internal successors, (247), 12 states have internal predecessors, (247), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:26:58,665 INFO  L276                IsEmpty]: Start isEmpty. Operand 3552 states and 4910 transitions.
[2025-03-08 09:26:58,667 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 256
[2025-03-08 09:26:58,667 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:58,667 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:58,667 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61
[2025-03-08 09:26:58,667 INFO  L396      AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:58,667 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:58,668 INFO  L85        PathProgramCache]: Analyzing trace with hash -191421924, now seen corresponding path program 1 times
[2025-03-08 09:26:58,668 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:58,668 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243010477]
[2025-03-08 09:26:58,668 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:58,668 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:58,692 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes.
[2025-03-08 09:26:58,770 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements.
[2025-03-08 09:26:58,771 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:58,771 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:26:59,152 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:26:59,152 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:26:59,152 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243010477]
[2025-03-08 09:26:59,152 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243010477] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:26:59,152 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:26:59,152 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 09:26:59,152 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554624694]
[2025-03-08 09:26:59,152 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:26:59,153 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 09:26:59,153 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:26:59,153 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 09:26:59,153 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:26:59,153 INFO  L87              Difference]: Start difference. First operand 3552 states and 4910 transitions. Second operand  has 7 states, 7 states have (on average 35.42857142857143) internal successors, (248), 7 states have internal predecessors, (248), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:59,586 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:26:59,587 INFO  L93              Difference]: Finished difference Result 5994 states and 8415 transitions.
[2025-03-08 09:26:59,587 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 09:26:59,587 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 35.42857142857143) internal successors, (248), 7 states have internal predecessors, (248), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 255
[2025-03-08 09:26:59,587 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:26:59,592 INFO  L225             Difference]: With dead ends: 5994
[2025-03-08 09:26:59,592 INFO  L226             Difference]: Without dead ends: 4292
[2025-03-08 09:26:59,595 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2025-03-08 09:26:59,595 INFO  L435           NwaCegarLoop]: 807 mSDtfsCounter, 803 mSDsluCounter, 3322 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 4129 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:26:59,595 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 4129 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:26:59,597 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4292 states.
[2025-03-08 09:26:59,628 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4292 to 3584.
[2025-03-08 09:26:59,631 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3584 states, 3558 states have (on average 1.3777403035413154) internal successors, (4902), 3558 states have internal predecessors, (4902), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:26:59,635 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 4950 transitions.
[2025-03-08 09:26:59,635 INFO  L78                 Accepts]: Start accepts. Automaton has 3584 states and 4950 transitions. Word has length 255
[2025-03-08 09:26:59,635 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:26:59,635 INFO  L471      AbstractCegarLoop]: Abstraction has 3584 states and 4950 transitions.
[2025-03-08 09:26:59,635 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 35.42857142857143) internal successors, (248), 7 states have internal predecessors, (248), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:26:59,635 INFO  L276                IsEmpty]: Start isEmpty. Operand 3584 states and 4950 transitions.
[2025-03-08 09:26:59,638 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 256
[2025-03-08 09:26:59,638 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:26:59,638 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:26:59,638 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62
[2025-03-08 09:26:59,639 INFO  L396      AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:26:59,639 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:26:59,639 INFO  L85        PathProgramCache]: Analyzing trace with hash 440975137, now seen corresponding path program 1 times
[2025-03-08 09:26:59,639 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:26:59,639 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123861519]
[2025-03-08 09:26:59,639 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:26:59,639 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:26:59,665 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes.
[2025-03-08 09:26:59,765 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements.
[2025-03-08 09:26:59,765 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:26:59,765 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:27:00,293 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:27:00,293 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:27:00,293 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123861519]
[2025-03-08 09:27:00,293 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123861519] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:27:00,293 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:27:00,293 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10
[2025-03-08 09:27:00,293 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079823222]
[2025-03-08 09:27:00,293 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:27:00,293 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-08 09:27:00,293 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:27:00,294 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-08 09:27:00,294 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90
[2025-03-08 09:27:00,294 INFO  L87              Difference]: Start difference. First operand 3584 states and 4950 transitions. Second operand  has 10 states, 10 states have (on average 24.8) internal successors, (248), 10 states have internal predecessors, (248), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:27:00,799 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:27:00,800 INFO  L93              Difference]: Finished difference Result 5536 states and 7730 transitions.
[2025-03-08 09:27:00,800 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-08 09:27:00,800 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 24.8) internal successors, (248), 10 states have internal predecessors, (248), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 255
[2025-03-08 09:27:00,800 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:27:00,803 INFO  L225             Difference]: With dead ends: 5536
[2025-03-08 09:27:00,803 INFO  L226             Difference]: Without dead ends: 3584
[2025-03-08 09:27:00,804 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210
[2025-03-08 09:27:00,805 INFO  L435           NwaCegarLoop]: 765 mSDtfsCounter, 2485 mSDsluCounter, 3347 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2485 SdHoareTripleChecker+Valid, 4112 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:27:00,805 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2485 Valid, 4112 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:27:00,806 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3584 states.
[2025-03-08 09:27:00,829 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3584 to 3584.
[2025-03-08 09:27:00,831 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3584 states, 3558 states have (on average 1.3732433951658234) internal successors, (4886), 3558 states have internal predecessors, (4886), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:27:00,833 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3584 states to 3584 states and 4934 transitions.
[2025-03-08 09:27:00,834 INFO  L78                 Accepts]: Start accepts. Automaton has 3584 states and 4934 transitions. Word has length 255
[2025-03-08 09:27:00,835 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:27:00,835 INFO  L471      AbstractCegarLoop]: Abstraction has 3584 states and 4934 transitions.
[2025-03-08 09:27:00,835 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 24.8) internal successors, (248), 10 states have internal predecessors, (248), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:27:00,835 INFO  L276                IsEmpty]: Start isEmpty. Operand 3584 states and 4934 transitions.
[2025-03-08 09:27:00,837 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 257
[2025-03-08 09:27:00,837 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:27:00,837 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:27:00,837 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63
[2025-03-08 09:27:00,837 INFO  L396      AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:27:00,837 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:27:00,837 INFO  L85        PathProgramCache]: Analyzing trace with hash 4106608, now seen corresponding path program 1 times
[2025-03-08 09:27:00,837 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:27:00,837 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474052686]
[2025-03-08 09:27:00,837 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:27:00,837 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:27:00,860 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes.
[2025-03-08 09:27:00,888 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements.
[2025-03-08 09:27:00,888 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:27:00,888 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:27:01,040 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:27:01,041 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:27:01,041 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474052686]
[2025-03-08 09:27:01,041 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474052686] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:27:01,041 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:27:01,041 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:27:01,041 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440304178]
[2025-03-08 09:27:01,041 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:27:01,041 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:27:01,041 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:27:01,041 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:27:01,041 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:27:01,042 INFO  L87              Difference]: Start difference. First operand 3584 states and 4934 transitions. Second operand  has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:27:01,292 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:27:01,292 INFO  L93              Difference]: Finished difference Result 5528 states and 7694 transitions.
[2025-03-08 09:27:01,293 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:27:01,293 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 256
[2025-03-08 09:27:01,293 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:27:01,296 INFO  L225             Difference]: With dead ends: 5528
[2025-03-08 09:27:01,296 INFO  L226             Difference]: Without dead ends: 3624
[2025-03-08 09:27:01,298 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:27:01,298 INFO  L435           NwaCegarLoop]: 816 mSDtfsCounter, 2 mSDsluCounter, 2437 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3253 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 09:27:01,298 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3253 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 09:27:01,300 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3624 states.
[2025-03-08 09:27:01,322 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3624 to 3616.
[2025-03-08 09:27:01,324 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3616 states, 3590 states have (on average 1.3721448467966575) internal successors, (4926), 3590 states have internal predecessors, (4926), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:27:01,326 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3616 states to 3616 states and 4974 transitions.
[2025-03-08 09:27:01,327 INFO  L78                 Accepts]: Start accepts. Automaton has 3616 states and 4974 transitions. Word has length 256
[2025-03-08 09:27:01,327 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:27:01,327 INFO  L471      AbstractCegarLoop]: Abstraction has 3616 states and 4974 transitions.
[2025-03-08 09:27:01,327 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:27:01,327 INFO  L276                IsEmpty]: Start isEmpty. Operand 3616 states and 4974 transitions.
[2025-03-08 09:27:01,329 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 257
[2025-03-08 09:27:01,329 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:27:01,329 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:27:01,329 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64
[2025-03-08 09:27:01,329 INFO  L396      AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:27:01,329 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:27:01,329 INFO  L85        PathProgramCache]: Analyzing trace with hash -1830020657, now seen corresponding path program 1 times
[2025-03-08 09:27:01,329 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:27:01,329 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309090865]
[2025-03-08 09:27:01,329 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:27:01,329 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:27:01,353 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes.
[2025-03-08 09:27:01,443 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements.
[2025-03-08 09:27:01,444 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:27:01,444 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:27:01,585 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:27:01,585 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:27:01,585 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309090865]
[2025-03-08 09:27:01,585 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309090865] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:27:01,585 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:27:01,585 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 09:27:01,585 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875815165]
[2025-03-08 09:27:01,585 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:27:01,586 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 09:27:01,586 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:27:01,586 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 09:27:01,586 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:27:01,586 INFO  L87              Difference]: Start difference. First operand 3616 states and 4974 transitions. Second operand  has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:27:01,778 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:27:01,778 INFO  L93              Difference]: Finished difference Result 5663 states and 7871 transitions.
[2025-03-08 09:27:01,778 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 09:27:01,778 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 256
[2025-03-08 09:27:01,778 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:27:01,781 INFO  L225             Difference]: With dead ends: 5663
[2025-03-08 09:27:01,781 INFO  L226             Difference]: Without dead ends: 3652
[2025-03-08 09:27:01,783 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:27:01,783 INFO  L435           NwaCegarLoop]: 818 mSDtfsCounter, 0 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2448 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 09:27:01,783 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2448 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 09:27:01,784 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3652 states.
[2025-03-08 09:27:01,807 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3652 to 3652.
[2025-03-08 09:27:01,809 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3652 states, 3626 states have (on average 1.368450082735797) internal successors, (4962), 3626 states have internal predecessors, (4962), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:27:01,812 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3652 states to 3652 states and 5010 transitions.
[2025-03-08 09:27:01,812 INFO  L78                 Accepts]: Start accepts. Automaton has 3652 states and 5010 transitions. Word has length 256
[2025-03-08 09:27:01,812 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:27:01,812 INFO  L471      AbstractCegarLoop]: Abstraction has 3652 states and 5010 transitions.
[2025-03-08 09:27:01,812 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:27:01,812 INFO  L276                IsEmpty]: Start isEmpty. Operand 3652 states and 5010 transitions.
[2025-03-08 09:27:01,814 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 257
[2025-03-08 09:27:01,814 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:27:01,814 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:27:01,815 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65
[2025-03-08 09:27:01,815 INFO  L396      AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:27:01,815 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:27:01,815 INFO  L85        PathProgramCache]: Analyzing trace with hash 1996041240, now seen corresponding path program 1 times
[2025-03-08 09:27:01,815 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:27:01,815 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68383343]
[2025-03-08 09:27:01,815 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:27:01,815 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:27:01,839 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes.
[2025-03-08 09:27:01,940 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements.
[2025-03-08 09:27:01,940 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:27:01,940 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:27:02,055 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:27:02,055 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:27:02,055 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68383343]
[2025-03-08 09:27:02,055 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68383343] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:27:02,055 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:27:02,055 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:27:02,055 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264096302]
[2025-03-08 09:27:02,055 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:27:02,055 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:27:02,055 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:27:02,056 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:27:02,056 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:27:02,056 INFO  L87              Difference]: Start difference. First operand 3652 states and 5010 transitions. Second operand  has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:27:02,316 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:27:02,316 INFO  L93              Difference]: Finished difference Result 5723 states and 7931 transitions.
[2025-03-08 09:27:02,317 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:27:02,317 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 256
[2025-03-08 09:27:02,317 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:27:02,321 INFO  L225             Difference]: With dead ends: 5723
[2025-03-08 09:27:02,321 INFO  L226             Difference]: Without dead ends: 3676
[2025-03-08 09:27:02,323 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:27:02,324 INFO  L435           NwaCegarLoop]: 812 mSDtfsCounter, 882 mSDsluCounter, 1622 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 2434 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-03-08 09:27:02,324 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 2434 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-03-08 09:27:02,325 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3676 states.
[2025-03-08 09:27:02,354 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 3664.
[2025-03-08 09:27:02,356 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3664 states, 3638 states have (on average 1.3672347443650357) internal successors, (4974), 3638 states have internal predecessors, (4974), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:27:02,360 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3664 states to 3664 states and 5022 transitions.
[2025-03-08 09:27:02,361 INFO  L78                 Accepts]: Start accepts. Automaton has 3664 states and 5022 transitions. Word has length 256
[2025-03-08 09:27:02,361 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:27:02,361 INFO  L471      AbstractCegarLoop]: Abstraction has 3664 states and 5022 transitions.
[2025-03-08 09:27:02,361 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:27:02,361 INFO  L276                IsEmpty]: Start isEmpty. Operand 3664 states and 5022 transitions.
[2025-03-08 09:27:02,364 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 257
[2025-03-08 09:27:02,364 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:27:02,364 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:27:02,364 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66
[2025-03-08 09:27:02,364 INFO  L396      AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:27:02,364 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:27:02,365 INFO  L85        PathProgramCache]: Analyzing trace with hash 156622657, now seen corresponding path program 1 times
[2025-03-08 09:27:02,365 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:27:02,365 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288522065]
[2025-03-08 09:27:02,365 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:27:02,365 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:27:02,392 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes.
[2025-03-08 09:27:02,495 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements.
[2025-03-08 09:27:02,496 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:27:02,496 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:27:02,881 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:27:02,881 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:27:02,881 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288522065]
[2025-03-08 09:27:02,881 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288522065] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:27:02,881 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:27:02,881 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 09:27:02,881 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252994559]
[2025-03-08 09:27:02,881 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:27:02,882 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 09:27:02,882 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:27:02,882 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 09:27:02,882 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:27:02,882 INFO  L87              Difference]: Start difference. First operand 3664 states and 5022 transitions. Second operand  has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:27:03,383 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:27:03,383 INFO  L93              Difference]: Finished difference Result 5262 states and 7298 transitions.
[2025-03-08 09:27:03,384 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 09:27:03,384 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 256
[2025-03-08 09:27:03,384 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:27:03,388 INFO  L225             Difference]: With dead ends: 5262
[2025-03-08 09:27:03,388 INFO  L226             Difference]: Without dead ends: 3726
[2025-03-08 09:27:03,390 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2025-03-08 09:27:03,391 INFO  L435           NwaCegarLoop]: 751 mSDtfsCounter, 1212 mSDsluCounter, 2975 mSDsCounter, 0 mSdLazyCounter, 1145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 3726 SdHoareTripleChecker+Invalid, 1147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:27:03,391 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 3726 Invalid, 1147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1145 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:27:03,393 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3726 states.
[2025-03-08 09:27:03,421 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3726 to 3680.
[2025-03-08 09:27:03,424 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3680 states, 3654 states have (on average 1.3672687465790914) internal successors, (4996), 3654 states have internal predecessors, (4996), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:27:03,428 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 5044 transitions.
[2025-03-08 09:27:03,428 INFO  L78                 Accepts]: Start accepts. Automaton has 3680 states and 5044 transitions. Word has length 256
[2025-03-08 09:27:03,428 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:27:03,428 INFO  L471      AbstractCegarLoop]: Abstraction has 3680 states and 5044 transitions.
[2025-03-08 09:27:03,428 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 35.57142857142857) internal successors, (249), 7 states have internal predecessors, (249), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2)
[2025-03-08 09:27:03,428 INFO  L276                IsEmpty]: Start isEmpty. Operand 3680 states and 5044 transitions.
[2025-03-08 09:27:03,431 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 257
[2025-03-08 09:27:03,431 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:27:03,431 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:27:03,431 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67
[2025-03-08 09:27:03,431 INFO  L396      AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:27:03,432 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:27:03,432 INFO  L85        PathProgramCache]: Analyzing trace with hash -1668387162, now seen corresponding path program 1 times
[2025-03-08 09:27:03,432 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:27:03,432 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386088494]
[2025-03-08 09:27:03,432 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:27:03,432 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:27:03,458 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes.
[2025-03-08 09:27:03,547 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements.
[2025-03-08 09:27:03,547 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:27:03,547 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:27:04,386 INFO  L134       CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2025-03-08 09:27:04,387 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:27:04,387 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386088494]
[2025-03-08 09:27:04,387 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386088494] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:27:04,387 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:27:04,387 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2025-03-08 09:27:04,387 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83080815]
[2025-03-08 09:27:04,387 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:27:04,387 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2025-03-08 09:27:04,387 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:27:04,388 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2025-03-08 09:27:04,388 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132
[2025-03-08 09:27:04,388 INFO  L87              Difference]: Start difference. First operand 3680 states and 5044 transitions. Second operand  has 12 states, 12 states have (on average 20.75) internal successors, (249), 12 states have internal predecessors, (249), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:27:05,322 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:27:05,322 INFO  L93              Difference]: Finished difference Result 5684 states and 7888 transitions.
[2025-03-08 09:27:05,322 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-03-08 09:27:05,323 INFO  L78                 Accepts]: Start accepts. Automaton has  has 12 states, 12 states have (on average 20.75) internal successors, (249), 12 states have internal predecessors, (249), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 256
[2025-03-08 09:27:05,323 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:27:05,327 INFO  L225             Difference]: With dead ends: 5684
[2025-03-08 09:27:05,327 INFO  L226             Difference]: Without dead ends: 3720
[2025-03-08 09:27:05,329 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342
[2025-03-08 09:27:05,329 INFO  L435           NwaCegarLoop]: 756 mSDtfsCounter, 2508 mSDsluCounter, 5472 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2508 SdHoareTripleChecker+Valid, 6228 SdHoareTripleChecker+Invalid, 1948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-08 09:27:05,329 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2508 Valid, 6228 Invalid, 1948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1944 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-08 09:27:05,331 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3720 states.
[2025-03-08 09:27:05,360 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3720 to 3696.
[2025-03-08 09:27:05,362 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3696 states, 3670 states have (on average 1.36566757493188) internal successors, (5012), 3670 states have internal predecessors, (5012), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24)
[2025-03-08 09:27:05,366 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3696 states to 3696 states and 5060 transitions.
[2025-03-08 09:27:05,367 INFO  L78                 Accepts]: Start accepts. Automaton has 3696 states and 5060 transitions. Word has length 256
[2025-03-08 09:27:05,367 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:27:05,367 INFO  L471      AbstractCegarLoop]: Abstraction has 3696 states and 5060 transitions.
[2025-03-08 09:27:05,367 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 20.75) internal successors, (249), 12 states have internal predecessors, (249), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)
[2025-03-08 09:27:05,367 INFO  L276                IsEmpty]: Start isEmpty. Operand 3696 states and 5060 transitions.
[2025-03-08 09:27:05,370 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 258
[2025-03-08 09:27:05,370 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:27:05,370 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 09:27:05,370 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68
[2025-03-08 09:27:05,370 INFO  L396      AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:27:05,370 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:27:05,370 INFO  L85        PathProgramCache]: Analyzing trace with hash 1875799944, now seen corresponding path program 1 times
[2025-03-08 09:27:05,370 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:27:05,370 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287687445]
[2025-03-08 09:27:05,370 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:27:05,370 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:27:05,396 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes.