./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2901.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.vis_arrays_am2901.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 4ad6c51ce95ad654c6ab63ce2f8a8f0599e297ad04e11ab2bf70b8e3bd88d357
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-e2fb8be-m
[2025-03-08 09:40:49,455 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-08 09:40:49,505 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2025-03-08 09:40:49,510 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-08 09:40:49,513 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-08 09:40:49,533 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-08 09:40:49,534 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-08 09:40:49,534 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-08 09:40:49,535 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-08 09:40:49,535 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-08 09:40:49,536 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-08 09:40:49,536 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-08 09:40:49,536 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-08 09:40:49,536 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-08 09:40:49,536 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-08 09:40:49,536 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-08 09:40:49,537 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-08 09:40:49,537 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-08 09:40:49,537 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-08 09:40:49,537 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-08 09:40:49,537 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-08 09:40:49,537 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-08 09:40:49,537 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-08 09:40:49,537 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-08 09:40:49,537 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-08 09:40:49,537 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-08 09:40:49,538 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-08 09:40:49,538 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-08 09:40:49,538 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-08 09:40:49,538 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 09:40:49,538 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-08 09:40:49,538 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-08 09:40:49,538 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-08 09:40:49,538 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-08 09:40:49,539 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-08 09:40:49,539 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-08 09:40:49,539 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-08 09:40:49,539 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-08 09:40:49,539 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-08 09:40:49,539 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-08 09:40:49,539 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 -> 4ad6c51ce95ad654c6ab63ce2f8a8f0599e297ad04e11ab2bf70b8e3bd88d357
[2025-03-08 09:40:49,770 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-08 09:40:49,778 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-08 09:40:49,779 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-08 09:40:49,780 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-08 09:40:49,780 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-08 09:40:49,783 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2901.c
[2025-03-08 09:40:50,954 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3547a929/b5639406bec3468e920403d00911f5cd/FLAG8a503a941
[2025-03-08 09:40:51,304 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-08 09:40:51,305 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_am2901.c
[2025-03-08 09:40:51,327 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3547a929/b5639406bec3468e920403d00911f5cd/FLAG8a503a941
[2025-03-08 09:40:51,344 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3547a929/b5639406bec3468e920403d00911f5cd
[2025-03-08 09:40:51,346 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-08 09:40:51,348 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-08 09:40:51,349 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-08 09:40:51,349 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-08 09:40:51,352 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-08 09:40:51,353 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:40:51" (1/1) ...
[2025-03-08 09:40:51,353 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e291d61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:51, skipping insertion in model container
[2025-03-08 09:40:51,355 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:40:51" (1/1) ...
[2025-03-08 09:40:51,403 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-08 09:40:51,550 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.vis_arrays_am2901.c[1257,1270]
[2025-03-08 09:40:51,861 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 09:40:51,870 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-08 09:40:51,877 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.vis_arrays_am2901.c[1257,1270]
[2025-03-08 09:40:52,055 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-08 09:40:52,066 INFO  L204         MainTranslator]: Completed translation
[2025-03-08 09:40:52,066 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:52 WrapperNode
[2025-03-08 09:40:52,067 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-08 09:40:52,067 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-08 09:40:52,067 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-08 09:40:52,068 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-08 09:40:52,071 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:40:52" (1/1) ...
[2025-03-08 09:40:52,118 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:40:52" (1/1) ...
[2025-03-08 09:40:52,622 INFO  L138                Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 5737
[2025-03-08 09:40:52,622 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-08 09:40:52,623 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-08 09:40:52,623 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-08 09:40:52,623 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-08 09:40:52,636 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:52" (1/1) ...
[2025-03-08 09:40:52,636 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:52" (1/1) ...
[2025-03-08 09:40:52,730 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:52" (1/1) ...
[2025-03-08 09:40:52,877 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:40:52,877 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:52" (1/1) ...
[2025-03-08 09:40:52,877 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:52" (1/1) ...
[2025-03-08 09:40:52,972 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:52" (1/1) ...
[2025-03-08 09:40:52,987 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:52" (1/1) ...
[2025-03-08 09:40:53,005 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:52" (1/1) ...
[2025-03-08 09:40:53,034 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:52" (1/1) ...
[2025-03-08 09:40:53,127 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-08 09:40:53,128 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-08 09:40:53,128 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-08 09:40:53,128 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-08 09:40:53,129 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:52" (1/1) ...
[2025-03-08 09:40:53,133 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-08 09:40:53,143 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-08 09:40:53,154 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:40:53,159 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:40:53,174 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-08 09:40:53,174 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-08 09:40:53,174 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-08 09:40:53,174 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-08 09:40:53,536 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-08 09:40:53,538 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-08 09:40:57,327 INFO  L?                        ?]: Removed 3760 outVars from TransFormulas that were not future-live.
[2025-03-08 09:40:57,327 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-08 09:40:57,513 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-08 09:40:57,513 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-08 09:40:57,513 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:40:57 BoogieIcfgContainer
[2025-03-08 09:40:57,514 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-08 09:40:57,516 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-08 09:40:57,516 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-08 09:40:57,519 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-08 09:40:57,520 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:40:51" (1/3) ...
[2025-03-08 09:40:57,520 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a48e6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:40:57, skipping insertion in model container
[2025-03-08 09:40:57,520 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:40:52" (2/3) ...
[2025-03-08 09:40:57,521 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30a48e6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:40:57, skipping insertion in model container
[2025-03-08 09:40:57,521 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:40:57" (3/3) ...
[2025-03-08 09:40:57,522 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_am2901.c
[2025-03-08 09:40:57,534 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-08 09:40:57,536 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_am2901.c that has 1 procedures, 1472 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-08 09:40:57,622 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-08 09:40:57,632 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;@47764c4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-08 09:40:57,634 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-08 09:40:57,642 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 1472 states, 1470 states have (on average 1.5) internal successors, (2205), 1471 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:40:57,650 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2025-03-08 09:40:57,650 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:40:57,651 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:57,651 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:40:57,657 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:40:57,658 INFO  L85        PathProgramCache]: Analyzing trace with hash -911839334, now seen corresponding path program 1 times
[2025-03-08 09:40:57,664 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:40:57,666 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408712910]
[2025-03-08 09:40:57,666 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:40:57,666 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:40:57,876 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes.
[2025-03-08 09:40:59,564 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements.
[2025-03-08 09:40:59,566 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:40:59,567 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:00,994 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:00,998 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:00,998 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408712910]
[2025-03-08 09:41:00,999 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408712910] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:00,999 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:01,000 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 09:41:01,001 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816321055]
[2025-03-08 09:41:01,001 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:01,004 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 09:41:01,005 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:01,020 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 09:41:01,020 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:41:01,025 INFO  L87              Difference]: Start difference. First operand  has 1472 states, 1470 states have (on average 1.5) internal successors, (2205), 1471 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:01,729 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:01,729 INFO  L93              Difference]: Finished difference Result 2873 states and 4307 transitions.
[2025-03-08 09:41:01,730 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 09:41:01,731 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115
[2025-03-08 09:41:01,731 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:01,750 INFO  L225             Difference]: With dead ends: 2873
[2025-03-08 09:41:01,750 INFO  L226             Difference]: Without dead ends: 1471
[2025-03-08 09:41:01,756 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:41:01,758 INFO  L435           NwaCegarLoop]: 1834 mSDtfsCounter, 0 mSDsluCounter, 3663 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5497 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:01,758 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5497 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 09:41:01,774 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1471 states.
[2025-03-08 09:41:01,831 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1471.
[2025-03-08 09:41:01,837 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1471 states, 1470 states have (on average 1.4986394557823128) internal successors, (2203), 1470 states have internal predecessors, (2203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:01,842 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 2203 transitions.
[2025-03-08 09:41:01,843 INFO  L78                 Accepts]: Start accepts. Automaton has 1471 states and 2203 transitions. Word has length 115
[2025-03-08 09:41:01,844 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:01,844 INFO  L471      AbstractCegarLoop]: Abstraction has 1471 states and 2203 transitions.
[2025-03-08 09:41:01,844 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:01,844 INFO  L276                IsEmpty]: Start isEmpty. Operand 1471 states and 2203 transitions.
[2025-03-08 09:41:01,846 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 117
[2025-03-08 09:41:01,846 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:01,847 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:01,847 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-08 09:41:01,847 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:01,847 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:01,848 INFO  L85        PathProgramCache]: Analyzing trace with hash 1802433037, now seen corresponding path program 1 times
[2025-03-08 09:41:01,848 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:01,848 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575200094]
[2025-03-08 09:41:01,848 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:01,848 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:01,961 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes.
[2025-03-08 09:41:02,070 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements.
[2025-03-08 09:41:02,070 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:02,071 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:02,869 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:02,869 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:02,869 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575200094]
[2025-03-08 09:41:02,869 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575200094] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:02,869 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:02,869 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 09:41:02,870 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765883005]
[2025-03-08 09:41:02,870 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:02,871 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 09:41:02,871 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:02,871 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 09:41:02,871 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:41:02,872 INFO  L87              Difference]: Start difference. First operand 1471 states and 2203 transitions. Second operand  has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:03,444 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:03,445 INFO  L93              Difference]: Finished difference Result 2874 states and 4305 transitions.
[2025-03-08 09:41:03,445 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 09:41:03,445 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116
[2025-03-08 09:41:03,445 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:03,450 INFO  L225             Difference]: With dead ends: 2874
[2025-03-08 09:41:03,450 INFO  L226             Difference]: Without dead ends: 1473
[2025-03-08 09:41:03,453 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:41:03,453 INFO  L435           NwaCegarLoop]: 1834 mSDtfsCounter, 0 mSDsluCounter, 3660 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5494 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:03,454 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5494 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 09:41:03,456 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1473 states.
[2025-03-08 09:41:03,471 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1473.
[2025-03-08 09:41:03,473 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1473 states, 1472 states have (on average 1.497961956521739) internal successors, (2205), 1472 states have internal predecessors, (2205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:03,477 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 2205 transitions.
[2025-03-08 09:41:03,477 INFO  L78                 Accepts]: Start accepts. Automaton has 1473 states and 2205 transitions. Word has length 116
[2025-03-08 09:41:03,478 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:03,478 INFO  L471      AbstractCegarLoop]: Abstraction has 1473 states and 2205 transitions.
[2025-03-08 09:41:03,478 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:03,479 INFO  L276                IsEmpty]: Start isEmpty. Operand 1473 states and 2205 transitions.
[2025-03-08 09:41:03,479 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 118
[2025-03-08 09:41:03,481 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:03,481 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:03,482 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-08 09:41:03,482 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:03,482 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:03,482 INFO  L85        PathProgramCache]: Analyzing trace with hash 1972360693, now seen corresponding path program 1 times
[2025-03-08 09:41:03,482 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:03,485 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950383562]
[2025-03-08 09:41:03,486 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:03,486 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:03,597 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes.
[2025-03-08 09:41:04,450 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements.
[2025-03-08 09:41:04,451 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:04,451 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:05,278 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:05,279 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:05,279 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950383562]
[2025-03-08 09:41:05,279 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950383562] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:05,279 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:05,279 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-08 09:41:05,279 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866944352]
[2025-03-08 09:41:05,279 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:05,280 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-08 09:41:05,280 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:05,281 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-08 09:41:05,281 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-08 09:41:05,281 INFO  L87              Difference]: Start difference. First operand 1473 states and 2205 transitions. Second operand  has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:05,843 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:05,843 INFO  L93              Difference]: Finished difference Result 2878 states and 4309 transitions.
[2025-03-08 09:41:05,844 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-08 09:41:05,844 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117
[2025-03-08 09:41:05,845 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:05,850 INFO  L225             Difference]: With dead ends: 2878
[2025-03-08 09:41:05,850 INFO  L226             Difference]: Without dead ends: 1475
[2025-03-08 09:41:05,852 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:41:05,854 INFO  L435           NwaCegarLoop]: 1834 mSDtfsCounter, 0 mSDsluCounter, 3660 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5494 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:05,855 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5494 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 09:41:05,856 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1475 states.
[2025-03-08 09:41:05,870 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1475.
[2025-03-08 09:41:05,872 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1475 states, 1474 states have (on average 1.4972862957937585) internal successors, (2207), 1474 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:05,876 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 2207 transitions.
[2025-03-08 09:41:05,876 INFO  L78                 Accepts]: Start accepts. Automaton has 1475 states and 2207 transitions. Word has length 117
[2025-03-08 09:41:05,877 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:05,877 INFO  L471      AbstractCegarLoop]: Abstraction has 1475 states and 2207 transitions.
[2025-03-08 09:41:05,877 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 29.25) internal successors, (117), 4 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:05,877 INFO  L276                IsEmpty]: Start isEmpty. Operand 1475 states and 2207 transitions.
[2025-03-08 09:41:05,878 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 119
[2025-03-08 09:41:05,878 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:05,878 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:05,878 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-08 09:41:05,879 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:05,879 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:05,879 INFO  L85        PathProgramCache]: Analyzing trace with hash -1392963278, now seen corresponding path program 1 times
[2025-03-08 09:41:05,879 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:05,879 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541500710]
[2025-03-08 09:41:05,880 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:05,880 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:05,979 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes.
[2025-03-08 09:41:06,054 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements.
[2025-03-08 09:41:06,054 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:06,054 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:06,607 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:06,608 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:06,608 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541500710]
[2025-03-08 09:41:06,608 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541500710] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:06,608 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:06,608 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:41:06,608 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985136108]
[2025-03-08 09:41:06,608 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:06,609 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:41:06,609 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:06,609 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:41:06,609 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:41:06,609 INFO  L87              Difference]: Start difference. First operand 1475 states and 2207 transitions. Second operand  has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:07,263 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:07,264 INFO  L93              Difference]: Finished difference Result 2886 states and 4319 transitions.
[2025-03-08 09:41:07,264 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:41:07,264 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118
[2025-03-08 09:41:07,265 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:07,269 INFO  L225             Difference]: With dead ends: 2886
[2025-03-08 09:41:07,269 INFO  L226             Difference]: Without dead ends: 1481
[2025-03-08 09:41:07,271 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:41:07,272 INFO  L435           NwaCegarLoop]: 1833 mSDtfsCounter, 4 mSDsluCounter, 5489 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 7322 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:07,273 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 7322 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 09:41:07,275 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1481 states.
[2025-03-08 09:41:07,288 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1481.
[2025-03-08 09:41:07,290 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1481 states, 1480 states have (on average 1.4966216216216217) internal successors, (2215), 1480 states have internal predecessors, (2215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:07,294 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1481 states to 1481 states and 2215 transitions.
[2025-03-08 09:41:07,294 INFO  L78                 Accepts]: Start accepts. Automaton has 1481 states and 2215 transitions. Word has length 118
[2025-03-08 09:41:07,294 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:07,294 INFO  L471      AbstractCegarLoop]: Abstraction has 1481 states and 2215 transitions.
[2025-03-08 09:41:07,294 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 23.6) internal successors, (118), 5 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:07,294 INFO  L276                IsEmpty]: Start isEmpty. Operand 1481 states and 2215 transitions.
[2025-03-08 09:41:07,295 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 120
[2025-03-08 09:41:07,295 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:07,295 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:07,295 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-08 09:41:07,295 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:07,296 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:07,296 INFO  L85        PathProgramCache]: Analyzing trace with hash 717888075, now seen corresponding path program 1 times
[2025-03-08 09:41:07,296 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:07,297 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851677977]
[2025-03-08 09:41:07,297 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:07,297 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:07,393 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes.
[2025-03-08 09:41:07,458 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements.
[2025-03-08 09:41:07,458 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:07,458 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:08,105 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:08,106 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:08,106 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851677977]
[2025-03-08 09:41:08,106 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851677977] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:08,106 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:08,106 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:41:08,106 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243092259]
[2025-03-08 09:41:08,106 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:08,106 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:41:08,106 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:08,107 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:41:08,107 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:41:08,107 INFO  L87              Difference]: Start difference. First operand 1481 states and 2215 transitions. Second operand  has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:08,810 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:08,810 INFO  L93              Difference]: Finished difference Result 2898 states and 4335 transitions.
[2025-03-08 09:41:08,810 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:41:08,811 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 119
[2025-03-08 09:41:08,811 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:08,815 INFO  L225             Difference]: With dead ends: 2898
[2025-03-08 09:41:08,815 INFO  L226             Difference]: Without dead ends: 1487
[2025-03-08 09:41:08,817 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:41:08,818 INFO  L435           NwaCegarLoop]: 1833 mSDtfsCounter, 4 mSDsluCounter, 5489 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 7322 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:08,818 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 7322 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 09:41:08,820 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1487 states.
[2025-03-08 09:41:08,834 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 1487.
[2025-03-08 09:41:08,837 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1487 states, 1486 states have (on average 1.4959623149394348) internal successors, (2223), 1486 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:08,840 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 2223 transitions.
[2025-03-08 09:41:08,840 INFO  L78                 Accepts]: Start accepts. Automaton has 1487 states and 2223 transitions. Word has length 119
[2025-03-08 09:41:08,841 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:08,841 INFO  L471      AbstractCegarLoop]: Abstraction has 1487 states and 2223 transitions.
[2025-03-08 09:41:08,841 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 23.8) internal successors, (119), 5 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:08,841 INFO  L276                IsEmpty]: Start isEmpty. Operand 1487 states and 2223 transitions.
[2025-03-08 09:41:08,842 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 121
[2025-03-08 09:41:08,842 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:08,842 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:08,842 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-08 09:41:08,842 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:08,842 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:08,843 INFO  L85        PathProgramCache]: Analyzing trace with hash 2063784284, now seen corresponding path program 1 times
[2025-03-08 09:41:08,843 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:08,843 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83019563]
[2025-03-08 09:41:08,843 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:08,843 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:08,958 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes.
[2025-03-08 09:41:09,166 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements.
[2025-03-08 09:41:09,167 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:09,167 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:09,687 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:09,688 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:09,690 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83019563]
[2025-03-08 09:41:09,690 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83019563] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:09,690 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:09,690 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:41:09,690 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728014542]
[2025-03-08 09:41:09,690 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:09,691 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:41:09,691 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:09,691 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:41:09,693 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:41:09,694 INFO  L87              Difference]: Start difference. First operand 1487 states and 2223 transitions. Second operand  has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:10,397 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:10,397 INFO  L93              Difference]: Finished difference Result 2910 states and 4351 transitions.
[2025-03-08 09:41:10,398 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:41:10,398 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120
[2025-03-08 09:41:10,398 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:10,402 INFO  L225             Difference]: With dead ends: 2910
[2025-03-08 09:41:10,402 INFO  L226             Difference]: Without dead ends: 1493
[2025-03-08 09:41:10,404 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:41:10,405 INFO  L435           NwaCegarLoop]: 1833 mSDtfsCounter, 4 mSDsluCounter, 5489 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 7322 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:10,405 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 7322 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 09:41:10,407 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1493 states.
[2025-03-08 09:41:10,425 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1493.
[2025-03-08 09:41:10,428 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1493 states, 1492 states have (on average 1.4953083109919572) internal successors, (2231), 1492 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:10,432 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 2231 transitions.
[2025-03-08 09:41:10,432 INFO  L78                 Accepts]: Start accepts. Automaton has 1493 states and 2231 transitions. Word has length 120
[2025-03-08 09:41:10,432 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:10,433 INFO  L471      AbstractCegarLoop]: Abstraction has 1493 states and 2231 transitions.
[2025-03-08 09:41:10,433 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:10,433 INFO  L276                IsEmpty]: Start isEmpty. Operand 1493 states and 2231 transitions.
[2025-03-08 09:41:10,434 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 122
[2025-03-08 09:41:10,434 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:10,434 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:10,434 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-08 09:41:10,434 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:10,434 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:10,435 INFO  L85        PathProgramCache]: Analyzing trace with hash -274141791, now seen corresponding path program 1 times
[2025-03-08 09:41:10,435 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:10,435 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913751487]
[2025-03-08 09:41:10,435 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:10,435 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:10,556 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes.
[2025-03-08 09:41:10,635 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements.
[2025-03-08 09:41:10,635 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:10,635 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:11,102 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:11,102 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:11,103 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913751487]
[2025-03-08 09:41:11,103 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913751487] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:11,103 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:11,103 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:41:11,103 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862799022]
[2025-03-08 09:41:11,103 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:11,103 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:41:11,103 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:11,104 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:41:11,104 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:41:11,104 INFO  L87              Difference]: Start difference. First operand 1493 states and 2231 transitions. Second operand  has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:11,775 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:11,776 INFO  L93              Difference]: Finished difference Result 2922 states and 4367 transitions.
[2025-03-08 09:41:11,776 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:41:11,776 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121
[2025-03-08 09:41:11,776 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:11,780 INFO  L225             Difference]: With dead ends: 2922
[2025-03-08 09:41:11,780 INFO  L226             Difference]: Without dead ends: 1499
[2025-03-08 09:41:11,781 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:41:11,782 INFO  L435           NwaCegarLoop]: 1833 mSDtfsCounter, 4 mSDsluCounter, 5489 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 7322 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:11,783 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 7322 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 09:41:11,785 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1499 states.
[2025-03-08 09:41:11,797 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1499 to 1499.
[2025-03-08 09:41:11,799 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1499 states, 1498 states have (on average 1.4946595460614152) internal successors, (2239), 1498 states have internal predecessors, (2239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:11,802 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 2239 transitions.
[2025-03-08 09:41:11,802 INFO  L78                 Accepts]: Start accepts. Automaton has 1499 states and 2239 transitions. Word has length 121
[2025-03-08 09:41:11,802 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:11,802 INFO  L471      AbstractCegarLoop]: Abstraction has 1499 states and 2239 transitions.
[2025-03-08 09:41:11,803 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:11,803 INFO  L276                IsEmpty]: Start isEmpty. Operand 1499 states and 2239 transitions.
[2025-03-08 09:41:11,803 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 123
[2025-03-08 09:41:11,803 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:11,803 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:11,804 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-08 09:41:11,804 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:11,804 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:11,804 INFO  L85        PathProgramCache]: Analyzing trace with hash -1714240890, now seen corresponding path program 1 times
[2025-03-08 09:41:11,804 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:11,804 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911297964]
[2025-03-08 09:41:11,805 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:11,805 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:11,901 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes.
[2025-03-08 09:41:11,963 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements.
[2025-03-08 09:41:11,963 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:11,963 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:12,446 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:12,446 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:12,446 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911297964]
[2025-03-08 09:41:12,446 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911297964] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:12,446 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:12,446 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:41:12,446 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347534650]
[2025-03-08 09:41:12,446 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:12,447 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:41:12,447 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:12,447 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:41:12,447 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:41:12,447 INFO  L87              Difference]: Start difference. First operand 1499 states and 2239 transitions. Second operand  has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:13,255 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:13,256 INFO  L93              Difference]: Finished difference Result 2934 states and 4383 transitions.
[2025-03-08 09:41:13,256 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:41:13,256 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122
[2025-03-08 09:41:13,256 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:13,260 INFO  L225             Difference]: With dead ends: 2934
[2025-03-08 09:41:13,260 INFO  L226             Difference]: Without dead ends: 1505
[2025-03-08 09:41:13,263 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:41:13,263 INFO  L435           NwaCegarLoop]: 1833 mSDtfsCounter, 4 mSDsluCounter, 5489 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 7322 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:13,264 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 7322 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-08 09:41:13,266 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1505 states.
[2025-03-08 09:41:13,278 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505.
[2025-03-08 09:41:13,280 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1505 states, 1504 states have (on average 1.4940159574468086) internal successors, (2247), 1504 states have internal predecessors, (2247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:13,283 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2247 transitions.
[2025-03-08 09:41:13,283 INFO  L78                 Accepts]: Start accepts. Automaton has 1505 states and 2247 transitions. Word has length 122
[2025-03-08 09:41:13,283 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:13,283 INFO  L471      AbstractCegarLoop]: Abstraction has 1505 states and 2247 transitions.
[2025-03-08 09:41:13,283 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:13,283 INFO  L276                IsEmpty]: Start isEmpty. Operand 1505 states and 2247 transitions.
[2025-03-08 09:41:13,285 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 124
[2025-03-08 09:41:13,286 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:13,286 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:13,286 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-08 09:41:13,286 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:13,287 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:13,287 INFO  L85        PathProgramCache]: Analyzing trace with hash -1481707529, now seen corresponding path program 1 times
[2025-03-08 09:41:13,287 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:13,287 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706529527]
[2025-03-08 09:41:13,287 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:13,287 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:13,387 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes.
[2025-03-08 09:41:13,821 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements.
[2025-03-08 09:41:13,822 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:13,822 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:14,541 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:14,541 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:14,541 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706529527]
[2025-03-08 09:41:14,541 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706529527] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:14,541 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:14,541 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-08 09:41:14,542 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34884413]
[2025-03-08 09:41:14,542 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:14,542 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-08 09:41:14,542 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:14,543 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-08 09:41:14,543 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-03-08 09:41:14,543 INFO  L87              Difference]: Start difference. First operand 1505 states and 2247 transitions. Second operand  has 8 states, 8 states have (on average 15.375) internal successors, (123), 8 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:15,409 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:15,409 INFO  L93              Difference]: Finished difference Result 2946 states and 4399 transitions.
[2025-03-08 09:41:15,409 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 09:41:15,409 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 15.375) internal successors, (123), 8 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 123
[2025-03-08 09:41:15,409 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:15,413 INFO  L225             Difference]: With dead ends: 2946
[2025-03-08 09:41:15,413 INFO  L226             Difference]: Without dead ends: 1511
[2025-03-08 09:41:15,414 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-03-08 09:41:15,414 INFO  L435           NwaCegarLoop]: 1830 mSDtfsCounter, 8 mSDsluCounter, 10961 mSDsCounter, 0 mSdLazyCounter, 2614 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 12791 SdHoareTripleChecker+Invalid, 2617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:15,414 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 12791 Invalid, 2617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2614 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-08 09:41:15,416 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1511 states.
[2025-03-08 09:41:15,427 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1511.
[2025-03-08 09:41:15,429 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1511 states, 1510 states have (on average 1.4933774834437086) internal successors, (2255), 1510 states have internal predecessors, (2255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:15,431 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 2255 transitions.
[2025-03-08 09:41:15,431 INFO  L78                 Accepts]: Start accepts. Automaton has 1511 states and 2255 transitions. Word has length 123
[2025-03-08 09:41:15,431 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:15,431 INFO  L471      AbstractCegarLoop]: Abstraction has 1511 states and 2255 transitions.
[2025-03-08 09:41:15,431 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 15.375) internal successors, (123), 8 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:15,431 INFO  L276                IsEmpty]: Start isEmpty. Operand 1511 states and 2255 transitions.
[2025-03-08 09:41:15,432 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 125
[2025-03-08 09:41:15,432 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:15,432 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:15,432 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-08 09:41:15,432 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:15,437 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:15,437 INFO  L85        PathProgramCache]: Analyzing trace with hash 2037787824, now seen corresponding path program 1 times
[2025-03-08 09:41:15,437 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:15,437 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894969589]
[2025-03-08 09:41:15,437 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:15,437 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:15,568 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes.
[2025-03-08 09:41:15,659 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements.
[2025-03-08 09:41:15,659 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:15,659 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:16,119 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:16,119 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:16,119 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894969589]
[2025-03-08 09:41:16,119 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894969589] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:16,119 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:16,119 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:41:16,119 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811705878]
[2025-03-08 09:41:16,119 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:16,120 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:41:16,120 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:16,120 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:41:16,120 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:41:16,120 INFO  L87              Difference]: Start difference. First operand 1511 states and 2255 transitions. Second operand  has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:16,610 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:16,610 INFO  L93              Difference]: Finished difference Result 2958 states and 4415 transitions.
[2025-03-08 09:41:16,610 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:41:16,610 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 124
[2025-03-08 09:41:16,610 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:16,613 INFO  L225             Difference]: With dead ends: 2958
[2025-03-08 09:41:16,613 INFO  L226             Difference]: Without dead ends: 1517
[2025-03-08 09:41:16,615 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:41:16,615 INFO  L435           NwaCegarLoop]: 1833 mSDtfsCounter, 4 mSDsluCounter, 5489 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 7322 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:16,615 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 7322 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 09:41:16,616 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1517 states.
[2025-03-08 09:41:16,649 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1517.
[2025-03-08 09:41:16,650 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1517 states, 1516 states have (on average 1.4927440633245384) internal successors, (2263), 1516 states have internal predecessors, (2263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:16,653 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 2263 transitions.
[2025-03-08 09:41:16,653 INFO  L78                 Accepts]: Start accepts. Automaton has 1517 states and 2263 transitions. Word has length 124
[2025-03-08 09:41:16,653 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:16,653 INFO  L471      AbstractCegarLoop]: Abstraction has 1517 states and 2263 transitions.
[2025-03-08 09:41:16,653 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:16,653 INFO  L276                IsEmpty]: Start isEmpty. Operand 1517 states and 2263 transitions.
[2025-03-08 09:41:16,654 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 126
[2025-03-08 09:41:16,654 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:16,654 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:16,654 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-08 09:41:16,654 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:16,655 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:16,655 INFO  L85        PathProgramCache]: Analyzing trace with hash -1497448115, now seen corresponding path program 1 times
[2025-03-08 09:41:16,655 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:16,655 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027490007]
[2025-03-08 09:41:16,655 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:16,655 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:16,750 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes.
[2025-03-08 09:41:16,849 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements.
[2025-03-08 09:41:16,849 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:16,849 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:17,284 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:17,284 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:17,284 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027490007]
[2025-03-08 09:41:17,285 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027490007] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:17,285 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:17,285 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:41:17,285 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436637959]
[2025-03-08 09:41:17,285 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:17,285 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:41:17,285 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:17,286 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:41:17,286 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:41:17,286 INFO  L87              Difference]: Start difference. First operand 1517 states and 2263 transitions. Second operand  has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:17,847 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:17,847 INFO  L93              Difference]: Finished difference Result 2970 states and 4431 transitions.
[2025-03-08 09:41:17,848 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:41:17,848 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125
[2025-03-08 09:41:17,848 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:17,852 INFO  L225             Difference]: With dead ends: 2970
[2025-03-08 09:41:17,852 INFO  L226             Difference]: Without dead ends: 1523
[2025-03-08 09:41:17,853 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:41:17,854 INFO  L435           NwaCegarLoop]: 1833 mSDtfsCounter, 4 mSDsluCounter, 5489 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 7322 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:17,854 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 7322 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 09:41:17,856 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1523 states.
[2025-03-08 09:41:17,868 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1523.
[2025-03-08 09:41:17,870 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1523 states, 1522 states have (on average 1.4921156373193167) internal successors, (2271), 1522 states have internal predecessors, (2271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:17,872 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 2271 transitions.
[2025-03-08 09:41:17,872 INFO  L78                 Accepts]: Start accepts. Automaton has 1523 states and 2271 transitions. Word has length 125
[2025-03-08 09:41:17,872 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:17,872 INFO  L471      AbstractCegarLoop]: Abstraction has 1523 states and 2271 transitions.
[2025-03-08 09:41:17,872 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 25.0) internal successors, (125), 5 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:17,873 INFO  L276                IsEmpty]: Start isEmpty. Operand 1523 states and 2271 transitions.
[2025-03-08 09:41:17,874 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 127
[2025-03-08 09:41:17,874 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:17,874 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:17,874 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-08 09:41:17,874 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:17,874 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:17,874 INFO  L85        PathProgramCache]: Analyzing trace with hash 1251637210, now seen corresponding path program 1 times
[2025-03-08 09:41:17,874 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:17,875 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648775012]
[2025-03-08 09:41:17,875 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:17,875 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:17,966 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes.
[2025-03-08 09:41:18,117 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements.
[2025-03-08 09:41:18,117 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:18,117 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:18,557 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:18,557 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:18,557 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648775012]
[2025-03-08 09:41:18,557 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648775012] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:18,557 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:18,557 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:41:18,557 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602316996]
[2025-03-08 09:41:18,557 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:18,558 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:41:18,558 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:18,558 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:41:18,558 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:41:18,558 INFO  L87              Difference]: Start difference. First operand 1523 states and 2271 transitions. Second operand  has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:19,052 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:19,052 INFO  L93              Difference]: Finished difference Result 2982 states and 4447 transitions.
[2025-03-08 09:41:19,052 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:41:19,052 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126
[2025-03-08 09:41:19,053 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:19,056 INFO  L225             Difference]: With dead ends: 2982
[2025-03-08 09:41:19,056 INFO  L226             Difference]: Without dead ends: 1529
[2025-03-08 09:41:19,057 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:41:19,057 INFO  L435           NwaCegarLoop]: 1833 mSDtfsCounter, 4 mSDsluCounter, 5489 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 7322 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:19,057 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 7322 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 09:41:19,059 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1529 states.
[2025-03-08 09:41:19,069 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1529.
[2025-03-08 09:41:19,071 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1529 states, 1528 states have (on average 1.4914921465968587) internal successors, (2279), 1528 states have internal predecessors, (2279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:19,072 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 2279 transitions.
[2025-03-08 09:41:19,073 INFO  L78                 Accepts]: Start accepts. Automaton has 1529 states and 2279 transitions. Word has length 126
[2025-03-08 09:41:19,073 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:19,073 INFO  L471      AbstractCegarLoop]: Abstraction has 1529 states and 2279 transitions.
[2025-03-08 09:41:19,073 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:19,073 INFO  L276                IsEmpty]: Start isEmpty. Operand 1529 states and 2279 transitions.
[2025-03-08 09:41:19,074 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 128
[2025-03-08 09:41:19,074 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:19,074 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:19,074 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-08 09:41:19,074 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:19,075 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:19,075 INFO  L85        PathProgramCache]: Analyzing trace with hash -1894055517, now seen corresponding path program 1 times
[2025-03-08 09:41:19,075 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:19,075 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496492243]
[2025-03-08 09:41:19,075 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:19,075 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:19,174 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes.
[2025-03-08 09:41:19,810 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements.
[2025-03-08 09:41:19,810 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:19,810 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:20,790 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:20,790 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:20,790 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496492243]
[2025-03-08 09:41:20,790 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496492243] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:20,790 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:20,790 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 09:41:20,790 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791881072]
[2025-03-08 09:41:20,790 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:20,790 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 09:41:20,790 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:20,791 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 09:41:20,791 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:41:20,791 INFO  L87              Difference]: Start difference. First operand 1529 states and 2279 transitions. Second operand  has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:21,305 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:21,305 INFO  L93              Difference]: Finished difference Result 2994 states and 4463 transitions.
[2025-03-08 09:41:21,305 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:41:21,305 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127
[2025-03-08 09:41:21,305 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:21,309 INFO  L225             Difference]: With dead ends: 2994
[2025-03-08 09:41:21,310 INFO  L226             Difference]: Without dead ends: 1535
[2025-03-08 09:41:21,311 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:41:21,312 INFO  L435           NwaCegarLoop]: 1833 mSDtfsCounter, 4 mSDsluCounter, 5489 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 7322 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:21,312 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 7322 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 09:41:21,313 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1535 states.
[2025-03-08 09:41:21,323 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1535.
[2025-03-08 09:41:21,325 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1535 states, 1534 states have (on average 1.4908735332464147) internal successors, (2287), 1534 states have internal predecessors, (2287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:21,330 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1535 states to 1535 states and 2287 transitions.
[2025-03-08 09:41:21,330 INFO  L78                 Accepts]: Start accepts. Automaton has 1535 states and 2287 transitions. Word has length 127
[2025-03-08 09:41:21,330 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:21,330 INFO  L471      AbstractCegarLoop]: Abstraction has 1535 states and 2287 transitions.
[2025-03-08 09:41:21,330 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:21,330 INFO  L276                IsEmpty]: Start isEmpty. Operand 1535 states and 2287 transitions.
[2025-03-08 09:41:21,331 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 129
[2025-03-08 09:41:21,331 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:21,331 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:21,331 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-08 09:41:21,331 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:21,332 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:21,332 INFO  L85        PathProgramCache]: Analyzing trace with hash -1601371132, now seen corresponding path program 1 times
[2025-03-08 09:41:21,332 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:21,333 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791425099]
[2025-03-08 09:41:21,333 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:21,334 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:21,430 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes.
[2025-03-08 09:41:21,959 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements.
[2025-03-08 09:41:21,959 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:21,959 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:22,588 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:22,589 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:22,589 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791425099]
[2025-03-08 09:41:22,589 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791425099] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:22,589 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:22,590 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-08 09:41:22,590 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365831482]
[2025-03-08 09:41:22,590 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:22,590 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-08 09:41:22,590 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:22,590 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-08 09:41:22,591 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-03-08 09:41:22,591 INFO  L87              Difference]: Start difference. First operand 1535 states and 2287 transitions. Second operand  has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:23,623 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:23,623 INFO  L93              Difference]: Finished difference Result 3006 states and 4479 transitions.
[2025-03-08 09:41:23,623 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-08 09:41:23,624 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128
[2025-03-08 09:41:23,624 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:23,627 INFO  L225             Difference]: With dead ends: 3006
[2025-03-08 09:41:23,627 INFO  L226             Difference]: Without dead ends: 1541
[2025-03-08 09:41:23,628 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72
[2025-03-08 09:41:23,628 INFO  L435           NwaCegarLoop]: 1830 mSDtfsCounter, 8 mSDsluCounter, 12786 mSDsCounter, 0 mSdLazyCounter, 2990 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 14616 SdHoareTripleChecker+Invalid, 2993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 2990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:23,628 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 14616 Invalid, 2993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 2990 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-03-08 09:41:23,630 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1541 states.
[2025-03-08 09:41:23,637 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1541.
[2025-03-08 09:41:23,638 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1541 states, 1540 states have (on average 1.4902597402597402) internal successors, (2295), 1540 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:23,640 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2295 transitions.
[2025-03-08 09:41:23,640 INFO  L78                 Accepts]: Start accepts. Automaton has 1541 states and 2295 transitions. Word has length 128
[2025-03-08 09:41:23,640 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:23,640 INFO  L471      AbstractCegarLoop]: Abstraction has 1541 states and 2295 transitions.
[2025-03-08 09:41:23,640 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 14.222222222222221) internal successors, (128), 9 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:23,640 INFO  L276                IsEmpty]: Start isEmpty. Operand 1541 states and 2295 transitions.
[2025-03-08 09:41:23,641 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 130
[2025-03-08 09:41:23,641 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:23,641 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:23,641 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-08 09:41:23,641 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:23,641 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:23,641 INFO  L85        PathProgramCache]: Analyzing trace with hash 795234553, now seen corresponding path program 1 times
[2025-03-08 09:41:23,641 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:23,641 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114455351]
[2025-03-08 09:41:23,641 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:23,641 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:23,727 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes.
[2025-03-08 09:41:23,793 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements.
[2025-03-08 09:41:23,793 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:23,793 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:24,300 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:24,300 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:24,300 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114455351]
[2025-03-08 09:41:24,300 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114455351] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:24,301 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:24,301 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 09:41:24,301 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052481521]
[2025-03-08 09:41:24,301 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:24,301 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 09:41:24,301 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:24,302 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 09:41:24,302 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:41:24,302 INFO  L87              Difference]: Start difference. First operand 1541 states and 2295 transitions. Second operand  has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:24,803 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:24,803 INFO  L93              Difference]: Finished difference Result 3018 states and 4495 transitions.
[2025-03-08 09:41:24,803 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:41:24,803 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129
[2025-03-08 09:41:24,804 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:24,807 INFO  L225             Difference]: With dead ends: 3018
[2025-03-08 09:41:24,807 INFO  L226             Difference]: Without dead ends: 1547
[2025-03-08 09:41:24,808 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:41:24,809 INFO  L435           NwaCegarLoop]: 1833 mSDtfsCounter, 4 mSDsluCounter, 5489 mSDsCounter, 0 mSdLazyCounter, 1482 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 7322 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:24,809 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 7322 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1482 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 09:41:24,810 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1547 states.
[2025-03-08 09:41:24,819 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1547.
[2025-03-08 09:41:24,820 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1547 states, 1546 states have (on average 1.4896507115135835) internal successors, (2303), 1546 states have internal predecessors, (2303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:24,823 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 2303 transitions.
[2025-03-08 09:41:24,823 INFO  L78                 Accepts]: Start accepts. Automaton has 1547 states and 2303 transitions. Word has length 129
[2025-03-08 09:41:24,823 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:24,823 INFO  L471      AbstractCegarLoop]: Abstraction has 1547 states and 2303 transitions.
[2025-03-08 09:41:24,823 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 21.5) internal successors, (129), 6 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:24,823 INFO  L276                IsEmpty]: Start isEmpty. Operand 1547 states and 2303 transitions.
[2025-03-08 09:41:24,824 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 131
[2025-03-08 09:41:24,824 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:24,824 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:24,824 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-08 09:41:24,824 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:24,824 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:24,824 INFO  L85        PathProgramCache]: Analyzing trace with hash 322646318, now seen corresponding path program 1 times
[2025-03-08 09:41:24,824 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:24,824 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26186935]
[2025-03-08 09:41:24,824 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:24,825 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:24,922 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes.
[2025-03-08 09:41:24,998 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements.
[2025-03-08 09:41:24,999 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:24,999 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:25,422 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:25,422 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:25,423 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26186935]
[2025-03-08 09:41:25,423 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26186935] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:25,423 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:25,423 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:41:25,423 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767830752]
[2025-03-08 09:41:25,423 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:25,423 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:41:25,423 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:25,423 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:41:25,424 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:41:25,424 INFO  L87              Difference]: Start difference. First operand 1547 states and 2303 transitions. Second operand  has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:25,889 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:25,889 INFO  L93              Difference]: Finished difference Result 3030 states and 4511 transitions.
[2025-03-08 09:41:25,889 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:41:25,889 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130
[2025-03-08 09:41:25,890 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:25,893 INFO  L225             Difference]: With dead ends: 3030
[2025-03-08 09:41:25,893 INFO  L226             Difference]: Without dead ends: 1553
[2025-03-08 09:41:25,894 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:41:25,894 INFO  L435           NwaCegarLoop]: 1833 mSDtfsCounter, 4 mSDsluCounter, 5489 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 7322 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:25,894 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 7322 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:41:25,896 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1553 states.
[2025-03-08 09:41:25,903 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 1553.
[2025-03-08 09:41:25,904 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1553 states, 1552 states have (on average 1.4890463917525774) internal successors, (2311), 1552 states have internal predecessors, (2311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:25,905 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 2311 transitions.
[2025-03-08 09:41:25,905 INFO  L78                 Accepts]: Start accepts. Automaton has 1553 states and 2311 transitions. Word has length 130
[2025-03-08 09:41:25,905 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:25,905 INFO  L471      AbstractCegarLoop]: Abstraction has 1553 states and 2311 transitions.
[2025-03-08 09:41:25,905 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:25,905 INFO  L276                IsEmpty]: Start isEmpty. Operand 1553 states and 2311 transitions.
[2025-03-08 09:41:25,906 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 132
[2025-03-08 09:41:25,906 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:25,906 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:25,906 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-08 09:41:25,906 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:25,906 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:25,906 INFO  L85        PathProgramCache]: Analyzing trace with hash 1621315407, now seen corresponding path program 1 times
[2025-03-08 09:41:25,906 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:25,907 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991202126]
[2025-03-08 09:41:25,907 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:25,907 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:26,025 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes.
[2025-03-08 09:41:26,417 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements.
[2025-03-08 09:41:26,417 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:26,417 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:26,822 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:26,822 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:26,822 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991202126]
[2025-03-08 09:41:26,822 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991202126] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:26,823 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:26,823 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:41:26,823 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435463405]
[2025-03-08 09:41:26,823 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:26,823 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:41:26,823 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:26,823 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:41:26,823 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:41:26,823 INFO  L87              Difference]: Start difference. First operand 1553 states and 2311 transitions. Second operand  has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:27,292 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:27,292 INFO  L93              Difference]: Finished difference Result 3042 states and 4527 transitions.
[2025-03-08 09:41:27,292 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:41:27,292 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131
[2025-03-08 09:41:27,292 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:27,296 INFO  L225             Difference]: With dead ends: 3042
[2025-03-08 09:41:27,296 INFO  L226             Difference]: Without dead ends: 1559
[2025-03-08 09:41:27,297 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:41:27,298 INFO  L435           NwaCegarLoop]: 1833 mSDtfsCounter, 4 mSDsluCounter, 5489 mSDsCounter, 0 mSdLazyCounter, 1481 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 7322 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:27,298 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 7322 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1481 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:41:27,299 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1559 states.
[2025-03-08 09:41:27,307 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1559 to 1559.
[2025-03-08 09:41:27,307 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1559 states, 1558 states have (on average 1.488446726572529) internal successors, (2319), 1558 states have internal predecessors, (2319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:27,308 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2319 transitions.
[2025-03-08 09:41:27,312 INFO  L78                 Accepts]: Start accepts. Automaton has 1559 states and 2319 transitions. Word has length 131
[2025-03-08 09:41:27,313 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:27,313 INFO  L471      AbstractCegarLoop]: Abstraction has 1559 states and 2319 transitions.
[2025-03-08 09:41:27,313 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:27,313 INFO  L276                IsEmpty]: Start isEmpty. Operand 1559 states and 2319 transitions.
[2025-03-08 09:41:27,313 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 133
[2025-03-08 09:41:27,313 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:27,313 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:27,313 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-08 09:41:27,314 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:27,314 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:27,314 INFO  L85        PathProgramCache]: Analyzing trace with hash -516792488, now seen corresponding path program 1 times
[2025-03-08 09:41:27,314 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:27,314 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180933692]
[2025-03-08 09:41:27,314 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:27,314 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:27,396 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes.
[2025-03-08 09:41:27,681 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements.
[2025-03-08 09:41:27,681 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:27,681 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:28,100 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:28,100 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:28,100 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180933692]
[2025-03-08 09:41:28,100 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180933692] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:28,100 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:28,101 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 09:41:28,101 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654407447]
[2025-03-08 09:41:28,101 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:28,101 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 09:41:28,101 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:28,101 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 09:41:28,101 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:41:28,101 INFO  L87              Difference]: Start difference. First operand 1559 states and 2319 transitions. Second operand  has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:28,693 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:28,693 INFO  L93              Difference]: Finished difference Result 3054 states and 4543 transitions.
[2025-03-08 09:41:28,693 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:41:28,693 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 132
[2025-03-08 09:41:28,693 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:28,696 INFO  L225             Difference]: With dead ends: 3054
[2025-03-08 09:41:28,696 INFO  L226             Difference]: Without dead ends: 1565
[2025-03-08 09:41:28,698 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:41:28,699 INFO  L435           NwaCegarLoop]: 1833 mSDtfsCounter, 4 mSDsluCounter, 7317 mSDsCounter, 0 mSdLazyCounter, 1854 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 9150 SdHoareTripleChecker+Invalid, 1855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1854 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:28,699 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 9150 Invalid, 1855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1854 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 09:41:28,700 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1565 states.
[2025-03-08 09:41:28,708 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1565.
[2025-03-08 09:41:28,709 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1565 states, 1564 states have (on average 1.487851662404092) internal successors, (2327), 1564 states have internal predecessors, (2327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:28,711 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 2327 transitions.
[2025-03-08 09:41:28,711 INFO  L78                 Accepts]: Start accepts. Automaton has 1565 states and 2327 transitions. Word has length 132
[2025-03-08 09:41:28,711 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:28,711 INFO  L471      AbstractCegarLoop]: Abstraction has 1565 states and 2327 transitions.
[2025-03-08 09:41:28,711 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:28,711 INFO  L276                IsEmpty]: Start isEmpty. Operand 1565 states and 2327 transitions.
[2025-03-08 09:41:28,712 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2025-03-08 09:41:28,712 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:28,712 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:28,712 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-08 09:41:28,712 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:28,713 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:28,713 INFO  L85        PathProgramCache]: Analyzing trace with hash -466314075, now seen corresponding path program 1 times
[2025-03-08 09:41:28,713 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:28,713 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543362798]
[2025-03-08 09:41:28,713 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:28,713 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:28,802 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes.
[2025-03-08 09:41:29,405 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements.
[2025-03-08 09:41:29,406 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:29,406 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:30,508 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:30,509 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:30,509 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543362798]
[2025-03-08 09:41:30,509 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543362798] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:30,509 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:30,509 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 09:41:30,509 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040855515]
[2025-03-08 09:41:30,509 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:30,509 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 09:41:30,509 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:30,509 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 09:41:30,509 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:41:30,509 INFO  L87              Difference]: Start difference. First operand 1565 states and 2327 transitions. Second operand  has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:31,223 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:31,223 INFO  L93              Difference]: Finished difference Result 3064 states and 4555 transitions.
[2025-03-08 09:41:31,223 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:41:31,223 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 133
[2025-03-08 09:41:31,224 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:31,226 INFO  L225             Difference]: With dead ends: 3064
[2025-03-08 09:41:31,226 INFO  L226             Difference]: Without dead ends: 1569
[2025-03-08 09:41:31,227 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:41:31,227 INFO  L435           NwaCegarLoop]: 1819 mSDtfsCounter, 2147 mSDsluCounter, 5444 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2147 SdHoareTripleChecker+Valid, 7263 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:31,228 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2147 Valid, 7263 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 09:41:31,229 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1569 states.
[2025-03-08 09:41:31,238 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1565.
[2025-03-08 09:41:31,238 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1565 states, 1564 states have (on average 1.487851662404092) internal successors, (2327), 1564 states have internal predecessors, (2327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:31,240 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 2327 transitions.
[2025-03-08 09:41:31,240 INFO  L78                 Accepts]: Start accepts. Automaton has 1565 states and 2327 transitions. Word has length 133
[2025-03-08 09:41:31,240 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:31,240 INFO  L471      AbstractCegarLoop]: Abstraction has 1565 states and 2327 transitions.
[2025-03-08 09:41:31,240 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 22.166666666666668) internal successors, (133), 6 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:31,240 INFO  L276                IsEmpty]: Start isEmpty. Operand 1565 states and 2327 transitions.
[2025-03-08 09:41:31,241 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 135
[2025-03-08 09:41:31,241 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:31,241 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:31,241 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-08 09:41:31,241 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:31,242 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:31,242 INFO  L85        PathProgramCache]: Analyzing trace with hash -1017269667, now seen corresponding path program 1 times
[2025-03-08 09:41:31,242 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:31,242 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131220804]
[2025-03-08 09:41:31,242 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:31,242 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:31,334 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes.
[2025-03-08 09:41:31,897 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements.
[2025-03-08 09:41:31,897 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:31,897 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:32,866 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:32,866 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:32,866 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131220804]
[2025-03-08 09:41:32,866 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131220804] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:32,866 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:32,866 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:41:32,866 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902049092]
[2025-03-08 09:41:32,866 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:32,866 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:41:32,866 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:32,866 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:41:32,867 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:41:32,867 INFO  L87              Difference]: Start difference. First operand 1565 states and 2327 transitions. Second operand  has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:33,321 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:33,322 INFO  L93              Difference]: Finished difference Result 3064 states and 4555 transitions.
[2025-03-08 09:41:33,322 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:41:33,322 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134
[2025-03-08 09:41:33,322 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:33,324 INFO  L225             Difference]: With dead ends: 3064
[2025-03-08 09:41:33,324 INFO  L226             Difference]: Without dead ends: 1569
[2025-03-08 09:41:33,325 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:41:33,326 INFO  L435           NwaCegarLoop]: 1819 mSDtfsCounter, 2152 mSDsluCounter, 3630 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2152 SdHoareTripleChecker+Valid, 5449 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:33,326 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2152 Valid, 5449 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:41:33,327 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1569 states.
[2025-03-08 09:41:33,335 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1565.
[2025-03-08 09:41:33,336 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1565 states, 1564 states have (on average 1.487851662404092) internal successors, (2327), 1564 states have internal predecessors, (2327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:33,337 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1565 states to 1565 states and 2327 transitions.
[2025-03-08 09:41:33,337 INFO  L78                 Accepts]: Start accepts. Automaton has 1565 states and 2327 transitions. Word has length 134
[2025-03-08 09:41:33,337 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:33,337 INFO  L471      AbstractCegarLoop]: Abstraction has 1565 states and 2327 transitions.
[2025-03-08 09:41:33,337 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:33,337 INFO  L276                IsEmpty]: Start isEmpty. Operand 1565 states and 2327 transitions.
[2025-03-08 09:41:33,338 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 136
[2025-03-08 09:41:33,338 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:33,338 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:33,338 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-08 09:41:33,338 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:33,338 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:33,338 INFO  L85        PathProgramCache]: Analyzing trace with hash -353180219, now seen corresponding path program 1 times
[2025-03-08 09:41:33,338 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:33,338 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622384749]
[2025-03-08 09:41:33,338 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:33,338 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:33,427 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes.
[2025-03-08 09:41:34,150 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements.
[2025-03-08 09:41:34,150 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:34,150 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:35,200 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:35,200 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:35,200 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622384749]
[2025-03-08 09:41:35,200 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622384749] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:35,201 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:35,201 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:41:35,201 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826515641]
[2025-03-08 09:41:35,201 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:35,201 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:41:35,201 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:35,201 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:41:35,201 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:41:35,201 INFO  L87              Difference]: Start difference. First operand 1565 states and 2327 transitions. Second operand  has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:35,679 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:35,680 INFO  L93              Difference]: Finished difference Result 3062 states and 4553 transitions.
[2025-03-08 09:41:35,680 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:41:35,680 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135
[2025-03-08 09:41:35,680 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:35,682 INFO  L225             Difference]: With dead ends: 3062
[2025-03-08 09:41:35,682 INFO  L226             Difference]: Without dead ends: 1567
[2025-03-08 09:41:35,684 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:41:35,684 INFO  L435           NwaCegarLoop]: 1819 mSDtfsCounter, 2157 mSDsluCounter, 3630 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2157 SdHoareTripleChecker+Valid, 5449 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:35,684 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2157 Valid, 5449 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:41:35,686 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1567 states.
[2025-03-08 09:41:35,695 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1567.
[2025-03-08 09:41:35,696 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1567 states, 1566 states have (on average 1.487228607918263) internal successors, (2329), 1566 states have internal predecessors, (2329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:35,697 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2329 transitions.
[2025-03-08 09:41:35,697 INFO  L78                 Accepts]: Start accepts. Automaton has 1567 states and 2329 transitions. Word has length 135
[2025-03-08 09:41:35,698 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:35,698 INFO  L471      AbstractCegarLoop]: Abstraction has 1567 states and 2329 transitions.
[2025-03-08 09:41:35,698 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:35,698 INFO  L276                IsEmpty]: Start isEmpty. Operand 1567 states and 2329 transitions.
[2025-03-08 09:41:35,698 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 137
[2025-03-08 09:41:35,698 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:35,698 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:35,698 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-03-08 09:41:35,699 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:35,699 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:35,699 INFO  L85        PathProgramCache]: Analyzing trace with hash -504260227, now seen corresponding path program 1 times
[2025-03-08 09:41:35,699 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:35,699 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57764276]
[2025-03-08 09:41:35,699 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:35,699 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:35,794 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes.
[2025-03-08 09:41:36,420 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements.
[2025-03-08 09:41:36,420 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:36,420 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:37,586 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:37,586 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:37,586 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57764276]
[2025-03-08 09:41:37,586 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57764276] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:37,586 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:37,586 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-08 09:41:37,586 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142999090]
[2025-03-08 09:41:37,586 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:37,587 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-08 09:41:37,587 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:37,587 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-08 09:41:37,587 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:41:37,587 INFO  L87              Difference]: Start difference. First operand 1567 states and 2329 transitions. Second operand  has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:38,352 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:38,353 INFO  L93              Difference]: Finished difference Result 3072 states and 4565 transitions.
[2025-03-08 09:41:38,355 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-08 09:41:38,355 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136
[2025-03-08 09:41:38,356 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:38,358 INFO  L225             Difference]: With dead ends: 3072
[2025-03-08 09:41:38,358 INFO  L226             Difference]: Without dead ends: 1575
[2025-03-08 09:41:38,359 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72
[2025-03-08 09:41:38,360 INFO  L435           NwaCegarLoop]: 1819 mSDtfsCounter, 2168 mSDsluCounter, 7261 mSDsCounter, 0 mSdLazyCounter, 1924 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2168 SdHoareTripleChecker+Valid, 9080 SdHoareTripleChecker+Invalid, 1925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:38,360 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2168 Valid, 9080 Invalid, 1925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1924 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 09:41:38,361 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1575 states.
[2025-03-08 09:41:38,369 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1571.
[2025-03-08 09:41:38,369 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1571 states, 1570 states have (on average 1.4872611464968153) internal successors, (2335), 1570 states have internal predecessors, (2335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:38,371 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2335 transitions.
[2025-03-08 09:41:38,371 INFO  L78                 Accepts]: Start accepts. Automaton has 1571 states and 2335 transitions. Word has length 136
[2025-03-08 09:41:38,371 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:38,371 INFO  L471      AbstractCegarLoop]: Abstraction has 1571 states and 2335 transitions.
[2025-03-08 09:41:38,371 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 19.428571428571427) internal successors, (136), 7 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:38,371 INFO  L276                IsEmpty]: Start isEmpty. Operand 1571 states and 2335 transitions.
[2025-03-08 09:41:38,372 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 138
[2025-03-08 09:41:38,372 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:38,372 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:38,373 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-03-08 09:41:38,373 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:38,373 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:38,373 INFO  L85        PathProgramCache]: Analyzing trace with hash -572711296, now seen corresponding path program 1 times
[2025-03-08 09:41:38,373 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:38,374 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484582879]
[2025-03-08 09:41:38,374 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:38,374 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:38,458 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes.
[2025-03-08 09:41:39,151 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements.
[2025-03-08 09:41:39,151 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:39,151 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:40,192 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:40,192 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:40,192 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484582879]
[2025-03-08 09:41:40,192 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484582879] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:40,192 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:40,192 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 09:41:40,192 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232670884]
[2025-03-08 09:41:40,192 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:40,193 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 09:41:40,193 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:40,193 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 09:41:40,193 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:41:40,193 INFO  L87              Difference]: Start difference. First operand 1571 states and 2335 transitions. Second operand  has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:40,866 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:40,866 INFO  L93              Difference]: Finished difference Result 3076 states and 4571 transitions.
[2025-03-08 09:41:40,866 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:41:40,866 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137
[2025-03-08 09:41:40,866 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:40,868 INFO  L225             Difference]: With dead ends: 3076
[2025-03-08 09:41:40,868 INFO  L226             Difference]: Without dead ends: 1575
[2025-03-08 09:41:40,869 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:41:40,870 INFO  L435           NwaCegarLoop]: 1819 mSDtfsCounter, 2138 mSDsluCounter, 5444 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2138 SdHoareTripleChecker+Valid, 7263 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:40,870 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2138 Valid, 7263 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 09:41:40,871 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1575 states.
[2025-03-08 09:41:40,880 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1571.
[2025-03-08 09:41:40,881 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1571 states, 1570 states have (on average 1.4872611464968153) internal successors, (2335), 1570 states have internal predecessors, (2335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:40,883 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2335 transitions.
[2025-03-08 09:41:40,883 INFO  L78                 Accepts]: Start accepts. Automaton has 1571 states and 2335 transitions. Word has length 137
[2025-03-08 09:41:40,883 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:40,883 INFO  L471      AbstractCegarLoop]: Abstraction has 1571 states and 2335 transitions.
[2025-03-08 09:41:40,883 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:40,884 INFO  L276                IsEmpty]: Start isEmpty. Operand 1571 states and 2335 transitions.
[2025-03-08 09:41:40,884 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 139
[2025-03-08 09:41:40,884 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:40,885 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:40,885 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-03-08 09:41:40,885 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:40,885 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:40,885 INFO  L85        PathProgramCache]: Analyzing trace with hash -452345406, now seen corresponding path program 1 times
[2025-03-08 09:41:40,885 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:40,885 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052834744]
[2025-03-08 09:41:40,885 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:40,886 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:41,011 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes.
[2025-03-08 09:41:41,908 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements.
[2025-03-08 09:41:41,909 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:41,909 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:42,988 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:42,989 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:42,989 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052834744]
[2025-03-08 09:41:42,989 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052834744] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:42,989 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:42,989 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:41:42,989 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645545930]
[2025-03-08 09:41:42,989 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:42,989 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:41:42,989 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:42,990 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:41:42,990 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:41:42,990 INFO  L87              Difference]: Start difference. First operand 1571 states and 2335 transitions. Second operand  has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:43,485 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:43,485 INFO  L93              Difference]: Finished difference Result 3076 states and 4571 transitions.
[2025-03-08 09:41:43,485 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:41:43,485 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138
[2025-03-08 09:41:43,485 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:43,487 INFO  L225             Difference]: With dead ends: 3076
[2025-03-08 09:41:43,487 INFO  L226             Difference]: Without dead ends: 1575
[2025-03-08 09:41:43,489 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:41:43,489 INFO  L435           NwaCegarLoop]: 1819 mSDtfsCounter, 2132 mSDsluCounter, 3631 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2132 SdHoareTripleChecker+Valid, 5450 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:43,489 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2132 Valid, 5450 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-08 09:41:43,490 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1575 states.
[2025-03-08 09:41:43,498 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1571.
[2025-03-08 09:41:43,499 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1571 states, 1570 states have (on average 1.4872611464968153) internal successors, (2335), 1570 states have internal predecessors, (2335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:43,500 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2335 transitions.
[2025-03-08 09:41:43,500 INFO  L78                 Accepts]: Start accepts. Automaton has 1571 states and 2335 transitions. Word has length 138
[2025-03-08 09:41:43,500 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:43,500 INFO  L471      AbstractCegarLoop]: Abstraction has 1571 states and 2335 transitions.
[2025-03-08 09:41:43,500 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 27.6) internal successors, (138), 5 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:43,500 INFO  L276                IsEmpty]: Start isEmpty. Operand 1571 states and 2335 transitions.
[2025-03-08 09:41:43,501 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 140
[2025-03-08 09:41:43,501 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:43,501 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:43,501 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-03-08 09:41:43,501 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:43,501 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:43,501 INFO  L85        PathProgramCache]: Analyzing trace with hash -611908384, now seen corresponding path program 1 times
[2025-03-08 09:41:43,501 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:43,501 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722923448]
[2025-03-08 09:41:43,502 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:43,502 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:43,597 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes.
[2025-03-08 09:41:44,838 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements.
[2025-03-08 09:41:44,839 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:44,839 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:45,911 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:45,911 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:45,911 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722923448]
[2025-03-08 09:41:45,911 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722923448] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:45,911 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:45,911 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:41:45,911 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107933028]
[2025-03-08 09:41:45,911 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:45,911 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:41:45,911 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:45,911 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:41:45,912 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:41:45,912 INFO  L87              Difference]: Start difference. First operand 1571 states and 2335 transitions. Second operand  has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:46,364 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:46,364 INFO  L93              Difference]: Finished difference Result 3076 states and 4571 transitions.
[2025-03-08 09:41:46,365 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:41:46,365 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 139
[2025-03-08 09:41:46,365 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:46,366 INFO  L225             Difference]: With dead ends: 3076
[2025-03-08 09:41:46,366 INFO  L226             Difference]: Without dead ends: 1575
[2025-03-08 09:41:46,368 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:41:46,368 INFO  L435           NwaCegarLoop]: 1819 mSDtfsCounter, 2126 mSDsluCounter, 3631 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2126 SdHoareTripleChecker+Valid, 5450 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:46,368 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2126 Valid, 5450 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:41:46,369 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1575 states.
[2025-03-08 09:41:46,376 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1571.
[2025-03-08 09:41:46,377 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1571 states, 1570 states have (on average 1.4872611464968153) internal successors, (2335), 1570 states have internal predecessors, (2335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:46,378 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2335 transitions.
[2025-03-08 09:41:46,378 INFO  L78                 Accepts]: Start accepts. Automaton has 1571 states and 2335 transitions. Word has length 139
[2025-03-08 09:41:46,378 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:46,378 INFO  L471      AbstractCegarLoop]: Abstraction has 1571 states and 2335 transitions.
[2025-03-08 09:41:46,379 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:46,379 INFO  L276                IsEmpty]: Start isEmpty. Operand 1571 states and 2335 transitions.
[2025-03-08 09:41:46,379 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 141
[2025-03-08 09:41:46,379 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:46,379 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:46,379 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-03-08 09:41:46,380 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:46,380 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:46,380 INFO  L85        PathProgramCache]: Analyzing trace with hash 443437922, now seen corresponding path program 1 times
[2025-03-08 09:41:46,380 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:46,380 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533004475]
[2025-03-08 09:41:46,380 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:46,380 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:46,477 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes.
[2025-03-08 09:41:47,558 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements.
[2025-03-08 09:41:47,558 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:47,558 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:48,680 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:48,681 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:48,681 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533004475]
[2025-03-08 09:41:48,681 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533004475] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:48,681 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:48,681 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-08 09:41:48,681 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570565162]
[2025-03-08 09:41:48,681 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:48,681 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-08 09:41:48,681 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:48,681 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-08 09:41:48,682 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:41:48,682 INFO  L87              Difference]: Start difference. First operand 1571 states and 2335 transitions. Second operand  has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:49,288 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:49,289 INFO  L93              Difference]: Finished difference Result 3076 states and 4571 transitions.
[2025-03-08 09:41:49,289 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:41:49,289 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140
[2025-03-08 09:41:49,289 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:49,291 INFO  L225             Difference]: With dead ends: 3076
[2025-03-08 09:41:49,291 INFO  L226             Difference]: Without dead ends: 1575
[2025-03-08 09:41:49,292 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2025-03-08 09:41:49,292 INFO  L435           NwaCegarLoop]: 1819 mSDtfsCounter, 2115 mSDsluCounter, 5444 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2115 SdHoareTripleChecker+Valid, 7263 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:49,293 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2115 Valid, 7263 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-08 09:41:49,294 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1575 states.
[2025-03-08 09:41:49,300 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1571.
[2025-03-08 09:41:49,301 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1571 states, 1570 states have (on average 1.4872611464968153) internal successors, (2335), 1570 states have internal predecessors, (2335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:49,302 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2335 transitions.
[2025-03-08 09:41:49,302 INFO  L78                 Accepts]: Start accepts. Automaton has 1571 states and 2335 transitions. Word has length 140
[2025-03-08 09:41:49,302 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:49,302 INFO  L471      AbstractCegarLoop]: Abstraction has 1571 states and 2335 transitions.
[2025-03-08 09:41:49,303 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:49,303 INFO  L276                IsEmpty]: Start isEmpty. Operand 1571 states and 2335 transitions.
[2025-03-08 09:41:49,303 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 142
[2025-03-08 09:41:49,303 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:49,303 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:49,303 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2025-03-08 09:41:49,304 INFO  L396      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:49,304 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:49,304 INFO  L85        PathProgramCache]: Analyzing trace with hash -735477472, now seen corresponding path program 1 times
[2025-03-08 09:41:49,304 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:49,304 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943245899]
[2025-03-08 09:41:49,304 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:49,304 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:49,396 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes.
[2025-03-08 09:41:50,366 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements.
[2025-03-08 09:41:50,366 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:50,366 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:51,340 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:51,341 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:51,341 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943245899]
[2025-03-08 09:41:51,341 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943245899] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:51,341 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:51,341 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:41:51,341 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656032735]
[2025-03-08 09:41:51,341 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:51,341 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:41:51,341 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:51,341 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:41:51,341 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:41:51,342 INFO  L87              Difference]: Start difference. First operand 1571 states and 2335 transitions. Second operand  has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:51,787 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:51,788 INFO  L93              Difference]: Finished difference Result 3076 states and 4571 transitions.
[2025-03-08 09:41:51,788 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:41:51,788 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141
[2025-03-08 09:41:51,788 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:51,790 INFO  L225             Difference]: With dead ends: 3076
[2025-03-08 09:41:51,790 INFO  L226             Difference]: Without dead ends: 1575
[2025-03-08 09:41:51,791 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2025-03-08 09:41:51,791 INFO  L435           NwaCegarLoop]: 1819 mSDtfsCounter, 2120 mSDsluCounter, 3631 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2120 SdHoareTripleChecker+Valid, 5450 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:51,792 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2120 Valid, 5450 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-08 09:41:51,793 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1575 states.
[2025-03-08 09:41:51,802 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1571.
[2025-03-08 09:41:51,804 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1571 states, 1570 states have (on average 1.4872611464968153) internal successors, (2335), 1570 states have internal predecessors, (2335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:51,805 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2335 transitions.
[2025-03-08 09:41:51,805 INFO  L78                 Accepts]: Start accepts. Automaton has 1571 states and 2335 transitions. Word has length 141
[2025-03-08 09:41:51,805 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:51,805 INFO  L471      AbstractCegarLoop]: Abstraction has 1571 states and 2335 transitions.
[2025-03-08 09:41:51,805 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:51,805 INFO  L276                IsEmpty]: Start isEmpty. Operand 1571 states and 2335 transitions.
[2025-03-08 09:41:51,806 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 143
[2025-03-08 09:41:51,806 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:51,806 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:51,806 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2025-03-08 09:41:51,806 INFO  L396      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:51,807 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:51,807 INFO  L85        PathProgramCache]: Analyzing trace with hash -969583358, now seen corresponding path program 1 times
[2025-03-08 09:41:51,807 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:51,807 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81255724]
[2025-03-08 09:41:51,807 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:51,807 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:51,907 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes.
[2025-03-08 09:41:52,393 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements.
[2025-03-08 09:41:52,393 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:41:52,393 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:41:54,491 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:41:54,491 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:41:54,491 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81255724]
[2025-03-08 09:41:54,491 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81255724] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:41:54,491 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:41:54,491 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:41:54,491 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995595065]
[2025-03-08 09:41:54,491 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:41:54,491 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:41:54,491 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:41:54,492 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:41:54,492 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:41:54,492 INFO  L87              Difference]: Start difference. First operand 1571 states and 2335 transitions. Second operand  has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:55,373 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:41:55,373 INFO  L93              Difference]: Finished difference Result 3533 states and 5239 transitions.
[2025-03-08 09:41:55,374 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-08 09:41:55,374 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142
[2025-03-08 09:41:55,374 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:41:55,377 INFO  L225             Difference]: With dead ends: 3533
[2025-03-08 09:41:55,377 INFO  L226             Difference]: Without dead ends: 2032
[2025-03-08 09:41:55,378 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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:41:55,378 INFO  L435           NwaCegarLoop]: 1643 mSDtfsCounter, 3494 mSDsluCounter, 3283 mSDsCounter, 0 mSdLazyCounter, 1677 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3494 SdHoareTripleChecker+Valid, 4926 SdHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-08 09:41:55,379 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3494 Valid, 4926 Invalid, 1678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1677 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-08 09:41:55,380 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2032 states.
[2025-03-08 09:41:55,390 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1589.
[2025-03-08 09:41:55,391 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1589 states, 1588 states have (on average 1.4867758186397986) internal successors, (2361), 1588 states have internal predecessors, (2361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:55,393 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2361 transitions.
[2025-03-08 09:41:55,393 INFO  L78                 Accepts]: Start accepts. Automaton has 1589 states and 2361 transitions. Word has length 142
[2025-03-08 09:41:55,394 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:41:55,394 INFO  L471      AbstractCegarLoop]: Abstraction has 1589 states and 2361 transitions.
[2025-03-08 09:41:55,394 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 28.4) internal successors, (142), 5 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:41:55,394 INFO  L276                IsEmpty]: Start isEmpty. Operand 1589 states and 2361 transitions.
[2025-03-08 09:41:55,398 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 842
[2025-03-08 09:41:55,398 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:41:55,398 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:55,399 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2025-03-08 09:41:55,399 INFO  L396      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:41:55,399 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:41:55,399 INFO  L85        PathProgramCache]: Analyzing trace with hash 1232046228, now seen corresponding path program 1 times
[2025-03-08 09:41:55,399 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:41:55,399 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144053173]
[2025-03-08 09:41:55,400 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:41:55,400 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:41:55,651 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 841 statements into 1 equivalence classes.
[2025-03-08 09:42:02,893 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 841 of 841 statements.
[2025-03-08 09:42:02,893 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-08 09:42:02,893 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-08 09:42:04,535 INFO  L134       CoverageAnalysis]: Checked inductivity of 78 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-03-08 09:42:04,535 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-08 09:42:04,535 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144053173]
[2025-03-08 09:42:04,535 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144053173] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-08 09:42:04,535 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-08 09:42:04,535 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-08 09:42:04,535 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649542748]
[2025-03-08 09:42:04,535 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-08 09:42:04,536 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-08 09:42:04,536 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-08 09:42:04,536 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-08 09:42:04,536 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-08 09:42:04,537 INFO  L87              Difference]: Start difference. First operand 1589 states and 2361 transitions. Second operand  has 5 states, 5 states have (on average 168.2) internal successors, (841), 5 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:42:05,295 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-08 09:42:05,296 INFO  L93              Difference]: Finished difference Result 4415 states and 6561 transitions.
[2025-03-08 09:42:05,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-08 09:42:05,296 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 168.2) internal successors, (841), 5 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 841
[2025-03-08 09:42:05,297 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-08 09:42:05,299 INFO  L225             Difference]: With dead ends: 4415
[2025-03-08 09:42:05,299 INFO  L226             Difference]: Without dead ends: 1593
[2025-03-08 09:42:05,302 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:42:05,305 INFO  L435           NwaCegarLoop]: 2034 mSDtfsCounter, 1372 mSDsluCounter, 5749 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1372 SdHoareTripleChecker+Valid, 7783 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-08 09:42:05,305 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1372 Valid, 7783 Invalid, 1799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1780 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-08 09:42:05,307 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1593 states.
[2025-03-08 09:42:05,318 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1591.
[2025-03-08 09:42:05,319 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1591 states, 1590 states have (on average 1.4861635220125786) internal successors, (2363), 1590 states have internal predecessors, (2363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:42:05,321 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2363 transitions.
[2025-03-08 09:42:05,322 INFO  L78                 Accepts]: Start accepts. Automaton has 1591 states and 2363 transitions. Word has length 841
[2025-03-08 09:42:05,322 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-08 09:42:05,322 INFO  L471      AbstractCegarLoop]: Abstraction has 1591 states and 2363 transitions.
[2025-03-08 09:42:05,322 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 168.2) internal successors, (841), 5 states have internal predecessors, (841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-08 09:42:05,323 INFO  L276                IsEmpty]: Start isEmpty. Operand 1591 states and 2363 transitions.
[2025-03-08 09:42:05,327 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 843
[2025-03-08 09:42:05,327 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-08 09:42:05,328 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:05,328 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2025-03-08 09:42:05,328 INFO  L396      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-08 09:42:05,328 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-08 09:42:05,329 INFO  L85        PathProgramCache]: Analyzing trace with hash 1870935934, now seen corresponding path program 1 times
[2025-03-08 09:42:05,329 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-08 09:42:05,329 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355816391]
[2025-03-08 09:42:05,329 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-08 09:42:05,329 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-08 09:42:05,583 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 842 statements into 1 equivalence classes.