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


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


Checking for ERROR reachability
Using default analysis
Version 8fc3dc66
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.cal19.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 c02d5db5546e08fe12cd31c9475129f9cc962e266153662a7cb90b275170067a
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-8fc3dc6-m
[2025-03-16 21:18:31,989 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-03-16 21:18:32,034 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2025-03-16 21:18:32,039 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-03-16 21:18:32,039 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-03-16 21:18:32,060 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-03-16 21:18:32,061 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-03-16 21:18:32,061 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-03-16 21:18:32,061 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-03-16 21:18:32,061 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-03-16 21:18:32,061 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-03-16 21:18:32,061 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-03-16 21:18:32,061 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-03-16 21:18:32,061 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-03-16 21:18:32,061 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-03-16 21:18:32,061 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-03-16 21:18:32,061 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-03-16 21:18:32,062 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-03-16 21:18:32,062 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-03-16 21:18:32,062 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-03-16 21:18:32,062 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-03-16 21:18:32,062 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-03-16 21:18:32,062 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-03-16 21:18:32,062 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-03-16 21:18:32,062 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-03-16 21:18:32,062 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-03-16 21:18:32,062 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-03-16 21:18:32,062 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-03-16 21:18:32,062 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-03-16 21:18:32,062 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 21:18:32,062 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-03-16 21:18:32,062 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-03-16 21:18:32,064 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-03-16 21:18:32,064 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-03-16 21:18:32,064 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-03-16 21:18:32,064 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-03-16 21:18:32,064 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-03-16 21:18:32,064 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-03-16 21:18:32,064 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-03-16 21:18:32,064 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-03-16 21:18:32,064 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 -> c02d5db5546e08fe12cd31c9475129f9cc962e266153662a7cb90b275170067a
[2025-03-16 21:18:32,302 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-03-16 21:18:32,311 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-03-16 21:18:32,314 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-03-16 21:18:32,315 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-03-16 21:18:32,315 INFO  L274        PluginConnector]: CDTParser initialized
[2025-03-16 21:18:32,316 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal19.c
[2025-03-16 21:18:33,496 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c8a68a41/3e1c6d584ae2496a9089238aedc32987/FLAG233741f0f
[2025-03-16 21:18:33,809 INFO  L384              CDTParser]: Found 1 translation units.
[2025-03-16 21:18:33,811 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal19.c
[2025-03-16 21:18:33,827 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c8a68a41/3e1c6d584ae2496a9089238aedc32987/FLAG233741f0f
[2025-03-16 21:18:33,842 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c8a68a41/3e1c6d584ae2496a9089238aedc32987
[2025-03-16 21:18:33,844 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-03-16 21:18:33,845 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-03-16 21:18:33,847 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-03-16 21:18:33,847 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-03-16 21:18:33,851 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-03-16 21:18:33,852 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:18:33" (1/1) ...
[2025-03-16 21:18:33,854 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38fad0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:18:33, skipping insertion in model container
[2025-03-16 21:18:33,854 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 09:18:33" (1/1) ...
[2025-03-16 21:18:33,894 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-03-16 21:18:34,031 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.cal19.c[1245,1258]
[2025-03-16 21:18:34,253 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 21:18:34,259 INFO  L200         MainTranslator]: Completed pre-run
[2025-03-16 21:18:34,265 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.cal19.c[1245,1258]
[2025-03-16 21:18:34,376 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-03-16 21:18:34,387 INFO  L204         MainTranslator]: Completed translation
[2025-03-16 21:18:34,387 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:18:34 WrapperNode
[2025-03-16 21:18:34,387 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-03-16 21:18:34,388 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-03-16 21:18:34,388 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-03-16 21:18:34,388 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-03-16 21:18:34,392 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:18:34" (1/1) ...
[2025-03-16 21:18:34,432 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:18:34" (1/1) ...
[2025-03-16 21:18:34,727 INFO  L138                Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3557
[2025-03-16 21:18:34,728 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-03-16 21:18:34,728 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-03-16 21:18:34,728 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-03-16 21:18:34,728 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-03-16 21:18:34,734 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:18:34" (1/1) ...
[2025-03-16 21:18:34,734 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:18:34" (1/1) ...
[2025-03-16 21:18:34,776 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:18:34" (1/1) ...
[2025-03-16 21:18:34,884 INFO  L175           MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0].
[2025-03-16 21:18:34,885 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:18:34" (1/1) ...
[2025-03-16 21:18:34,885 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:18:34" (1/1) ...
[2025-03-16 21:18:34,953 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:18:34" (1/1) ...
[2025-03-16 21:18:34,969 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:18:34" (1/1) ...
[2025-03-16 21:18:34,991 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:18:34" (1/1) ...
[2025-03-16 21:18:35,006 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:18:34" (1/1) ...
[2025-03-16 21:18:35,040 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-03-16 21:18:35,041 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-03-16 21:18:35,042 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-03-16 21:18:35,042 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-03-16 21:18:35,055 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:18:34" (1/1) ...
[2025-03-16 21:18:35,063 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-03-16 21:18:35,073 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-03-16 21:18:35,089 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-16 21:18:35,091 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-16 21:18:35,108 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-03-16 21:18:35,108 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-03-16 21:18:35,108 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2025-03-16 21:18:35,108 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-03-16 21:18:35,108 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-03-16 21:18:35,419 INFO  L256             CfgBuilder]: Building ICFG
[2025-03-16 21:18:35,420 INFO  L286             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-03-16 21:18:38,346 INFO  L?                        ?]: Removed 1993 outVars from TransFormulas that were not future-live.
[2025-03-16 21:18:38,347 INFO  L307             CfgBuilder]: Performing block encoding
[2025-03-16 21:18:38,458 INFO  L331             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-03-16 21:18:38,459 INFO  L336             CfgBuilder]: Removed 0 assume(true) statements.
[2025-03-16 21:18:38,459 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:18:38 BoogieIcfgContainer
[2025-03-16 21:18:38,459 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-03-16 21:18:38,461 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-03-16 21:18:38,461 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-03-16 21:18:38,465 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-03-16 21:18:38,466 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 09:18:33" (1/3) ...
[2025-03-16 21:18:38,466 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a34592e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:18:38, skipping insertion in model container
[2025-03-16 21:18:38,466 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 09:18:34" (2/3) ...
[2025-03-16 21:18:38,467 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a34592e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 09:18:38, skipping insertion in model container
[2025-03-16 21:18:38,467 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 09:18:38" (3/3) ...
[2025-03-16 21:18:38,468 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal19.c
[2025-03-16 21:18:38,481 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-03-16 21:18:38,483 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.cal19.c that has 1 procedures, 1059 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-03-16 21:18:38,550 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-03-16 21:18:38,560 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;@31c1ef34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-03-16 21:18:38,560 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-03-16 21:18:38,568 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 1059 states, 1057 states have (on average 1.5014191106906338) internal successors, (1587), 1058 states have internal predecessors, (1587), 0 states have call successors, (0), 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-16 21:18:38,591 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 333
[2025-03-16 21:18:38,591 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:18:38,592 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:18:38,592 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:18:38,599 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:18:38,600 INFO  L85        PathProgramCache]: Analyzing trace with hash -1613491368, now seen corresponding path program 1 times
[2025-03-16 21:18:38,607 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:18:38,610 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835107410]
[2025-03-16 21:18:38,610 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:18:38,611 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:18:38,786 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 332 statements into 1 equivalence classes.
[2025-03-16 21:18:39,333 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 332 of 332 statements.
[2025-03-16 21:18:39,334 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:18:39,335 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:18:40,786 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-16 21:18:40,786 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:18:40,787 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835107410]
[2025-03-16 21:18:40,787 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835107410] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:18:40,788 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:18:40,788 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 21:18:40,789 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6488294]
[2025-03-16 21:18:40,789 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:18:40,793 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 21:18:40,794 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:18:40,810 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 21:18:40,810 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:18:40,814 INFO  L87              Difference]: Start difference. First operand  has 1059 states, 1057 states have (on average 1.5014191106906338) internal successors, (1587), 1058 states have internal predecessors, (1587), 0 states have call successors, (0), 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 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 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-16 21:18:41,511 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:18:41,512 INFO  L93              Difference]: Finished difference Result 2089 states and 3133 transitions.
[2025-03-16 21:18:41,514 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:18:41,515 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 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 332
[2025-03-16 21:18:41,516 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:18:41,532 INFO  L225             Difference]: With dead ends: 2089
[2025-03-16 21:18:41,532 INFO  L226             Difference]: Without dead ends: 1059
[2025-03-16 21:18:41,538 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-16 21:18:41,541 INFO  L435           NwaCegarLoop]: 1320 mSDtfsCounter, 0 mSDsluCounter, 2635 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3955 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-16 21:18:41,541 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3955 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-16 21:18:41,553 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1059 states.
[2025-03-16 21:18:41,585 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1059.
[2025-03-16 21:18:41,587 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1059 states, 1058 states have (on average 1.4990548204158791) internal successors, (1586), 1058 states have internal predecessors, (1586), 0 states have call successors, (0), 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-16 21:18:41,592 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1586 transitions.
[2025-03-16 21:18:41,593 INFO  L78                 Accepts]: Start accepts. Automaton has 1059 states and 1586 transitions. Word has length 332
[2025-03-16 21:18:41,593 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:18:41,593 INFO  L471      AbstractCegarLoop]: Abstraction has 1059 states and 1586 transitions.
[2025-03-16 21:18:41,594 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 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-16 21:18:41,594 INFO  L276                IsEmpty]: Start isEmpty. Operand 1059 states and 1586 transitions.
[2025-03-16 21:18:41,597 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 334
[2025-03-16 21:18:41,597 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:18:41,598 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:18:41,598 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-03-16 21:18:41,598 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:18:41,599 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:18:41,601 INFO  L85        PathProgramCache]: Analyzing trace with hash 1526054973, now seen corresponding path program 1 times
[2025-03-16 21:18:41,601 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:18:41,601 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155255635]
[2025-03-16 21:18:41,601 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:18:41,601 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:18:41,678 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes.
[2025-03-16 21:18:41,791 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements.
[2025-03-16 21:18:41,792 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:18:41,792 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:18:42,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-16 21:18:42,422 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:18:42,422 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155255635]
[2025-03-16 21:18:42,422 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155255635] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:18:42,422 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:18:42,423 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 21:18:42,423 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362281180]
[2025-03-16 21:18:42,423 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:18:42,424 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 21:18:42,424 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:18:42,424 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 21:18:42,425 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:18:42,425 INFO  L87              Difference]: Start difference. First operand 1059 states and 1586 transitions. Second operand  has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 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-16 21:18:42,846 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:18:42,846 INFO  L93              Difference]: Finished difference Result 2091 states and 3132 transitions.
[2025-03-16 21:18:42,847 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:18:42,847 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 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 333
[2025-03-16 21:18:42,848 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:18:42,851 INFO  L225             Difference]: With dead ends: 2091
[2025-03-16 21:18:42,851 INFO  L226             Difference]: Without dead ends: 1061
[2025-03-16 21:18:42,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-16 21:18:42,853 INFO  L435           NwaCegarLoop]: 1320 mSDtfsCounter, 0 mSDsluCounter, 2632 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3952 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-16 21:18:42,853 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3952 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-16 21:18:42,854 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1061 states.
[2025-03-16 21:18:42,866 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1061.
[2025-03-16 21:18:42,868 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1061 states, 1060 states have (on average 1.4981132075471697) internal successors, (1588), 1060 states have internal predecessors, (1588), 0 states have call successors, (0), 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-16 21:18:42,870 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1588 transitions.
[2025-03-16 21:18:42,871 INFO  L78                 Accepts]: Start accepts. Automaton has 1061 states and 1588 transitions. Word has length 333
[2025-03-16 21:18:42,871 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:18:42,871 INFO  L471      AbstractCegarLoop]: Abstraction has 1061 states and 1588 transitions.
[2025-03-16 21:18:42,871 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 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-16 21:18:42,872 INFO  L276                IsEmpty]: Start isEmpty. Operand 1061 states and 1588 transitions.
[2025-03-16 21:18:42,874 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 335
[2025-03-16 21:18:42,874 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:18:42,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:18:42,875 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-03-16 21:18:42,875 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:18:42,875 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:18:42,875 INFO  L85        PathProgramCache]: Analyzing trace with hash 1994573811, now seen corresponding path program 1 times
[2025-03-16 21:18:42,875 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:18:42,875 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610803829]
[2025-03-16 21:18:42,876 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:18:42,876 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:18:42,941 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 334 statements into 1 equivalence classes.
[2025-03-16 21:18:44,388 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 334 of 334 statements.
[2025-03-16 21:18:44,388 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:18:44,388 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:18:45,921 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-16 21:18:45,921 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:18:45,921 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610803829]
[2025-03-16 21:18:45,921 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610803829] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:18:45,921 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:18:45,921 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 21:18:45,922 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161581048]
[2025-03-16 21:18:45,922 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:18:45,922 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-16 21:18:45,922 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:18:45,923 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-16 21:18:45,923 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2025-03-16 21:18:45,923 INFO  L87              Difference]: Start difference. First operand 1061 states and 1588 transitions. Second operand  has 6 states, 6 states have (on average 55.666666666666664) internal successors, (334), 5 states have internal predecessors, (334), 0 states have call successors, (0), 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-16 21:18:46,775 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:18:46,775 INFO  L93              Difference]: Finished difference Result 2733 states and 4090 transitions.
[2025-03-16 21:18:46,780 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-16 21:18:46,780 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 55.666666666666664) internal successors, (334), 5 states have internal predecessors, (334), 0 states have call successors, (0), 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 334
[2025-03-16 21:18:46,781 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:18:46,787 INFO  L225             Difference]: With dead ends: 2733
[2025-03-16 21:18:46,787 INFO  L226             Difference]: Without dead ends: 1701
[2025-03-16 21:18:46,789 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72
[2025-03-16 21:18:46,791 INFO  L435           NwaCegarLoop]: 1301 mSDtfsCounter, 4049 mSDsluCounter, 3903 mSDsCounter, 0 mSdLazyCounter, 1131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4049 SdHoareTripleChecker+Valid, 5204 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-16 21:18:46,792 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4049 Valid, 5204 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1131 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-16 21:18:46,795 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1701 states.
[2025-03-16 21:18:46,825 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1682.
[2025-03-16 21:18:46,827 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1682 states, 1681 states have (on average 1.4991076740035694) internal successors, (2520), 1681 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 21:18:46,831 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2520 transitions.
[2025-03-16 21:18:46,831 INFO  L78                 Accepts]: Start accepts. Automaton has 1682 states and 2520 transitions. Word has length 334
[2025-03-16 21:18:46,832 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:18:46,832 INFO  L471      AbstractCegarLoop]: Abstraction has 1682 states and 2520 transitions.
[2025-03-16 21:18:46,832 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 55.666666666666664) internal successors, (334), 5 states have internal predecessors, (334), 0 states have call successors, (0), 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-16 21:18:46,832 INFO  L276                IsEmpty]: Start isEmpty. Operand 1682 states and 2520 transitions.
[2025-03-16 21:18:46,836 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 336
[2025-03-16 21:18:46,836 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:18:46,836 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:18:46,836 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-03-16 21:18:46,836 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:18:46,837 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:18:46,837 INFO  L85        PathProgramCache]: Analyzing trace with hash -704358110, now seen corresponding path program 1 times
[2025-03-16 21:18:46,838 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:18:46,838 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319598684]
[2025-03-16 21:18:46,838 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:18:46,838 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:18:46,912 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes.
[2025-03-16 21:18:48,013 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements.
[2025-03-16 21:18:48,013 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:18:48,013 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:18:49,064 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-16 21:18:49,064 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:18:49,064 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319598684]
[2025-03-16 21:18:49,065 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319598684] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:18:49,065 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:18:49,065 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-16 21:18:49,065 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272520123]
[2025-03-16 21:18:49,065 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:18:49,065 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-16 21:18:49,065 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:18:49,066 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-16 21:18:49,066 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-03-16 21:18:49,066 INFO  L87              Difference]: Start difference. First operand 1682 states and 2520 transitions. Second operand  has 8 states, 8 states have (on average 41.875) internal successors, (335), 7 states have internal predecessors, (335), 0 states have call successors, (0), 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-16 21:18:50,056 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:18:50,057 INFO  L93              Difference]: Finished difference Result 2735 states and 4092 transitions.
[2025-03-16 21:18:50,057 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-16 21:18:50,057 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 41.875) internal successors, (335), 7 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 335
[2025-03-16 21:18:50,058 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:18:50,063 INFO  L225             Difference]: With dead ends: 2735
[2025-03-16 21:18:50,063 INFO  L226             Difference]: Without dead ends: 1703
[2025-03-16 21:18:50,064 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156
[2025-03-16 21:18:50,065 INFO  L435           NwaCegarLoop]: 1300 mSDtfsCounter, 4052 mSDsluCounter, 6495 mSDsCounter, 0 mSdLazyCounter, 1708 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4052 SdHoareTripleChecker+Valid, 7795 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-16 21:18:50,065 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4052 Valid, 7795 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1708 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-16 21:18:50,067 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1703 states.
[2025-03-16 21:18:50,086 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1685.
[2025-03-16 21:18:50,089 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1685 states, 1684 states have (on average 1.498812351543943) internal successors, (2524), 1684 states have internal predecessors, (2524), 0 states have call successors, (0), 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-16 21:18:50,093 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 2524 transitions.
[2025-03-16 21:18:50,094 INFO  L78                 Accepts]: Start accepts. Automaton has 1685 states and 2524 transitions. Word has length 335
[2025-03-16 21:18:50,095 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:18:50,095 INFO  L471      AbstractCegarLoop]: Abstraction has 1685 states and 2524 transitions.
[2025-03-16 21:18:50,095 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 41.875) internal successors, (335), 7 states have internal predecessors, (335), 0 states have call successors, (0), 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-16 21:18:50,095 INFO  L276                IsEmpty]: Start isEmpty. Operand 1685 states and 2524 transitions.
[2025-03-16 21:18:50,098 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 337
[2025-03-16 21:18:50,098 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:18:50,098 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:18:50,098 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-03-16 21:18:50,098 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:18:50,099 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:18:50,099 INFO  L85        PathProgramCache]: Analyzing trace with hash 671023067, now seen corresponding path program 1 times
[2025-03-16 21:18:50,100 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:18:50,100 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074557150]
[2025-03-16 21:18:50,100 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:18:50,100 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:18:50,171 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 336 statements into 1 equivalence classes.
[2025-03-16 21:18:51,404 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 336 of 336 statements.
[2025-03-16 21:18:51,404 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:18:51,404 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:18:52,929 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-16 21:18:52,930 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:18:52,930 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074557150]
[2025-03-16 21:18:52,930 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074557150] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:18:52,930 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:18:52,930 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-16 21:18:52,930 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779072727]
[2025-03-16 21:18:52,930 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:18:52,931 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-16 21:18:52,931 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:18:52,931 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-16 21:18:52,931 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2025-03-16 21:18:52,932 INFO  L87              Difference]: Start difference. First operand 1685 states and 2524 transitions. Second operand  has 9 states, 9 states have (on average 37.333333333333336) internal successors, (336), 8 states have internal predecessors, (336), 0 states have call successors, (0), 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-16 21:18:54,125 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:18:54,126 INFO  L93              Difference]: Finished difference Result 2735 states and 4091 transitions.
[2025-03-16 21:18:54,126 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-16 21:18:54,126 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 37.333333333333336) internal successors, (336), 8 states have internal predecessors, (336), 0 states have call successors, (0), 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 336
[2025-03-16 21:18:54,127 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:18:54,132 INFO  L225             Difference]: With dead ends: 2735
[2025-03-16 21:18:54,132 INFO  L226             Difference]: Without dead ends: 1703
[2025-03-16 21:18:54,133 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210
[2025-03-16 21:18:54,134 INFO  L435           NwaCegarLoop]: 1295 mSDtfsCounter, 4046 mSDsluCounter, 7767 mSDsCounter, 0 mSdLazyCounter, 2025 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4046 SdHoareTripleChecker+Valid, 9062 SdHoareTripleChecker+Invalid, 2026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-03-16 21:18:54,135 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4046 Valid, 9062 Invalid, 2026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2025 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-03-16 21:18:54,136 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1703 states.
[2025-03-16 21:18:54,158 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1689.
[2025-03-16 21:18:54,160 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1689 states, 1688 states have (on average 1.4982227488151658) internal successors, (2529), 1688 states have internal predecessors, (2529), 0 states have call successors, (0), 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-16 21:18:54,162 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2529 transitions.
[2025-03-16 21:18:54,163 INFO  L78                 Accepts]: Start accepts. Automaton has 1689 states and 2529 transitions. Word has length 336
[2025-03-16 21:18:54,163 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:18:54,163 INFO  L471      AbstractCegarLoop]: Abstraction has 1689 states and 2529 transitions.
[2025-03-16 21:18:54,163 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 37.333333333333336) internal successors, (336), 8 states have internal predecessors, (336), 0 states have call successors, (0), 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-16 21:18:54,164 INFO  L276                IsEmpty]: Start isEmpty. Operand 1689 states and 2529 transitions.
[2025-03-16 21:18:54,166 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 338
[2025-03-16 21:18:54,166 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:18:54,166 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:18:54,166 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-03-16 21:18:54,166 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:18:54,167 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:18:54,167 INFO  L85        PathProgramCache]: Analyzing trace with hash -1363083613, now seen corresponding path program 1 times
[2025-03-16 21:18:54,167 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:18:54,167 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737217371]
[2025-03-16 21:18:54,167 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:18:54,167 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:18:54,225 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 337 statements into 1 equivalence classes.
[2025-03-16 21:18:55,288 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 337 of 337 statements.
[2025-03-16 21:18:55,288 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:18:55,288 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:18:56,167 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-16 21:18:56,167 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:18:56,167 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737217371]
[2025-03-16 21:18:56,167 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737217371] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:18:56,167 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:18:56,167 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 21:18:56,168 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035872272]
[2025-03-16 21:18:56,168 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:18:56,168 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-03-16 21:18:56,168 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:18:56,168 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-03-16 21:18:56,169 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-03-16 21:18:56,169 INFO  L87              Difference]: Start difference. First operand 1689 states and 2529 transitions. Second operand  has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 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-16 21:18:56,545 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:18:56,545 INFO  L93              Difference]: Finished difference Result 2794 states and 4181 transitions.
[2025-03-16 21:18:56,545 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-03-16 21:18:56,545 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 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 337
[2025-03-16 21:18:56,546 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:18:56,550 INFO  L225             Difference]: With dead ends: 2794
[2025-03-16 21:18:56,550 INFO  L226             Difference]: Without dead ends: 1689
[2025-03-16 21:18:56,551 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-16 21:18:56,552 INFO  L435           NwaCegarLoop]: 1312 mSDtfsCounter, 873 mSDsluCounter, 1704 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 3016 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-03-16 21:18:56,552 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 3016 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-03-16 21:18:56,554 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1689 states.
[2025-03-16 21:18:56,571 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1689 to 1689.
[2025-03-16 21:18:56,574 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1689 states, 1688 states have (on average 1.497037914691943) internal successors, (2527), 1688 states have internal predecessors, (2527), 0 states have call successors, (0), 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-16 21:18:56,576 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2527 transitions.
[2025-03-16 21:18:56,576 INFO  L78                 Accepts]: Start accepts. Automaton has 1689 states and 2527 transitions. Word has length 337
[2025-03-16 21:18:56,577 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:18:56,577 INFO  L471      AbstractCegarLoop]: Abstraction has 1689 states and 2527 transitions.
[2025-03-16 21:18:56,577 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 84.25) internal successors, (337), 4 states have internal predecessors, (337), 0 states have call successors, (0), 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-16 21:18:56,577 INFO  L276                IsEmpty]: Start isEmpty. Operand 1689 states and 2527 transitions.
[2025-03-16 21:18:56,580 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 339
[2025-03-16 21:18:56,580 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:18:56,580 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:18:56,580 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-03-16 21:18:56,580 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:18:56,581 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:18:56,581 INFO  L85        PathProgramCache]: Analyzing trace with hash -1570737729, now seen corresponding path program 1 times
[2025-03-16 21:18:56,581 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:18:56,581 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016597261]
[2025-03-16 21:18:56,581 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:18:56,581 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:18:56,640 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 338 statements into 1 equivalence classes.
[2025-03-16 21:18:57,466 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 338 of 338 statements.
[2025-03-16 21:18:57,466 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:18:57,466 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:18:59,853 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-16 21:18:59,854 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:18:59,854 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016597261]
[2025-03-16 21:18:59,854 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016597261] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:18:59,854 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:18:59,854 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-16 21:18:59,854 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870415394]
[2025-03-16 21:18:59,854 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:18:59,854 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-16 21:18:59,854 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:18:59,855 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-16 21:18:59,855 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90
[2025-03-16 21:18:59,855 INFO  L87              Difference]: Start difference. First operand 1689 states and 2527 transitions. Second operand  has 10 states, 10 states have (on average 33.8) internal successors, (338), 9 states have internal predecessors, (338), 0 states have call successors, (0), 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-16 21:19:01,291 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:19:01,292 INFO  L93              Difference]: Finished difference Result 4949 states and 7406 transitions.
[2025-03-16 21:19:01,292 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2025-03-16 21:19:01,292 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 33.8) internal successors, (338), 9 states have internal predecessors, (338), 0 states have call successors, (0), 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 338
[2025-03-16 21:19:01,293 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:19:01,298 INFO  L225             Difference]: With dead ends: 4949
[2025-03-16 21:19:01,298 INFO  L226             Difference]: Without dead ends: 1895
[2025-03-16 21:19:01,301 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306
[2025-03-16 21:19:01,301 INFO  L435           NwaCegarLoop]: 1388 mSDtfsCounter, 4227 mSDsluCounter, 8263 mSDsCounter, 0 mSdLazyCounter, 2566 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4227 SdHoareTripleChecker+Valid, 9651 SdHoareTripleChecker+Invalid, 2603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-03-16 21:19:01,301 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4227 Valid, 9651 Invalid, 2603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2566 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-03-16 21:19:01,303 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1895 states.
[2025-03-16 21:19:01,322 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1895 to 1867.
[2025-03-16 21:19:01,324 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1867 states, 1866 states have (on average 1.4978563772775992) internal successors, (2795), 1866 states have internal predecessors, (2795), 0 states have call successors, (0), 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-16 21:19:01,327 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2795 transitions.
[2025-03-16 21:19:01,327 INFO  L78                 Accepts]: Start accepts. Automaton has 1867 states and 2795 transitions. Word has length 338
[2025-03-16 21:19:01,327 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:19:01,327 INFO  L471      AbstractCegarLoop]: Abstraction has 1867 states and 2795 transitions.
[2025-03-16 21:19:01,327 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 33.8) internal successors, (338), 9 states have internal predecessors, (338), 0 states have call successors, (0), 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-16 21:19:01,327 INFO  L276                IsEmpty]: Start isEmpty. Operand 1867 states and 2795 transitions.
[2025-03-16 21:19:01,330 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 340
[2025-03-16 21:19:01,330 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:19:01,330 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:19:01,331 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-03-16 21:19:01,331 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:19:01,331 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:19:01,331 INFO  L85        PathProgramCache]: Analyzing trace with hash -1887769015, now seen corresponding path program 1 times
[2025-03-16 21:19:01,331 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:19:01,331 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494069812]
[2025-03-16 21:19:01,331 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:19:01,332 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:19:01,389 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 339 statements into 1 equivalence classes.
[2025-03-16 21:19:02,481 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 339 of 339 statements.
[2025-03-16 21:19:02,482 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:19:02,482 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:19:03,031 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-16 21:19:03,032 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:19:03,032 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494069812]
[2025-03-16 21:19:03,032 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494069812] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:19:03,032 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:19:03,032 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 21:19:03,032 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742660695]
[2025-03-16 21:19:03,032 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:19:03,033 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 21:19:03,033 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:19:03,033 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 21:19:03,033 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-16 21:19:03,033 INFO  L87              Difference]: Start difference. First operand 1867 states and 2795 transitions. Second operand  has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 0 states have call successors, (0), 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-16 21:19:03,522 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:19:03,522 INFO  L93              Difference]: Finished difference Result 3153 states and 4717 transitions.
[2025-03-16 21:19:03,523 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-16 21:19:03,523 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 0 states have call successors, (0), 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 339
[2025-03-16 21:19:03,523 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:19:03,527 INFO  L225             Difference]: With dead ends: 3153
[2025-03-16 21:19:03,527 INFO  L226             Difference]: Without dead ends: 1867
[2025-03-16 21:19:03,528 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30
[2025-03-16 21:19:03,529 INFO  L435           NwaCegarLoop]: 1179 mSDtfsCounter, 1409 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1409 SdHoareTripleChecker+Valid, 3115 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-16 21:19:03,529 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1409 Valid, 3115 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-16 21:19:03,530 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1867 states.
[2025-03-16 21:19:03,545 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1867 to 1867.
[2025-03-16 21:19:03,548 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1867 states, 1866 states have (on average 1.4967845659163987) internal successors, (2793), 1866 states have internal predecessors, (2793), 0 states have call successors, (0), 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-16 21:19:03,550 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 2793 transitions.
[2025-03-16 21:19:03,550 INFO  L78                 Accepts]: Start accepts. Automaton has 1867 states and 2793 transitions. Word has length 339
[2025-03-16 21:19:03,551 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:19:03,551 INFO  L471      AbstractCegarLoop]: Abstraction has 1867 states and 2793 transitions.
[2025-03-16 21:19:03,551 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 67.8) internal successors, (339), 5 states have internal predecessors, (339), 0 states have call successors, (0), 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-16 21:19:03,551 INFO  L276                IsEmpty]: Start isEmpty. Operand 1867 states and 2793 transitions.
[2025-03-16 21:19:03,553 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 341
[2025-03-16 21:19:03,553 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:19:03,553 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:19:03,553 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-03-16 21:19:03,553 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:19:03,554 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:19:03,554 INFO  L85        PathProgramCache]: Analyzing trace with hash 556550380, now seen corresponding path program 1 times
[2025-03-16 21:19:03,554 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:19:03,554 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871368969]
[2025-03-16 21:19:03,554 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:19:03,554 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:19:03,618 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes.
[2025-03-16 21:19:04,800 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements.
[2025-03-16 21:19:04,800 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:19:04,801 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:19:05,778 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-16 21:19:05,778 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:19:05,778 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871368969]
[2025-03-16 21:19:05,778 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871368969] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:19:05,778 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:19:05,778 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2025-03-16 21:19:05,778 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432822479]
[2025-03-16 21:19:05,778 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:19:05,778 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-03-16 21:19:05,778 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:19:05,779 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-03-16 21:19:05,779 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90
[2025-03-16 21:19:05,779 INFO  L87              Difference]: Start difference. First operand 1867 states and 2793 transitions. Second operand  has 10 states, 10 states have (on average 34.0) internal successors, (340), 9 states have internal predecessors, (340), 0 states have call successors, (0), 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-16 21:19:07,224 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:19:07,224 INFO  L93              Difference]: Finished difference Result 3044 states and 4552 transitions.
[2025-03-16 21:19:07,225 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-16 21:19:07,225 INFO  L78                 Accepts]: Start accepts. Automaton has  has 10 states, 10 states have (on average 34.0) internal successors, (340), 9 states have internal predecessors, (340), 0 states have call successors, (0), 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 340
[2025-03-16 21:19:07,225 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:19:07,229 INFO  L225             Difference]: With dead ends: 3044
[2025-03-16 21:19:07,229 INFO  L226             Difference]: Without dead ends: 1881
[2025-03-16 21:19:07,231 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182
[2025-03-16 21:19:07,231 INFO  L435           NwaCegarLoop]: 1076 mSDtfsCounter, 1753 mSDsluCounter, 6435 mSDsCounter, 0 mSdLazyCounter, 3556 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1753 SdHoareTripleChecker+Valid, 7511 SdHoareTripleChecker+Invalid, 3558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-03-16 21:19:07,231 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1753 Valid, 7511 Invalid, 3558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3556 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-03-16 21:19:07,233 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1881 states.
[2025-03-16 21:19:07,252 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1873.
[2025-03-16 21:19:07,254 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1873 states, 1872 states have (on average 1.4951923076923077) internal successors, (2799), 1872 states have internal predecessors, (2799), 0 states have call successors, (0), 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-16 21:19:07,258 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2799 transitions.
[2025-03-16 21:19:07,258 INFO  L78                 Accepts]: Start accepts. Automaton has 1873 states and 2799 transitions. Word has length 340
[2025-03-16 21:19:07,258 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:19:07,258 INFO  L471      AbstractCegarLoop]: Abstraction has 1873 states and 2799 transitions.
[2025-03-16 21:19:07,259 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 34.0) internal successors, (340), 9 states have internal predecessors, (340), 0 states have call successors, (0), 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-16 21:19:07,259 INFO  L276                IsEmpty]: Start isEmpty. Operand 1873 states and 2799 transitions.
[2025-03-16 21:19:07,261 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 342
[2025-03-16 21:19:07,261 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:19:07,261 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:19:07,261 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-03-16 21:19:07,262 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:19:07,262 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:19:07,262 INFO  L85        PathProgramCache]: Analyzing trace with hash -1631740994, now seen corresponding path program 1 times
[2025-03-16 21:19:07,262 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:19:07,262 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959187992]
[2025-03-16 21:19:07,262 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:19:07,262 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:19:07,346 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 341 statements into 1 equivalence classes.
[2025-03-16 21:19:08,685 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 341 of 341 statements.
[2025-03-16 21:19:08,686 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:19:08,686 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:19:09,594 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-16 21:19:09,594 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:19:09,594 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959187992]
[2025-03-16 21:19:09,594 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959187992] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:19:09,594 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:19:09,594 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-16 21:19:09,594 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504316786]
[2025-03-16 21:19:09,594 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:19:09,595 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-16 21:19:09,595 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:19:09,595 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-16 21:19:09,595 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56
[2025-03-16 21:19:09,595 INFO  L87              Difference]: Start difference. First operand 1873 states and 2799 transitions. Second operand  has 8 states, 8 states have (on average 42.625) internal successors, (341), 7 states have internal predecessors, (341), 0 states have call successors, (0), 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-16 21:19:10,542 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:19:10,542 INFO  L93              Difference]: Finished difference Result 3077 states and 4595 transitions.
[2025-03-16 21:19:10,542 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-16 21:19:10,542 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 42.625) internal successors, (341), 7 states have internal predecessors, (341), 0 states have call successors, (0), 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 341
[2025-03-16 21:19:10,543 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:19:10,546 INFO  L225             Difference]: With dead ends: 3077
[2025-03-16 21:19:10,546 INFO  L226             Difference]: Without dead ends: 1881
[2025-03-16 21:19:10,548 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110
[2025-03-16 21:19:10,548 INFO  L435           NwaCegarLoop]: 1077 mSDtfsCounter, 2169 mSDsluCounter, 3528 mSDsCounter, 0 mSdLazyCounter, 2195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2169 SdHoareTripleChecker+Valid, 4605 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-03-16 21:19:10,548 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2169 Valid, 4605 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2195 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-03-16 21:19:10,550 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1881 states.
[2025-03-16 21:19:10,562 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1877.
[2025-03-16 21:19:10,564 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1877 states, 1876 states have (on average 1.494136460554371) internal successors, (2803), 1876 states have internal predecessors, (2803), 0 states have call successors, (0), 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-16 21:19:10,566 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1877 states to 1877 states and 2803 transitions.
[2025-03-16 21:19:10,566 INFO  L78                 Accepts]: Start accepts. Automaton has 1877 states and 2803 transitions. Word has length 341
[2025-03-16 21:19:10,567 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:19:10,567 INFO  L471      AbstractCegarLoop]: Abstraction has 1877 states and 2803 transitions.
[2025-03-16 21:19:10,567 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 42.625) internal successors, (341), 7 states have internal predecessors, (341), 0 states have call successors, (0), 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-16 21:19:10,567 INFO  L276                IsEmpty]: Start isEmpty. Operand 1877 states and 2803 transitions.
[2025-03-16 21:19:10,568 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 343
[2025-03-16 21:19:10,568 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:19:10,569 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:19:10,569 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-03-16 21:19:10,569 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:19:10,569 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:19:10,569 INFO  L85        PathProgramCache]: Analyzing trace with hash -1685550353, now seen corresponding path program 1 times
[2025-03-16 21:19:10,569 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:19:10,569 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417547650]
[2025-03-16 21:19:10,570 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:19:10,570 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:19:10,625 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 342 statements into 1 equivalence classes.
[2025-03-16 21:19:11,250 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 342 of 342 statements.
[2025-03-16 21:19:11,251 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:19:11,251 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:19:11,952 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-16 21:19:11,952 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:19:11,952 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417547650]
[2025-03-16 21:19:11,952 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417547650] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:19:11,952 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:19:11,952 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-16 21:19:11,952 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178785723]
[2025-03-16 21:19:11,952 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:19:11,953 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-16 21:19:11,953 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:19:11,953 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-16 21:19:11,953 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-16 21:19:11,954 INFO  L87              Difference]: Start difference. First operand 1877 states and 2803 transitions. Second operand  has 7 states, 7 states have (on average 48.857142857142854) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 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-16 21:19:12,685 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:19:12,685 INFO  L93              Difference]: Finished difference Result 4295 states and 6418 transitions.
[2025-03-16 21:19:12,685 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-16 21:19:12,685 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 48.857142857142854) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 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 342
[2025-03-16 21:19:12,686 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:19:12,691 INFO  L225             Difference]: With dead ends: 4295
[2025-03-16 21:19:12,691 INFO  L226             Difference]: Without dead ends: 2999
[2025-03-16 21:19:12,693 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2025-03-16 21:19:12,693 INFO  L435           NwaCegarLoop]: 1176 mSDtfsCounter, 2699 mSDsluCounter, 4691 mSDsCounter, 0 mSdLazyCounter, 2042 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2699 SdHoareTripleChecker+Valid, 5867 SdHoareTripleChecker+Invalid, 2042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-16 21:19:12,693 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2699 Valid, 5867 Invalid, 2042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2042 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-16 21:19:12,695 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2999 states.
[2025-03-16 21:19:12,714 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 2947.
[2025-03-16 21:19:12,717 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2947 states, 2946 states have (on average 1.4966055668703326) internal successors, (4409), 2946 states have internal predecessors, (4409), 0 states have call successors, (0), 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-16 21:19:12,720 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2947 states to 2947 states and 4409 transitions.
[2025-03-16 21:19:12,720 INFO  L78                 Accepts]: Start accepts. Automaton has 2947 states and 4409 transitions. Word has length 342
[2025-03-16 21:19:12,720 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:19:12,721 INFO  L471      AbstractCegarLoop]: Abstraction has 2947 states and 4409 transitions.
[2025-03-16 21:19:12,721 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 48.857142857142854) internal successors, (342), 6 states have internal predecessors, (342), 0 states have call successors, (0), 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-16 21:19:12,721 INFO  L276                IsEmpty]: Start isEmpty. Operand 2947 states and 4409 transitions.
[2025-03-16 21:19:12,723 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 344
[2025-03-16 21:19:12,723 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:19:12,723 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:19:12,723 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-03-16 21:19:12,723 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:19:12,724 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:19:12,724 INFO  L85        PathProgramCache]: Analyzing trace with hash 93505695, now seen corresponding path program 1 times
[2025-03-16 21:19:12,724 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:19:12,724 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101239741]
[2025-03-16 21:19:12,724 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:19:12,724 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:19:12,782 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes.
[2025-03-16 21:19:13,682 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements.
[2025-03-16 21:19:13,682 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:19:13,682 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:19:13,965 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-16 21:19:13,965 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:19:13,965 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101239741]
[2025-03-16 21:19:13,965 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101239741] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:19:13,965 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:19:13,965 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-03-16 21:19:13,965 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257630930]
[2025-03-16 21:19:13,965 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:19:13,965 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 21:19:13,965 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:19:13,966 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 21:19:13,966 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-16 21:19:13,966 INFO  L87              Difference]: Start difference. First operand 2947 states and 4409 transitions. Second operand  has 5 states, 5 states have (on average 68.6) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 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-16 21:19:14,553 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:19:14,553 INFO  L93              Difference]: Finished difference Result 4682 states and 7002 transitions.
[2025-03-16 21:19:14,553 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-03-16 21:19:14,554 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 68.6) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 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 343
[2025-03-16 21:19:14,554 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:19:14,560 INFO  L225             Difference]: With dead ends: 4682
[2025-03-16 21:19:14,560 INFO  L226             Difference]: Without dead ends: 2949
[2025-03-16 21:19:14,562 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-03-16 21:19:14,562 INFO  L435           NwaCegarLoop]: 1085 mSDtfsCounter, 1287 mSDsluCounter, 2166 mSDsCounter, 0 mSdLazyCounter, 1493 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1287 SdHoareTripleChecker+Valid, 3251 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-16 21:19:14,562 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1287 Valid, 3251 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1493 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-16 21:19:14,564 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2949 states.
[2025-03-16 21:19:14,585 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2949 to 2949.
[2025-03-16 21:19:14,588 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2949 states, 2948 states have (on average 1.4962686567164178) internal successors, (4411), 2948 states have internal predecessors, (4411), 0 states have call successors, (0), 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-16 21:19:14,591 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2949 states to 2949 states and 4411 transitions.
[2025-03-16 21:19:14,591 INFO  L78                 Accepts]: Start accepts. Automaton has 2949 states and 4411 transitions. Word has length 343
[2025-03-16 21:19:14,592 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:19:14,592 INFO  L471      AbstractCegarLoop]: Abstraction has 2949 states and 4411 transitions.
[2025-03-16 21:19:14,592 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 68.6) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 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-16 21:19:14,592 INFO  L276                IsEmpty]: Start isEmpty. Operand 2949 states and 4411 transitions.
[2025-03-16 21:19:14,594 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 344
[2025-03-16 21:19:14,594 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:19:14,595 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:19:14,595 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-03-16 21:19:14,595 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:19:14,595 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:19:14,595 INFO  L85        PathProgramCache]: Analyzing trace with hash -1894968308, now seen corresponding path program 1 times
[2025-03-16 21:19:14,595 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:19:14,595 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099413989]
[2025-03-16 21:19:14,596 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:19:14,596 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:19:14,652 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 343 statements into 1 equivalence classes.
[2025-03-16 21:19:15,042 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 343 of 343 statements.
[2025-03-16 21:19:15,042 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:19:15,042 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:19:15,811 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-16 21:19:15,811 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:19:15,811 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099413989]
[2025-03-16 21:19:15,811 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099413989] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:19:15,811 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:19:15,812 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-16 21:19:15,812 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423791221]
[2025-03-16 21:19:15,812 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:19:15,812 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-16 21:19:15,812 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:19:15,812 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-16 21:19:15,812 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-03-16 21:19:15,812 INFO  L87              Difference]: Start difference. First operand 2949 states and 4411 transitions. Second operand  has 7 states, 7 states have (on average 49.0) internal successors, (343), 6 states have internal predecessors, (343), 0 states have call successors, (0), 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-16 21:19:16,396 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:19:16,396 INFO  L93              Difference]: Finished difference Result 7376 states and 11028 transitions.
[2025-03-16 21:19:16,396 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-16 21:19:16,396 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 49.0) internal successors, (343), 6 states have internal predecessors, (343), 0 states have call successors, (0), 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 343
[2025-03-16 21:19:16,396 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:19:16,407 INFO  L225             Difference]: With dead ends: 7376
[2025-03-16 21:19:16,408 INFO  L226             Difference]: Without dead ends: 5637
[2025-03-16 21:19:16,410 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72
[2025-03-16 21:19:16,411 INFO  L435           NwaCegarLoop]: 1715 mSDtfsCounter, 3232 mSDsluCounter, 6443 mSDsCounter, 0 mSdLazyCounter, 1692 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3232 SdHoareTripleChecker+Valid, 8158 SdHoareTripleChecker+Invalid, 1692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1692 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-03-16 21:19:16,411 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3232 Valid, 8158 Invalid, 1692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1692 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-03-16 21:19:16,414 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5637 states.
[2025-03-16 21:19:16,447 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5637 to 5225.
[2025-03-16 21:19:16,453 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5225 states, 5224 states have (on average 1.4978943338437978) internal successors, (7825), 5224 states have internal predecessors, (7825), 0 states have call successors, (0), 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-16 21:19:16,458 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5225 states to 5225 states and 7825 transitions.
[2025-03-16 21:19:16,459 INFO  L78                 Accepts]: Start accepts. Automaton has 5225 states and 7825 transitions. Word has length 343
[2025-03-16 21:19:16,459 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:19:16,459 INFO  L471      AbstractCegarLoop]: Abstraction has 5225 states and 7825 transitions.
[2025-03-16 21:19:16,459 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 49.0) internal successors, (343), 6 states have internal predecessors, (343), 0 states have call successors, (0), 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-16 21:19:16,459 INFO  L276                IsEmpty]: Start isEmpty. Operand 5225 states and 7825 transitions.
[2025-03-16 21:19:16,463 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 345
[2025-03-16 21:19:16,463 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:19:16,463 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:19:16,463 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-03-16 21:19:16,463 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:19:16,464 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:19:16,464 INFO  L85        PathProgramCache]: Analyzing trace with hash 1844386766, now seen corresponding path program 1 times
[2025-03-16 21:19:16,464 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:19:16,464 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198868520]
[2025-03-16 21:19:16,464 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:19:16,464 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:19:16,519 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes.
[2025-03-16 21:19:17,953 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements.
[2025-03-16 21:19:17,954 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:19:17,954 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:19:18,926 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-16 21:19:18,927 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:19:18,927 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198868520]
[2025-03-16 21:19:18,927 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198868520] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:19:18,927 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:19:18,927 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-16 21:19:18,927 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207048975]
[2025-03-16 21:19:18,927 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:19:18,927 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-16 21:19:18,927 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:19:18,928 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-16 21:19:18,928 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2025-03-16 21:19:18,928 INFO  L87              Difference]: Start difference. First operand 5225 states and 7825 transitions. Second operand  has 8 states, 8 states have (on average 43.0) internal successors, (344), 7 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 21:19:20,344 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:19:20,344 INFO  L93              Difference]: Finished difference Result 11569 states and 17314 transitions.
[2025-03-16 21:19:20,345 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-16 21:19:20,345 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 43.0) internal successors, (344), 7 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 344
[2025-03-16 21:19:20,345 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:19:20,355 INFO  L225             Difference]: With dead ends: 11569
[2025-03-16 21:19:20,355 INFO  L226             Difference]: Without dead ends: 7909
[2025-03-16 21:19:20,358 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2025-03-16 21:19:20,359 INFO  L435           NwaCegarLoop]: 1977 mSDtfsCounter, 2570 mSDsluCounter, 7788 mSDsCounter, 0 mSdLazyCounter, 4407 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2570 SdHoareTripleChecker+Valid, 9765 SdHoareTripleChecker+Invalid, 4408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-03-16 21:19:20,359 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2570 Valid, 9765 Invalid, 4408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4407 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-03-16 21:19:20,362 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 7909 states.
[2025-03-16 21:19:20,398 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 7909 to 5941.
[2025-03-16 21:19:20,403 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 5941 states, 5940 states have (on average 1.4991582491582491) internal successors, (8905), 5940 states have internal predecessors, (8905), 0 states have call successors, (0), 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-16 21:19:20,407 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5941 states to 5941 states and 8905 transitions.
[2025-03-16 21:19:20,408 INFO  L78                 Accepts]: Start accepts. Automaton has 5941 states and 8905 transitions. Word has length 344
[2025-03-16 21:19:20,408 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:19:20,408 INFO  L471      AbstractCegarLoop]: Abstraction has 5941 states and 8905 transitions.
[2025-03-16 21:19:20,408 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 43.0) internal successors, (344), 7 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 21:19:20,408 INFO  L276                IsEmpty]: Start isEmpty. Operand 5941 states and 8905 transitions.
[2025-03-16 21:19:20,412 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 345
[2025-03-16 21:19:20,412 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:19:20,412 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:19:20,412 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-03-16 21:19:20,412 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:19:20,413 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:19:20,413 INFO  L85        PathProgramCache]: Analyzing trace with hash -747787094, now seen corresponding path program 1 times
[2025-03-16 21:19:20,413 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:19:20,413 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603109638]
[2025-03-16 21:19:20,413 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:19:20,413 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:19:20,466 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 344 statements into 1 equivalence classes.
[2025-03-16 21:19:21,493 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 344 of 344 statements.
[2025-03-16 21:19:21,493 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:19:21,494 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:19:22,120 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-16 21:19:22,120 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:19:22,120 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603109638]
[2025-03-16 21:19:22,120 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603109638] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:19:22,120 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:19:22,120 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-16 21:19:22,121 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711152333]
[2025-03-16 21:19:22,121 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:19:22,121 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2025-03-16 21:19:22,121 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:19:22,121 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2025-03-16 21:19:22,121 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30
[2025-03-16 21:19:22,121 INFO  L87              Difference]: Start difference. First operand 5941 states and 8905 transitions. Second operand  has 6 states, 6 states have (on average 57.333333333333336) internal successors, (344), 6 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 21:19:22,881 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:19:22,881 INFO  L93              Difference]: Finished difference Result 17287 states and 25852 transitions.
[2025-03-16 21:19:22,881 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-16 21:19:22,882 INFO  L78                 Accepts]: Start accepts. Automaton has  has 6 states, 6 states have (on average 57.333333333333336) internal successors, (344), 6 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 344
[2025-03-16 21:19:22,882 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:19:22,901 INFO  L225             Difference]: With dead ends: 17287
[2025-03-16 21:19:22,901 INFO  L226             Difference]: Without dead ends: 14065
[2025-03-16 21:19:22,908 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-16 21:19:22,910 INFO  L435           NwaCegarLoop]: 1267 mSDtfsCounter, 1460 mSDsluCounter, 4941 mSDsCounter, 0 mSdLazyCounter, 1805 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1460 SdHoareTripleChecker+Valid, 6208 SdHoareTripleChecker+Invalid, 1817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-16 21:19:22,910 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1460 Valid, 6208 Invalid, 1817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1805 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-16 21:19:22,920 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 14065 states.
[2025-03-16 21:19:22,993 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 14065 to 10493.
[2025-03-16 21:19:23,003 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10493 states, 10492 states have (on average 1.4962828821959588) internal successors, (15699), 10492 states have internal predecessors, (15699), 0 states have call successors, (0), 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-16 21:19:23,012 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10493 states to 10493 states and 15699 transitions.
[2025-03-16 21:19:23,012 INFO  L78                 Accepts]: Start accepts. Automaton has 10493 states and 15699 transitions. Word has length 344
[2025-03-16 21:19:23,012 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:19:23,012 INFO  L471      AbstractCegarLoop]: Abstraction has 10493 states and 15699 transitions.
[2025-03-16 21:19:23,013 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 57.333333333333336) internal successors, (344), 6 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 21:19:23,013 INFO  L276                IsEmpty]: Start isEmpty. Operand 10493 states and 15699 transitions.
[2025-03-16 21:19:23,019 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 346
[2025-03-16 21:19:23,019 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:19:23,020 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:19:23,020 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-03-16 21:19:23,020 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:19:23,020 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:19:23,020 INFO  L85        PathProgramCache]: Analyzing trace with hash -33846535, now seen corresponding path program 1 times
[2025-03-16 21:19:23,020 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:19:23,021 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597035508]
[2025-03-16 21:19:23,021 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:19:23,021 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:19:23,075 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 345 statements into 1 equivalence classes.
[2025-03-16 21:19:23,997 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 345 of 345 statements.
[2025-03-16 21:19:23,997 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:19:23,997 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:19:24,773 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-16 21:19:24,773 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:19:24,773 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597035508]
[2025-03-16 21:19:24,773 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597035508] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:19:24,773 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:19:24,773 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-16 21:19:24,773 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658967496]
[2025-03-16 21:19:24,773 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:19:24,774 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-16 21:19:24,774 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:19:24,774 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-16 21:19:24,774 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2025-03-16 21:19:24,774 INFO  L87              Difference]: Start difference. First operand 10493 states and 15699 transitions. Second operand  has 8 states, 8 states have (on average 43.125) internal successors, (345), 7 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 21:19:25,605 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:19:25,606 INFO  L93              Difference]: Finished difference Result 15972 states and 23894 transitions.
[2025-03-16 21:19:25,606 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-16 21:19:25,606 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 43.125) internal successors, (345), 7 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 345
[2025-03-16 21:19:25,606 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:19:25,616 INFO  L225             Difference]: With dead ends: 15972
[2025-03-16 21:19:25,617 INFO  L226             Difference]: Without dead ends: 10501
[2025-03-16 21:19:25,623 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132
[2025-03-16 21:19:25,623 INFO  L435           NwaCegarLoop]: 1186 mSDtfsCounter, 1680 mSDsluCounter, 4773 mSDsCounter, 0 mSdLazyCounter, 1951 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1680 SdHoareTripleChecker+Valid, 5959 SdHoareTripleChecker+Invalid, 1953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-03-16 21:19:25,624 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1680 Valid, 5959 Invalid, 1953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1951 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-03-16 21:19:25,629 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10501 states.
[2025-03-16 21:19:25,689 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10501 to 10499.
[2025-03-16 21:19:25,698 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 10499 states, 10498 states have (on average 1.4959992379500857) internal successors, (15705), 10498 states have internal predecessors, (15705), 0 states have call successors, (0), 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-16 21:19:25,707 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10499 states to 10499 states and 15705 transitions.
[2025-03-16 21:19:25,708 INFO  L78                 Accepts]: Start accepts. Automaton has 10499 states and 15705 transitions. Word has length 345
[2025-03-16 21:19:25,708 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:19:25,708 INFO  L471      AbstractCegarLoop]: Abstraction has 10499 states and 15705 transitions.
[2025-03-16 21:19:25,708 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 43.125) internal successors, (345), 7 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-03-16 21:19:25,708 INFO  L276                IsEmpty]: Start isEmpty. Operand 10499 states and 15705 transitions.
[2025-03-16 21:19:25,714 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 348
[2025-03-16 21:19:25,714 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:19:25,714 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:19:25,714 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-03-16 21:19:25,715 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:19:25,715 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:19:25,715 INFO  L85        PathProgramCache]: Analyzing trace with hash 320635568, now seen corresponding path program 1 times
[2025-03-16 21:19:25,715 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:19:25,715 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682458642]
[2025-03-16 21:19:25,715 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:19:25,715 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:19:25,771 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes.
[2025-03-16 21:19:27,354 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements.
[2025-03-16 21:19:27,354 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:19:27,354 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:19:27,842 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-16 21:19:27,843 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:19:27,843 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682458642]
[2025-03-16 21:19:27,843 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682458642] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:19:27,843 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:19:27,843 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-16 21:19:27,843 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710212212]
[2025-03-16 21:19:27,843 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:19:27,843 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-16 21:19:27,843 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:19:27,843 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-16 21:19:27,844 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2025-03-16 21:19:27,844 INFO  L87              Difference]: Start difference. First operand 10499 states and 15705 transitions. Second operand  has 9 states, 9 states have (on average 38.55555555555556) internal successors, (347), 8 states have internal predecessors, (347), 0 states have call successors, (0), 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-16 21:19:29,715 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:19:29,715 INFO  L93              Difference]: Finished difference Result 28469 states and 42527 transitions.
[2025-03-16 21:19:29,715 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2025-03-16 21:19:29,715 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 38.55555555555556) internal successors, (347), 8 states have internal predecessors, (347), 0 states have call successors, (0), 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 347
[2025-03-16 21:19:29,716 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:19:29,742 INFO  L225             Difference]: With dead ends: 28469
[2025-03-16 21:19:29,742 INFO  L226             Difference]: Without dead ends: 22977
[2025-03-16 21:19:29,753 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240
[2025-03-16 21:19:29,754 INFO  L435           NwaCegarLoop]: 1549 mSDtfsCounter, 3688 mSDsluCounter, 7873 mSDsCounter, 0 mSdLazyCounter, 4834 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3688 SdHoareTripleChecker+Valid, 9422 SdHoareTripleChecker+Invalid, 4860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 4834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-03-16 21:19:29,754 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3688 Valid, 9422 Invalid, 4860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 4834 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-03-16 21:19:29,766 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 22977 states.
[2025-03-16 21:19:29,914 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 22977 to 19797.
[2025-03-16 21:19:29,932 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19797 states, 19796 states have (on average 1.4947969286724592) internal successors, (29591), 19796 states have internal predecessors, (29591), 0 states have call successors, (0), 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-16 21:19:29,950 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19797 states to 19797 states and 29591 transitions.
[2025-03-16 21:19:29,950 INFO  L78                 Accepts]: Start accepts. Automaton has 19797 states and 29591 transitions. Word has length 347
[2025-03-16 21:19:29,951 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:19:29,951 INFO  L471      AbstractCegarLoop]: Abstraction has 19797 states and 29591 transitions.
[2025-03-16 21:19:29,951 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 38.55555555555556) internal successors, (347), 8 states have internal predecessors, (347), 0 states have call successors, (0), 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-16 21:19:29,951 INFO  L276                IsEmpty]: Start isEmpty. Operand 19797 states and 29591 transitions.
[2025-03-16 21:19:29,962 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 348
[2025-03-16 21:19:29,962 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:19:29,962 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:19:29,962 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-03-16 21:19:29,962 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:19:29,963 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:19:29,963 INFO  L85        PathProgramCache]: Analyzing trace with hash -447601621, now seen corresponding path program 1 times
[2025-03-16 21:19:29,963 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:19:29,963 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717678169]
[2025-03-16 21:19:29,963 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:19:29,964 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:19:30,024 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes.
[2025-03-16 21:19:31,010 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements.
[2025-03-16 21:19:31,011 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:19:31,011 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:19:31,592 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-16 21:19:31,592 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:19:31,593 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717678169]
[2025-03-16 21:19:31,593 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717678169] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:19:31,593 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:19:31,593 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-03-16 21:19:31,593 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345220439]
[2025-03-16 21:19:31,593 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:19:31,593 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-03-16 21:19:31,593 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:19:31,593 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-03-16 21:19:31,593 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-03-16 21:19:31,594 INFO  L87              Difference]: Start difference. First operand 19797 states and 29591 transitions. Second operand  has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 0 states have call successors, (0), 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-16 21:19:31,960 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:19:31,960 INFO  L93              Difference]: Finished difference Result 29924 states and 44724 transitions.
[2025-03-16 21:19:31,960 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-03-16 21:19:31,960 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 0 states have call successors, (0), 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 347
[2025-03-16 21:19:31,961 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:19:31,977 INFO  L225             Difference]: With dead ends: 29924
[2025-03-16 21:19:31,977 INFO  L226             Difference]: Without dead ends: 19797
[2025-03-16 21:19:31,989 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-16 21:19:31,989 INFO  L435           NwaCegarLoop]: 1305 mSDtfsCounter, 1317 mSDsluCounter, 2618 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1317 SdHoareTripleChecker+Valid, 3923 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-03-16 21:19:31,989 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1317 Valid, 3923 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-03-16 21:19:31,999 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19797 states.
[2025-03-16 21:19:32,109 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19797 to 19797.
[2025-03-16 21:19:32,124 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19797 states, 19796 states have (on average 1.4946958981612446) internal successors, (29589), 19796 states have internal predecessors, (29589), 0 states have call successors, (0), 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-16 21:19:32,143 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19797 states to 19797 states and 29589 transitions.
[2025-03-16 21:19:32,143 INFO  L78                 Accepts]: Start accepts. Automaton has 19797 states and 29589 transitions. Word has length 347
[2025-03-16 21:19:32,143 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:19:32,143 INFO  L471      AbstractCegarLoop]: Abstraction has 19797 states and 29589 transitions.
[2025-03-16 21:19:32,144 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 69.4) internal successors, (347), 5 states have internal predecessors, (347), 0 states have call successors, (0), 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-16 21:19:32,144 INFO  L276                IsEmpty]: Start isEmpty. Operand 19797 states and 29589 transitions.
[2025-03-16 21:19:32,154 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 348
[2025-03-16 21:19:32,155 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:19:32,155 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:19:32,155 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-03-16 21:19:32,155 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:19:32,156 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:19:32,156 INFO  L85        PathProgramCache]: Analyzing trace with hash 1598514749, now seen corresponding path program 1 times
[2025-03-16 21:19:32,156 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:19:32,156 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937004518]
[2025-03-16 21:19:32,156 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:19:32,156 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:19:32,212 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes.
[2025-03-16 21:19:33,039 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements.
[2025-03-16 21:19:33,040 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:19:33,040 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:19:33,493 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-16 21:19:33,493 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:19:33,493 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937004518]
[2025-03-16 21:19:33,493 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937004518] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:19:33,493 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:19:33,493 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-16 21:19:33,493 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026532722]
[2025-03-16 21:19:33,493 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:19:33,494 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2025-03-16 21:19:33,494 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:19:33,494 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2025-03-16 21:19:33,494 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2025-03-16 21:19:33,494 INFO  L87              Difference]: Start difference. First operand 19797 states and 29589 transitions. Second operand  has 8 states, 8 states have (on average 43.375) internal successors, (347), 7 states have internal predecessors, (347), 0 states have call successors, (0), 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-16 21:19:34,986 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:19:34,987 INFO  L93              Difference]: Finished difference Result 30124 states and 45004 transitions.
[2025-03-16 21:19:34,987 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2025-03-16 21:19:34,987 INFO  L78                 Accepts]: Start accepts. Automaton has  has 8 states, 8 states have (on average 43.375) internal successors, (347), 7 states have internal predecessors, (347), 0 states have call successors, (0), 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 347
[2025-03-16 21:19:34,987 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:19:35,003 INFO  L225             Difference]: With dead ends: 30124
[2025-03-16 21:19:35,003 INFO  L226             Difference]: Without dead ends: 19983
[2025-03-16 21:19:35,015 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156
[2025-03-16 21:19:35,015 INFO  L435           NwaCegarLoop]: 1023 mSDtfsCounter, 2825 mSDsluCounter, 5024 mSDsCounter, 0 mSdLazyCounter, 4192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2825 SdHoareTripleChecker+Valid, 6047 SdHoareTripleChecker+Invalid, 4193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-03-16 21:19:35,015 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2825 Valid, 6047 Invalid, 4193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4192 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-03-16 21:19:35,068 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 19983 states.
[2025-03-16 21:19:35,158 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 19983 to 19807.
[2025-03-16 21:19:35,172 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 19807 states, 19806 states have (on average 1.494648086438453) internal successors, (29603), 19806 states have internal predecessors, (29603), 0 states have call successors, (0), 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-16 21:19:35,189 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19807 states to 19807 states and 29603 transitions.
[2025-03-16 21:19:35,189 INFO  L78                 Accepts]: Start accepts. Automaton has 19807 states and 29603 transitions. Word has length 347
[2025-03-16 21:19:35,189 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:19:35,189 INFO  L471      AbstractCegarLoop]: Abstraction has 19807 states and 29603 transitions.
[2025-03-16 21:19:35,189 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 43.375) internal successors, (347), 7 states have internal predecessors, (347), 0 states have call successors, (0), 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-16 21:19:35,190 INFO  L276                IsEmpty]: Start isEmpty. Operand 19807 states and 29603 transitions.
[2025-03-16 21:19:35,199 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 348
[2025-03-16 21:19:35,199 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:19:35,199 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:19:35,200 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-03-16 21:19:35,200 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:19:35,200 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:19:35,200 INFO  L85        PathProgramCache]: Analyzing trace with hash 452490581, now seen corresponding path program 1 times
[2025-03-16 21:19:35,200 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:19:35,200 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979672005]
[2025-03-16 21:19:35,200 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:19:35,200 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:19:35,258 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes.
[2025-03-16 21:19:35,700 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements.
[2025-03-16 21:19:35,700 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:19:35,700 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:19:36,686 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-16 21:19:36,686 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:19:36,686 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979672005]
[2025-03-16 21:19:36,686 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979672005] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:19:36,686 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:19:36,686 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-03-16 21:19:36,686 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364674328]
[2025-03-16 21:19:36,686 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:19:36,687 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2025-03-16 21:19:36,687 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:19:36,687 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2025-03-16 21:19:36,687 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2025-03-16 21:19:36,687 INFO  L87              Difference]: Start difference. First operand 19807 states and 29603 transitions. Second operand  has 9 states, 9 states have (on average 38.55555555555556) internal successors, (347), 8 states have internal predecessors, (347), 0 states have call successors, (0), 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-16 21:19:37,570 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:19:37,570 INFO  L93              Difference]: Finished difference Result 38261 states and 57159 transitions.
[2025-03-16 21:19:37,570 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-03-16 21:19:37,571 INFO  L78                 Accepts]: Start accepts. Automaton has  has 9 states, 9 states have (on average 38.55555555555556) internal successors, (347), 8 states have internal predecessors, (347), 0 states have call successors, (0), 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 347
[2025-03-16 21:19:37,571 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:19:37,594 INFO  L225             Difference]: With dead ends: 38261
[2025-03-16 21:19:37,594 INFO  L226             Difference]: Without dead ends: 20215
[2025-03-16 21:19:37,615 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156
[2025-03-16 21:19:37,615 INFO  L435           NwaCegarLoop]: 1305 mSDtfsCounter, 1664 mSDsluCounter, 6111 mSDsCounter, 0 mSdLazyCounter, 2070 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1664 SdHoareTripleChecker+Valid, 7416 SdHoareTripleChecker+Invalid, 2070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2070 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-03-16 21:19:37,615 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1664 Valid, 7416 Invalid, 2070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2070 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-03-16 21:19:37,628 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20215 states.
[2025-03-16 21:19:37,739 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20215 to 20023.
[2025-03-16 21:19:37,754 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20023 states, 20022 states have (on average 1.4941064828688442) internal successors, (29915), 20022 states have internal predecessors, (29915), 0 states have call successors, (0), 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-16 21:19:37,771 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20023 states to 20023 states and 29915 transitions.
[2025-03-16 21:19:37,772 INFO  L78                 Accepts]: Start accepts. Automaton has 20023 states and 29915 transitions. Word has length 347
[2025-03-16 21:19:37,772 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:19:37,772 INFO  L471      AbstractCegarLoop]: Abstraction has 20023 states and 29915 transitions.
[2025-03-16 21:19:37,772 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 38.55555555555556) internal successors, (347), 8 states have internal predecessors, (347), 0 states have call successors, (0), 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-16 21:19:37,772 INFO  L276                IsEmpty]: Start isEmpty. Operand 20023 states and 29915 transitions.
[2025-03-16 21:19:37,781 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 348
[2025-03-16 21:19:37,781 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:19:37,782 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:19:37,782 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-03-16 21:19:37,782 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:19:37,782 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:19:37,782 INFO  L85        PathProgramCache]: Analyzing trace with hash -1723176225, now seen corresponding path program 1 times
[2025-03-16 21:19:37,782 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:19:37,782 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786050922]
[2025-03-16 21:19:37,782 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:19:37,783 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:19:37,838 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes.
[2025-03-16 21:19:39,234 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements.
[2025-03-16 21:19:39,234 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:19:39,234 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:19:39,651 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-16 21:19:39,651 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:19:39,651 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786050922]
[2025-03-16 21:19:39,651 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786050922] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:19:39,651 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:19:39,651 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2025-03-16 21:19:39,651 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123583126]
[2025-03-16 21:19:39,651 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:19:39,652 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-16 21:19:39,652 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:19:39,652 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-16 21:19:39,652 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-16 21:19:39,652 INFO  L87              Difference]: Start difference. First operand 20023 states and 29915 transitions. Second operand  has 7 states, 7 states have (on average 49.57142857142857) internal successors, (347), 6 states have internal predecessors, (347), 0 states have call successors, (0), 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-16 21:19:40,319 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:19:40,320 INFO  L93              Difference]: Finished difference Result 38813 states and 57975 transitions.
[2025-03-16 21:19:40,320 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-16 21:19:40,320 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 49.57142857142857) internal successors, (347), 6 states have internal predecessors, (347), 0 states have call successors, (0), 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 347
[2025-03-16 21:19:40,320 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:19:40,339 INFO  L225             Difference]: With dead ends: 38813
[2025-03-16 21:19:40,339 INFO  L226             Difference]: Without dead ends: 20263
[2025-03-16 21:19:40,354 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-03-16 21:19:40,354 INFO  L435           NwaCegarLoop]: 1195 mSDtfsCounter, 1524 mSDsluCounter, 4773 mSDsCounter, 0 mSdLazyCounter, 1936 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1524 SdHoareTripleChecker+Valid, 5968 SdHoareTripleChecker+Invalid, 1938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-16 21:19:40,355 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1524 Valid, 5968 Invalid, 1938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1936 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-16 21:19:40,366 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20263 states.
[2025-03-16 21:19:40,475 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20263 to 20263.
[2025-03-16 21:19:40,491 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20263 states, 20262 states have (on average 1.4906228407857072) internal successors, (30203), 20262 states have internal predecessors, (30203), 0 states have call successors, (0), 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-16 21:19:40,508 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20263 states to 20263 states and 30203 transitions.
[2025-03-16 21:19:40,508 INFO  L78                 Accepts]: Start accepts. Automaton has 20263 states and 30203 transitions. Word has length 347
[2025-03-16 21:19:40,509 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:19:40,509 INFO  L471      AbstractCegarLoop]: Abstraction has 20263 states and 30203 transitions.
[2025-03-16 21:19:40,509 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 49.57142857142857) internal successors, (347), 6 states have internal predecessors, (347), 0 states have call successors, (0), 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-16 21:19:40,509 INFO  L276                IsEmpty]: Start isEmpty. Operand 20263 states and 30203 transitions.
[2025-03-16 21:19:40,517 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 348
[2025-03-16 21:19:40,517 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:19:40,517 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:19:40,517 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-03-16 21:19:40,517 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:19:40,518 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:19:40,518 INFO  L85        PathProgramCache]: Analyzing trace with hash 2073380937, now seen corresponding path program 1 times
[2025-03-16 21:19:40,518 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:19:40,518 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866602285]
[2025-03-16 21:19:40,518 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:19:40,518 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:19:40,572 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 347 statements into 1 equivalence classes.
[2025-03-16 21:19:42,167 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 347 of 347 statements.
[2025-03-16 21:19:42,167 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:19:42,167 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:19:43,380 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-16 21:19:43,380 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:19:43,380 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866602285]
[2025-03-16 21:19:43,380 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866602285] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:19:43,380 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:19:43,380 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2025-03-16 21:19:43,380 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113466871]
[2025-03-16 21:19:43,380 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:19:43,380 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-03-16 21:19:43,381 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:19:43,381 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-03-16 21:19:43,381 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2025-03-16 21:19:43,381 INFO  L87              Difference]: Start difference. First operand 20263 states and 30203 transitions. Second operand  has 7 states, 7 states have (on average 49.57142857142857) internal successors, (347), 7 states have internal predecessors, (347), 0 states have call successors, (0), 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-16 21:19:44,057 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:19:44,058 INFO  L93              Difference]: Finished difference Result 52975 states and 79019 transitions.
[2025-03-16 21:19:44,058 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2025-03-16 21:19:44,058 INFO  L78                 Accepts]: Start accepts. Automaton has  has 7 states, 7 states have (on average 49.57142857142857) internal successors, (347), 7 states have internal predecessors, (347), 0 states have call successors, (0), 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 347
[2025-03-16 21:19:44,058 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:19:44,089 INFO  L225             Difference]: With dead ends: 52975
[2025-03-16 21:19:44,089 INFO  L226             Difference]: Without dead ends: 35273
[2025-03-16 21:19:44,107 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56
[2025-03-16 21:19:44,109 INFO  L435           NwaCegarLoop]: 1667 mSDtfsCounter, 785 mSDsluCounter, 7966 mSDsCounter, 0 mSdLazyCounter, 1998 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 9633 SdHoareTripleChecker+Invalid, 1999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-03-16 21:19:44,109 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 9633 Invalid, 1999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1998 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-03-16 21:19:44,127 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 35273 states.
[2025-03-16 21:19:44,304 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 35273 to 33659.
[2025-03-16 21:19:44,331 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 33659 states, 33658 states have (on average 1.491681026798978) internal successors, (50207), 33658 states have internal predecessors, (50207), 0 states have call successors, (0), 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-16 21:19:44,362 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33659 states to 33659 states and 50207 transitions.
[2025-03-16 21:19:44,362 INFO  L78                 Accepts]: Start accepts. Automaton has 33659 states and 50207 transitions. Word has length 347
[2025-03-16 21:19:44,362 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:19:44,362 INFO  L471      AbstractCegarLoop]: Abstraction has 33659 states and 50207 transitions.
[2025-03-16 21:19:44,363 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 49.57142857142857) internal successors, (347), 7 states have internal predecessors, (347), 0 states have call successors, (0), 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-16 21:19:44,363 INFO  L276                IsEmpty]: Start isEmpty. Operand 33659 states and 50207 transitions.
[2025-03-16 21:19:44,377 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 349
[2025-03-16 21:19:44,377 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:19:44,377 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:19:44,377 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-03-16 21:19:44,377 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:19:44,378 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:19:44,378 INFO  L85        PathProgramCache]: Analyzing trace with hash 604256618, now seen corresponding path program 1 times
[2025-03-16 21:19:44,378 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:19:44,378 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704253731]
[2025-03-16 21:19:44,378 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:19:44,378 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:19:44,429 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes.
[2025-03-16 21:19:45,388 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements.
[2025-03-16 21:19:45,388 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:19:45,388 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-03-16 21:19:46,273 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-16 21:19:46,274 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-03-16 21:19:46,274 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704253731]
[2025-03-16 21:19:46,274 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704253731] provided 1 perfect and 0 imperfect interpolant sequences
[2025-03-16 21:19:46,274 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-03-16 21:19:46,274 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-03-16 21:19:46,274 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241130816]
[2025-03-16 21:19:46,274 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-03-16 21:19:46,274 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2025-03-16 21:19:46,274 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-03-16 21:19:46,274 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2025-03-16 21:19:46,275 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110
[2025-03-16 21:19:46,275 INFO  L87              Difference]: Start difference. First operand 33659 states and 50207 transitions. Second operand  has 11 states, 11 states have (on average 31.636363636363637) internal successors, (348), 11 states have internal predecessors, (348), 0 states have call successors, (0), 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-16 21:19:48,362 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-03-16 21:19:48,362 INFO  L93              Difference]: Finished difference Result 69779 states and 104076 transitions.
[2025-03-16 21:19:48,362 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2025-03-16 21:19:48,362 INFO  L78                 Accepts]: Start accepts. Automaton has  has 11 states, 11 states have (on average 31.636363636363637) internal successors, (348), 11 states have internal predecessors, (348), 0 states have call successors, (0), 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 348
[2025-03-16 21:19:48,362 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-03-16 21:19:48,405 INFO  L225             Difference]: With dead ends: 69779
[2025-03-16 21:19:48,405 INFO  L226             Difference]: Without dead ends: 48102
[2025-03-16 21:19:48,430 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=284, Unknown=0, NotChecked=0, Total=380
[2025-03-16 21:19:48,431 INFO  L435           NwaCegarLoop]: 2662 mSDtfsCounter, 1649 mSDsluCounter, 14822 mSDsCounter, 0 mSdLazyCounter, 5776 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1649 SdHoareTripleChecker+Valid, 17484 SdHoareTripleChecker+Invalid, 5829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 5776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time
[2025-03-16 21:19:48,431 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [1649 Valid, 17484 Invalid, 5829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 5776 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time]
[2025-03-16 21:19:48,456 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 48102 states.
[2025-03-16 21:19:48,774 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 48102 to 47476.
[2025-03-16 21:19:48,810 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 47476 states, 47475 states have (on average 1.4899210110584518) internal successors, (70734), 47475 states have internal predecessors, (70734), 0 states have call successors, (0), 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-16 21:19:48,851 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 47476 states to 47476 states and 70734 transitions.
[2025-03-16 21:19:48,851 INFO  L78                 Accepts]: Start accepts. Automaton has 47476 states and 70734 transitions. Word has length 348
[2025-03-16 21:19:48,851 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-03-16 21:19:48,851 INFO  L471      AbstractCegarLoop]: Abstraction has 47476 states and 70734 transitions.
[2025-03-16 21:19:48,851 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 31.636363636363637) internal successors, (348), 11 states have internal predecessors, (348), 0 states have call successors, (0), 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-16 21:19:48,851 INFO  L276                IsEmpty]: Start isEmpty. Operand 47476 states and 70734 transitions.
[2025-03-16 21:19:48,873 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 349
[2025-03-16 21:19:48,873 INFO  L210           NwaCegarLoop]: Found error trace
[2025-03-16 21:19:48,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 21:19:48,874 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-03-16 21:19:48,874 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-03-16 21:19:48,874 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-03-16 21:19:48,874 INFO  L85        PathProgramCache]: Analyzing trace with hash -1055883065, now seen corresponding path program 1 times
[2025-03-16 21:19:48,875 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-03-16 21:19:48,875 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676156133]
[2025-03-16 21:19:48,875 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-03-16 21:19:48,875 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-03-16 21:19:48,923 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes.
[2025-03-16 21:19:50,730 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements.
[2025-03-16 21:19:50,730 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-03-16 21:19:50,730 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat