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


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


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

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ebe1e8929ddf4e64abcd8a155c27c57bcfa383e79973a610e813bee2b5432fdd
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-48c9605-m
[2025-02-07 23:52:26,902 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-07 23:52:26,968 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2025-02-07 23:52:26,977 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-07 23:52:26,980 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-07 23:52:27,004 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-07 23:52:27,005 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-07 23:52:27,006 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-07 23:52:27,006 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-07 23:52:27,006 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-07 23:52:27,006 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-07 23:52:27,006 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-07 23:52:27,007 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-07 23:52:27,007 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-07 23:52:27,007 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-07 23:52:27,007 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-07 23:52:27,007 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-07 23:52:27,007 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-07 23:52:27,008 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-07 23:52:27,008 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-07 23:52:27,008 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-07 23:52:27,008 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-07 23:52:27,008 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-07 23:52:27,008 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-07 23:52:27,008 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-07 23:52:27,008 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-07 23:52:27,009 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-07 23:52:27,009 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-07 23:52:27,009 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-07 23:52:27,009 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-07 23:52:27,009 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-07 23:52:27,009 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-07 23:52:27,009 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-07 23:52:27,010 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-07 23:52:27,010 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-07 23:52:27,010 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-07 23:52:27,010 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-07 23:52:27,010 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-07 23:52:27,010 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-07 23:52:27,010 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-07 23:52:27,010 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ebe1e8929ddf4e64abcd8a155c27c57bcfa383e79973a610e813bee2b5432fdd
[2025-02-07 23:52:27,318 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-07 23:52:27,329 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-07 23:52:27,333 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-07 23:52:27,334 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-07 23:52:27,334 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-07 23:52:27,335 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.resistance.2.prop2-back-serstep.c
[2025-02-07 23:52:28,697 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/adcf18ce2/1082b8b2f446406eadb1484f9ed38531/FLAG8dec02c9d
[2025-02-07 23:52:29,206 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-07 23:52:29,207 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.resistance.2.prop2-back-serstep.c
[2025-02-07 23:52:29,235 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/adcf18ce2/1082b8b2f446406eadb1484f9ed38531/FLAG8dec02c9d
[2025-02-07 23:52:29,257 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/adcf18ce2/1082b8b2f446406eadb1484f9ed38531
[2025-02-07 23:52:29,261 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-07 23:52:29,264 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-07 23:52:29,265 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-07 23:52:29,266 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-07 23:52:29,271 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-07 23:52:29,272 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:52:29" (1/1) ...
[2025-02-07 23:52:29,273 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@301f71bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:29, skipping insertion in model container
[2025-02-07 23:52:29,274 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 11:52:29" (1/1) ...
[2025-02-07 23:52:29,339 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-07 23:52:29,534 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.resistance.2.prop2-back-serstep.c[1178,1191]
[2025-02-07 23:52:29,960 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-07 23:52:29,969 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-07 23:52:29,978 WARN  L250   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.resistance.2.prop2-back-serstep.c[1178,1191]
[2025-02-07 23:52:30,229 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-07 23:52:30,245 INFO  L204         MainTranslator]: Completed translation
[2025-02-07 23:52:30,246 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:30 WrapperNode
[2025-02-07 23:52:30,247 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-07 23:52:30,247 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-07 23:52:30,248 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-07 23:52:30,248 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-07 23:52:30,254 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:30" (1/1) ...
[2025-02-07 23:52:30,316 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:30" (1/1) ...
[2025-02-07 23:52:31,030 INFO  L138                Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 8189
[2025-02-07 23:52:31,031 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-07 23:52:31,031 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-07 23:52:31,031 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-07 23:52:31,032 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-07 23:52:31,038 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:30" (1/1) ...
[2025-02-07 23:52:31,039 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:30" (1/1) ...
[2025-02-07 23:52:31,287 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:30" (1/1) ...
[2025-02-07 23:52:31,412 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-07 23:52:31,413 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:30" (1/1) ...
[2025-02-07 23:52:31,413 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:30" (1/1) ...
[2025-02-07 23:52:31,611 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:30" (1/1) ...
[2025-02-07 23:52:31,638 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:30" (1/1) ...
[2025-02-07 23:52:31,671 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:30" (1/1) ...
[2025-02-07 23:52:31,695 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:30" (1/1) ...
[2025-02-07 23:52:31,869 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-07 23:52:31,870 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-07 23:52:31,870 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-07 23:52:31,870 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-07 23:52:31,871 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:30" (1/1) ...
[2025-02-07 23:52:31,876 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-07 23:52:31,887 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-07 23:52:31,899 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-07 23:52:31,902 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-07 23:52:31,921 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-07 23:52:31,921 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-07 23:52:31,921 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-07 23:52:31,921 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-07 23:52:32,379 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-07 23:52:32,382 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-07 23:52:42,927 INFO  L?                        ?]: Removed 4304 outVars from TransFormulas that were not future-live.
[2025-02-07 23:52:42,927 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-07 23:52:43,262 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-07 23:52:43,267 INFO  L337             CfgBuilder]: Removed 17 assume(true) statements.
[2025-02-07 23:52:43,267 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:52:43 BoogieIcfgContainer
[2025-02-07 23:52:43,267 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-07 23:52:43,269 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-07 23:52:43,271 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-07 23:52:43,274 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-07 23:52:43,275 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 11:52:29" (1/3) ...
[2025-02-07 23:52:43,275 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f98ecdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:52:43, skipping insertion in model container
[2025-02-07 23:52:43,275 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 11:52:30" (2/3) ...
[2025-02-07 23:52:43,276 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f98ecdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 11:52:43, skipping insertion in model container
[2025-02-07 23:52:43,276 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 11:52:43" (3/3) ...
[2025-02-07 23:52:43,277 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.resistance.2.prop2-back-serstep.c
[2025-02-07 23:52:43,291 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-07 23:52:43,294 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.resistance.2.prop2-back-serstep.c that has 1 procedures, 2935 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-07 23:52:43,419 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-07 23:52:43,430 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;@7f5c4b40, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-07 23:52:43,430 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-07 23:52:43,445 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 2935 states, 2933 states have (on average 1.5028980565973407) internal successors, (4408), 2934 states have internal predecessors, (4408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:52:43,467 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 249
[2025-02-07 23:52:43,467 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:52:43,468 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]
[2025-02-07 23:52:43,469 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:52:43,474 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:52:43,475 INFO  L85        PathProgramCache]: Analyzing trace with hash 309106671, now seen corresponding path program 1 times
[2025-02-07 23:52:43,482 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:52:43,483 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524871008]
[2025-02-07 23:52:43,483 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:52:43,485 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:52:43,639 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes.
[2025-02-07 23:52:43,941 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements.
[2025-02-07 23:52:43,942 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:52:43,942 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:52:45,093 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:52:45,094 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:52:45,094 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524871008]
[2025-02-07 23:52:45,095 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524871008] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:52:45,095 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:52:45,095 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:52:45,097 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465261286]
[2025-02-07 23:52:45,097 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:52:45,101 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:52:45,102 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:52:45,120 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:52:45,121 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:52:45,130 INFO  L87              Difference]: Start difference. First operand  has 2935 states, 2933 states have (on average 1.5028980565973407) internal successors, (4408), 2934 states have internal predecessors, (4408), 0 states have call successors, (0), 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 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:52:46,826 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:52:46,827 INFO  L93              Difference]: Finished difference Result 5749 states and 8637 transitions.
[2025-02-07 23:52:46,829 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:52:46,830 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 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 248
[2025-02-07 23:52:46,831 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:52:46,855 INFO  L225             Difference]: With dead ends: 5749
[2025-02-07 23:52:46,856 INFO  L226             Difference]: Without dead ends: 2935
[2025-02-07 23:52:46,869 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-02-07 23:52:46,871 INFO  L435           NwaCegarLoop]: 3667 mSDtfsCounter, 0 mSDsluCounter, 7329 mSDsCounter, 0 mSdLazyCounter, 2218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10996 SdHoareTripleChecker+Invalid, 2218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time
[2025-02-07 23:52:46,874 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10996 Invalid, 2218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2218 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time]
[2025-02-07 23:52:46,898 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2935 states.
[2025-02-07 23:52:47,013 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2935 to 2935.
[2025-02-07 23:52:47,024 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2935 states, 2934 states have (on average 1.5020449897750512) internal successors, (4407), 2934 states have internal predecessors, (4407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:52:47,037 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2935 states to 2935 states and 4407 transitions.
[2025-02-07 23:52:47,038 INFO  L78                 Accepts]: Start accepts. Automaton has 2935 states and 4407 transitions. Word has length 248
[2025-02-07 23:52:47,041 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:52:47,042 INFO  L471      AbstractCegarLoop]: Abstraction has 2935 states and 4407 transitions.
[2025-02-07 23:52:47,042 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 62.0) internal successors, (248), 4 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:52:47,043 INFO  L276                IsEmpty]: Start isEmpty. Operand 2935 states and 4407 transitions.
[2025-02-07 23:52:47,046 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 250
[2025-02-07 23:52:47,049 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:52:47,051 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]
[2025-02-07 23:52:47,052 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-02-07 23:52:47,052 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:52:47,053 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:52:47,053 INFO  L85        PathProgramCache]: Analyzing trace with hash 997055633, now seen corresponding path program 1 times
[2025-02-07 23:52:47,053 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:52:47,053 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494043913]
[2025-02-07 23:52:47,053 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:52:47,053 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:52:47,119 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 249 statements into 1 equivalence classes.
[2025-02-07 23:52:47,198 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 249 of 249 statements.
[2025-02-07 23:52:47,199 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:52:47,199 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:52:47,608 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:52:47,610 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:52:47,611 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494043913]
[2025-02-07 23:52:47,611 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494043913] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:52:47,611 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:52:47,611 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:52:47,611 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621552780]
[2025-02-07 23:52:47,611 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:52:47,613 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:52:47,614 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:52:47,615 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:52:47,615 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:52:47,615 INFO  L87              Difference]: Start difference. First operand 2935 states and 4407 transitions. Second operand  has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:52:49,036 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:52:49,037 INFO  L93              Difference]: Finished difference Result 5751 states and 8636 transitions.
[2025-02-07 23:52:49,037 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:52:49,037 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 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 249
[2025-02-07 23:52:49,039 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:52:49,051 INFO  L225             Difference]: With dead ends: 5751
[2025-02-07 23:52:49,051 INFO  L226             Difference]: Without dead ends: 2937
[2025-02-07 23:52:49,056 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-02-07 23:52:49,057 INFO  L435           NwaCegarLoop]: 3667 mSDtfsCounter, 0 mSDsluCounter, 7326 mSDsCounter, 0 mSdLazyCounter, 2221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10993 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-07 23:52:49,057 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10993 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2221 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-07 23:52:49,062 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2937 states.
[2025-02-07 23:52:49,109 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2937 to 2937.
[2025-02-07 23:52:49,115 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2937 states, 2936 states have (on average 1.5017029972752043) internal successors, (4409), 2936 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-02-07 23:52:49,125 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2937 states to 2937 states and 4409 transitions.
[2025-02-07 23:52:49,126 INFO  L78                 Accepts]: Start accepts. Automaton has 2937 states and 4409 transitions. Word has length 249
[2025-02-07 23:52:49,126 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:52:49,126 INFO  L471      AbstractCegarLoop]: Abstraction has 2937 states and 4409 transitions.
[2025-02-07 23:52:49,127 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 62.25) internal successors, (249), 4 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:52:49,127 INFO  L276                IsEmpty]: Start isEmpty. Operand 2937 states and 4409 transitions.
[2025-02-07 23:52:49,129 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 251
[2025-02-07 23:52:49,129 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:52:49,130 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]
[2025-02-07 23:52:49,130 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-07 23:52:49,130 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:52:49,130 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:52:49,131 INFO  L85        PathProgramCache]: Analyzing trace with hash -1519500246, now seen corresponding path program 1 times
[2025-02-07 23:52:49,131 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:52:49,131 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142328416]
[2025-02-07 23:52:49,131 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:52:49,131 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:52:49,203 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes.
[2025-02-07 23:52:49,271 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements.
[2025-02-07 23:52:49,271 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:52:49,271 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:52:49,749 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:52:49,749 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:52:49,749 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142328416]
[2025-02-07 23:52:49,749 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142328416] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:52:49,749 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:52:49,749 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:52:49,749 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707545828]
[2025-02-07 23:52:49,749 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:52:49,750 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:52:49,750 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:52:49,750 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:52:49,750 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:52:49,751 INFO  L87              Difference]: Start difference. First operand 2937 states and 4409 transitions. Second operand  has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:52:51,085 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:52:51,086 INFO  L93              Difference]: Finished difference Result 5755 states and 8640 transitions.
[2025-02-07 23:52:51,086 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:52:51,086 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 0 states have call successors, (0), 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 250
[2025-02-07 23:52:51,087 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:52:51,098 INFO  L225             Difference]: With dead ends: 5755
[2025-02-07 23:52:51,099 INFO  L226             Difference]: Without dead ends: 2939
[2025-02-07 23:52:51,103 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-02-07 23:52:51,104 INFO  L435           NwaCegarLoop]: 3667 mSDtfsCounter, 0 mSDsluCounter, 7326 mSDsCounter, 0 mSdLazyCounter, 2221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10993 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-07 23:52:51,104 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10993 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2221 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-07 23:52:51,109 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2939 states.
[2025-02-07 23:52:51,156 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 2939.
[2025-02-07 23:52:51,161 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2939 states, 2938 states have (on average 1.5013614703880191) internal successors, (4411), 2938 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-02-07 23:52:51,167 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2939 states to 2939 states and 4411 transitions.
[2025-02-07 23:52:51,167 INFO  L78                 Accepts]: Start accepts. Automaton has 2939 states and 4411 transitions. Word has length 250
[2025-02-07 23:52:51,168 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:52:51,168 INFO  L471      AbstractCegarLoop]: Abstraction has 2939 states and 4411 transitions.
[2025-02-07 23:52:51,168 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:52:51,169 INFO  L276                IsEmpty]: Start isEmpty. Operand 2939 states and 4411 transitions.
[2025-02-07 23:52:51,171 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 252
[2025-02-07 23:52:51,171 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:52:51,172 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]
[2025-02-07 23:52:51,172 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-07 23:52:51,172 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:52:51,173 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:52:51,173 INFO  L85        PathProgramCache]: Analyzing trace with hash 2028499414, now seen corresponding path program 1 times
[2025-02-07 23:52:51,173 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:52:51,174 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360920257]
[2025-02-07 23:52:51,174 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:52:51,174 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:52:51,224 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes.
[2025-02-07 23:52:51,267 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements.
[2025-02-07 23:52:51,268 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:52:51,268 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:52:51,595 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:52:51,595 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:52:51,596 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360920257]
[2025-02-07 23:52:51,596 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360920257] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:52:51,596 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:52:51,596 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:52:51,596 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341015152]
[2025-02-07 23:52:51,596 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:52:51,596 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:52:51,596 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:52:51,597 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:52:51,597 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:52:51,598 INFO  L87              Difference]: Start difference. First operand 2939 states and 4411 transitions. Second operand  has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:52:52,866 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:52:52,866 INFO  L93              Difference]: Finished difference Result 5759 states and 8644 transitions.
[2025-02-07 23:52:52,866 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:52:52,866 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 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 251
[2025-02-07 23:52:52,867 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:52:52,876 INFO  L225             Difference]: With dead ends: 5759
[2025-02-07 23:52:52,876 INFO  L226             Difference]: Without dead ends: 2941
[2025-02-07 23:52:52,880 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-02-07 23:52:52,881 INFO  L435           NwaCegarLoop]: 3667 mSDtfsCounter, 0 mSDsluCounter, 7326 mSDsCounter, 0 mSdLazyCounter, 2221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10993 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-02-07 23:52:52,882 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10993 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2221 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-02-07 23:52:52,886 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2941 states.
[2025-02-07 23:52:52,929 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2941 to 2941.
[2025-02-07 23:52:52,934 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2941 states, 2940 states have (on average 1.5010204081632652) internal successors, (4413), 2940 states have internal predecessors, (4413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:52:52,941 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2941 states to 2941 states and 4413 transitions.
[2025-02-07 23:52:52,941 INFO  L78                 Accepts]: Start accepts. Automaton has 2941 states and 4413 transitions. Word has length 251
[2025-02-07 23:52:52,942 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:52:52,942 INFO  L471      AbstractCegarLoop]: Abstraction has 2941 states and 4413 transitions.
[2025-02-07 23:52:52,942 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 62.75) internal successors, (251), 4 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:52:52,942 INFO  L276                IsEmpty]: Start isEmpty. Operand 2941 states and 4413 transitions.
[2025-02-07 23:52:52,945 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 253
[2025-02-07 23:52:52,945 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:52:52,945 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]
[2025-02-07 23:52:52,945 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-07 23:52:52,946 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:52:52,946 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:52:52,946 INFO  L85        PathProgramCache]: Analyzing trace with hash -841225883, now seen corresponding path program 1 times
[2025-02-07 23:52:52,946 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:52:52,946 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840564914]
[2025-02-07 23:52:52,946 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:52:52,947 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:52:52,991 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes.
[2025-02-07 23:52:53,093 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements.
[2025-02-07 23:52:53,094 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:52:53,095 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:52:53,376 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:52:53,377 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:52:53,377 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840564914]
[2025-02-07 23:52:53,377 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840564914] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:52:53,377 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:52:53,377 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:52:53,377 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681099110]
[2025-02-07 23:52:53,377 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:52:53,378 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:52:53,378 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:52:53,378 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:52:53,379 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:52:53,379 INFO  L87              Difference]: Start difference. First operand 2941 states and 4413 transitions. Second operand  has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:52:54,633 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:52:54,634 INFO  L93              Difference]: Finished difference Result 5763 states and 8648 transitions.
[2025-02-07 23:52:54,634 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:52:54,634 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 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 252
[2025-02-07 23:52:54,635 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:52:54,642 INFO  L225             Difference]: With dead ends: 5763
[2025-02-07 23:52:54,642 INFO  L226             Difference]: Without dead ends: 2943
[2025-02-07 23:52:54,646 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-02-07 23:52:54,647 INFO  L435           NwaCegarLoop]: 3667 mSDtfsCounter, 0 mSDsluCounter, 7326 mSDsCounter, 0 mSdLazyCounter, 2221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10993 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-02-07 23:52:54,647 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10993 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2221 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-02-07 23:52:54,652 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2943 states.
[2025-02-07 23:52:54,687 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2943 to 2943.
[2025-02-07 23:52:54,692 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2943 states, 2942 states have (on average 1.5006798096532972) internal successors, (4415), 2942 states have internal predecessors, (4415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:52:54,697 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2943 states to 2943 states and 4415 transitions.
[2025-02-07 23:52:54,697 INFO  L78                 Accepts]: Start accepts. Automaton has 2943 states and 4415 transitions. Word has length 252
[2025-02-07 23:52:54,698 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:52:54,698 INFO  L471      AbstractCegarLoop]: Abstraction has 2943 states and 4415 transitions.
[2025-02-07 23:52:54,698 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 63.0) internal successors, (252), 4 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:52:54,698 INFO  L276                IsEmpty]: Start isEmpty. Operand 2943 states and 4415 transitions.
[2025-02-07 23:52:54,701 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 254
[2025-02-07 23:52:54,701 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:52:54,701 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]
[2025-02-07 23:52:54,701 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-07 23:52:54,702 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:52:54,702 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:52:54,702 INFO  L85        PathProgramCache]: Analyzing trace with hash -439740901, now seen corresponding path program 1 times
[2025-02-07 23:52:54,702 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:52:54,702 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443634145]
[2025-02-07 23:52:54,702 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:52:54,703 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:52:54,747 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 253 statements into 1 equivalence classes.
[2025-02-07 23:52:54,796 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 253 of 253 statements.
[2025-02-07 23:52:54,797 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:52:54,797 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:52:55,077 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:52:55,077 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:52:55,077 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443634145]
[2025-02-07 23:52:55,078 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443634145] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:52:55,078 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:52:55,078 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:52:55,078 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901205033]
[2025-02-07 23:52:55,078 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:52:55,079 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:52:55,079 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:52:55,081 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:52:55,081 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:52:55,081 INFO  L87              Difference]: Start difference. First operand 2943 states and 4415 transitions. Second operand  has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:52:56,321 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:52:56,321 INFO  L93              Difference]: Finished difference Result 5767 states and 8652 transitions.
[2025-02-07 23:52:56,321 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:52:56,321 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 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 253
[2025-02-07 23:52:56,322 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:52:56,328 INFO  L225             Difference]: With dead ends: 5767
[2025-02-07 23:52:56,328 INFO  L226             Difference]: Without dead ends: 2945
[2025-02-07 23:52:56,331 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-02-07 23:52:56,331 INFO  L435           NwaCegarLoop]: 3667 mSDtfsCounter, 0 mSDsluCounter, 7326 mSDsCounter, 0 mSdLazyCounter, 2221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10993 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time
[2025-02-07 23:52:56,331 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10993 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2221 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time]
[2025-02-07 23:52:56,336 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2945 states.
[2025-02-07 23:52:56,379 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 2945.
[2025-02-07 23:52:56,385 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2945 states, 2944 states have (on average 1.5003396739130435) internal successors, (4417), 2944 states have internal predecessors, (4417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:52:56,391 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2945 states and 4417 transitions.
[2025-02-07 23:52:56,392 INFO  L78                 Accepts]: Start accepts. Automaton has 2945 states and 4417 transitions. Word has length 253
[2025-02-07 23:52:56,392 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:52:56,392 INFO  L471      AbstractCegarLoop]: Abstraction has 2945 states and 4417 transitions.
[2025-02-07 23:52:56,393 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:52:56,393 INFO  L276                IsEmpty]: Start isEmpty. Operand 2945 states and 4417 transitions.
[2025-02-07 23:52:56,396 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 255
[2025-02-07 23:52:56,396 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:52:56,396 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]
[2025-02-07 23:52:56,397 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-07 23:52:56,397 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:52:56,397 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:52:56,398 INFO  L85        PathProgramCache]: Analyzing trace with hash 1627879328, now seen corresponding path program 1 times
[2025-02-07 23:52:56,398 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:52:56,398 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107847891]
[2025-02-07 23:52:56,398 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:52:56,398 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:52:56,456 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes.
[2025-02-07 23:52:56,506 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements.
[2025-02-07 23:52:56,506 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:52:56,506 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:52:56,858 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:52:56,859 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:52:56,859 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107847891]
[2025-02-07 23:52:56,859 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107847891] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:52:56,859 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:52:56,859 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 23:52:56,859 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083997700]
[2025-02-07 23:52:56,859 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:52:56,860 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 23:52:56,860 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:52:56,861 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 23:52:56,861 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 23:52:56,861 INFO  L87              Difference]: Start difference. First operand 2945 states and 4417 transitions. Second operand  has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:52:58,264 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:52:58,264 INFO  L93              Difference]: Finished difference Result 5771 states and 8656 transitions.
[2025-02-07 23:52:58,265 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:52:58,265 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 0 states have call successors, (0), 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 254
[2025-02-07 23:52:58,265 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:52:58,271 INFO  L225             Difference]: With dead ends: 5771
[2025-02-07 23:52:58,272 INFO  L226             Difference]: Without dead ends: 2947
[2025-02-07 23:52:58,274 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 23:52:58,275 INFO  L435           NwaCegarLoop]: 3667 mSDtfsCounter, 0 mSDsluCounter, 10988 mSDsCounter, 0 mSdLazyCounter, 2964 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14655 SdHoareTripleChecker+Invalid, 2965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-07 23:52:58,275 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14655 Invalid, 2965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2964 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-07 23:52:58,279 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2947 states.
[2025-02-07 23:52:58,310 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2947 to 2947.
[2025-02-07 23:52:58,319 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2947 states, 2946 states have (on average 1.5) internal successors, (4419), 2946 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:52:58,325 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2947 states to 2947 states and 4419 transitions.
[2025-02-07 23:52:58,326 INFO  L78                 Accepts]: Start accepts. Automaton has 2947 states and 4419 transitions. Word has length 254
[2025-02-07 23:52:58,329 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:52:58,329 INFO  L471      AbstractCegarLoop]: Abstraction has 2947 states and 4419 transitions.
[2025-02-07 23:52:58,330 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 50.8) internal successors, (254), 5 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:52:58,330 INFO  L276                IsEmpty]: Start isEmpty. Operand 2947 states and 4419 transitions.
[2025-02-07 23:52:58,332 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 256
[2025-02-07 23:52:58,332 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:52:58,333 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]
[2025-02-07 23:52:58,333 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-07 23:52:58,333 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:52:58,333 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:52:58,333 INFO  L85        PathProgramCache]: Analyzing trace with hash -227485344, now seen corresponding path program 1 times
[2025-02-07 23:52:58,333 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:52:58,333 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617715314]
[2025-02-07 23:52:58,333 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:52:58,334 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:52:58,381 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes.
[2025-02-07 23:52:58,425 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements.
[2025-02-07 23:52:58,425 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:52:58,425 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:52:58,675 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:52:58,676 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:52:58,676 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617715314]
[2025-02-07 23:52:58,676 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617715314] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:52:58,676 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:52:58,676 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:52:58,676 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705416993]
[2025-02-07 23:52:58,677 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:52:58,677 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:52:58,677 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:52:58,678 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:52:58,678 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:52:58,678 INFO  L87              Difference]: Start difference. First operand 2947 states and 4419 transitions. Second operand  has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:52:59,866 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:52:59,866 INFO  L93              Difference]: Finished difference Result 5779 states and 8666 transitions.
[2025-02-07 23:52:59,867 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:52:59,867 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 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 255
[2025-02-07 23:52:59,867 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:52:59,876 INFO  L225             Difference]: With dead ends: 5779
[2025-02-07 23:52:59,877 INFO  L226             Difference]: Without dead ends: 2953
[2025-02-07 23:52:59,881 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-02-07 23:52:59,881 INFO  L435           NwaCegarLoop]: 3667 mSDtfsCounter, 4 mSDsluCounter, 7326 mSDsCounter, 0 mSdLazyCounter, 2221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 10993 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-07 23:52:59,881 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 10993 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2221 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-07 23:52:59,886 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2953 states.
[2025-02-07 23:52:59,918 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 2953.
[2025-02-07 23:52:59,922 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2953 states, 2952 states have (on average 1.4996612466124661) internal successors, (4427), 2952 states have internal predecessors, (4427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:52:59,926 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 4427 transitions.
[2025-02-07 23:52:59,926 INFO  L78                 Accepts]: Start accepts. Automaton has 2953 states and 4427 transitions. Word has length 255
[2025-02-07 23:52:59,927 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:52:59,927 INFO  L471      AbstractCegarLoop]: Abstraction has 2953 states and 4427 transitions.
[2025-02-07 23:52:59,927 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 63.75) internal successors, (255), 4 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:52:59,927 INFO  L276                IsEmpty]: Start isEmpty. Operand 2953 states and 4427 transitions.
[2025-02-07 23:52:59,930 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 257
[2025-02-07 23:52:59,930 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:52:59,930 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]
[2025-02-07 23:52:59,931 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-07 23:52:59,931 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:52:59,931 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:52:59,932 INFO  L85        PathProgramCache]: Analyzing trace with hash -167564458, now seen corresponding path program 1 times
[2025-02-07 23:52:59,932 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:52:59,932 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61136769]
[2025-02-07 23:52:59,932 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:52:59,933 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:52:59,989 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 256 statements into 1 equivalence classes.
[2025-02-07 23:53:00,034 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 256 of 256 statements.
[2025-02-07 23:53:00,034 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:53:00,034 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:53:00,280 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:53:00,281 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:53:00,281 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61136769]
[2025-02-07 23:53:00,281 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61136769] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:53:00,282 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:53:00,282 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:53:00,282 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83100871]
[2025-02-07 23:53:00,282 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:53:00,282 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:53:00,282 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:53:00,283 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:53:00,284 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:53:00,284 INFO  L87              Difference]: Start difference. First operand 2953 states and 4427 transitions. Second operand  has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:01,379 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:53:01,380 INFO  L93              Difference]: Finished difference Result 5787 states and 8676 transitions.
[2025-02-07 23:53:01,380 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:53:01,380 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 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 256
[2025-02-07 23:53:01,380 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:53:01,389 INFO  L225             Difference]: With dead ends: 5787
[2025-02-07 23:53:01,389 INFO  L226             Difference]: Without dead ends: 2955
[2025-02-07 23:53:01,392 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-02-07 23:53:01,393 INFO  L435           NwaCegarLoop]: 3667 mSDtfsCounter, 0 mSDsluCounter, 7326 mSDsCounter, 0 mSdLazyCounter, 2221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10993 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-02-07 23:53:01,393 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10993 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2221 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-02-07 23:53:01,397 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2955 states.
[2025-02-07 23:53:01,419 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2955.
[2025-02-07 23:53:01,422 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2955 states, 2954 states have (on average 1.499322951929587) internal successors, (4429), 2954 states have internal predecessors, (4429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:01,425 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2955 states to 2955 states and 4429 transitions.
[2025-02-07 23:53:01,425 INFO  L78                 Accepts]: Start accepts. Automaton has 2955 states and 4429 transitions. Word has length 256
[2025-02-07 23:53:01,425 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:53:01,425 INFO  L471      AbstractCegarLoop]: Abstraction has 2955 states and 4429 transitions.
[2025-02-07 23:53:01,425 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 64.0) internal successors, (256), 4 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:01,425 INFO  L276                IsEmpty]: Start isEmpty. Operand 2955 states and 4429 transitions.
[2025-02-07 23:53:01,427 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 258
[2025-02-07 23:53:01,428 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:53:01,428 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]
[2025-02-07 23:53:01,428 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-07 23:53:01,428 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:53:01,428 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:53:01,429 INFO  L85        PathProgramCache]: Analyzing trace with hash 119485893, now seen corresponding path program 1 times
[2025-02-07 23:53:01,429 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:53:01,429 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612931650]
[2025-02-07 23:53:01,429 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:53:01,429 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:53:01,477 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 257 statements into 1 equivalence classes.
[2025-02-07 23:53:01,522 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 257 of 257 statements.
[2025-02-07 23:53:01,522 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:53:01,522 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:53:01,772 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:53:01,773 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:53:01,773 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612931650]
[2025-02-07 23:53:01,773 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612931650] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:53:01,773 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:53:01,773 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:53:01,773 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192995431]
[2025-02-07 23:53:01,773 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:53:01,774 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:53:01,774 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:53:01,774 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:53:01,774 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:53:01,775 INFO  L87              Difference]: Start difference. First operand 2955 states and 4429 transitions. Second operand  has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:02,836 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:53:02,837 INFO  L93              Difference]: Finished difference Result 5795 states and 8686 transitions.
[2025-02-07 23:53:02,837 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:53:02,837 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 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 257
[2025-02-07 23:53:02,838 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:53:02,844 INFO  L225             Difference]: With dead ends: 5795
[2025-02-07 23:53:02,844 INFO  L226             Difference]: Without dead ends: 2961
[2025-02-07 23:53:02,846 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-02-07 23:53:02,846 INFO  L435           NwaCegarLoop]: 3667 mSDtfsCounter, 4 mSDsluCounter, 7326 mSDsCounter, 0 mSdLazyCounter, 2221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 10993 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-02-07 23:53:02,846 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 10993 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2221 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-02-07 23:53:02,849 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2961 states.
[2025-02-07 23:53:02,865 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2961 to 2961.
[2025-02-07 23:53:02,868 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2961 states, 2960 states have (on average 1.4989864864864866) internal successors, (4437), 2960 states have internal predecessors, (4437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:02,870 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2961 states to 2961 states and 4437 transitions.
[2025-02-07 23:53:02,870 INFO  L78                 Accepts]: Start accepts. Automaton has 2961 states and 4437 transitions. Word has length 257
[2025-02-07 23:53:02,870 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:53:02,870 INFO  L471      AbstractCegarLoop]: Abstraction has 2961 states and 4437 transitions.
[2025-02-07 23:53:02,871 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 64.25) internal successors, (257), 4 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:02,871 INFO  L276                IsEmpty]: Start isEmpty. Operand 2961 states and 4437 transitions.
[2025-02-07 23:53:02,872 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 259
[2025-02-07 23:53:02,872 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:53:02,872 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]
[2025-02-07 23:53:02,872 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-07 23:53:02,872 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:53:02,873 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:53:02,873 INFO  L85        PathProgramCache]: Analyzing trace with hash -1940922644, now seen corresponding path program 1 times
[2025-02-07 23:53:02,873 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:53:02,873 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023376661]
[2025-02-07 23:53:02,873 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:53:02,873 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:53:02,912 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 258 statements into 1 equivalence classes.
[2025-02-07 23:53:02,950 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 258 of 258 statements.
[2025-02-07 23:53:02,950 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:53:02,950 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:53:03,164 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:53:03,165 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:53:03,165 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023376661]
[2025-02-07 23:53:03,165 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023376661] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:53:03,165 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:53:03,165 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:53:03,165 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191076783]
[2025-02-07 23:53:03,165 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:53:03,165 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:53:03,166 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:53:03,166 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:53:03,166 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:53:03,166 INFO  L87              Difference]: Start difference. First operand 2961 states and 4437 transitions. Second operand  has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:04,226 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:53:04,226 INFO  L93              Difference]: Finished difference Result 5803 states and 8696 transitions.
[2025-02-07 23:53:04,226 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:53:04,226 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 0 states have call successors, (0), 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 258
[2025-02-07 23:53:04,227 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:53:04,231 INFO  L225             Difference]: With dead ends: 5803
[2025-02-07 23:53:04,231 INFO  L226             Difference]: Without dead ends: 2963
[2025-02-07 23:53:04,233 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-02-07 23:53:04,233 INFO  L435           NwaCegarLoop]: 3667 mSDtfsCounter, 0 mSDsluCounter, 7321 mSDsCounter, 0 mSdLazyCounter, 2226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10988 SdHoareTripleChecker+Invalid, 2226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-02-07 23:53:04,234 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10988 Invalid, 2226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2226 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-02-07 23:53:04,237 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2963 states.
[2025-02-07 23:53:04,261 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 2963.
[2025-02-07 23:53:04,264 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2963 states, 2962 states have (on average 1.4986495611073598) internal successors, (4439), 2962 states have internal predecessors, (4439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:04,267 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2963 states to 2963 states and 4439 transitions.
[2025-02-07 23:53:04,268 INFO  L78                 Accepts]: Start accepts. Automaton has 2963 states and 4439 transitions. Word has length 258
[2025-02-07 23:53:04,268 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:53:04,268 INFO  L471      AbstractCegarLoop]: Abstraction has 2963 states and 4439 transitions.
[2025-02-07 23:53:04,269 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 64.5) internal successors, (258), 4 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:04,269 INFO  L276                IsEmpty]: Start isEmpty. Operand 2963 states and 4439 transitions.
[2025-02-07 23:53:04,270 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 260
[2025-02-07 23:53:04,270 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:53:04,270 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]
[2025-02-07 23:53:04,271 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-07 23:53:04,271 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:53:04,271 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:53:04,271 INFO  L85        PathProgramCache]: Analyzing trace with hash -62454966, now seen corresponding path program 1 times
[2025-02-07 23:53:04,271 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:53:04,272 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107363808]
[2025-02-07 23:53:04,272 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:53:04,272 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:53:04,313 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 259 statements into 1 equivalence classes.
[2025-02-07 23:53:04,353 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 259 of 259 statements.
[2025-02-07 23:53:04,353 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:53:04,353 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:53:04,572 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:53:04,572 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:53:04,572 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107363808]
[2025-02-07 23:53:04,572 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107363808] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:53:04,573 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:53:04,573 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:53:04,573 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738289195]
[2025-02-07 23:53:04,573 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:53:04,573 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:53:04,574 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:53:04,575 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:53:04,575 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:53:04,575 INFO  L87              Difference]: Start difference. First operand 2963 states and 4439 transitions. Second operand  has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:05,598 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:53:05,598 INFO  L93              Difference]: Finished difference Result 5813 states and 8708 transitions.
[2025-02-07 23:53:05,598 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:53:05,599 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 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 259
[2025-02-07 23:53:05,599 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:53:05,606 INFO  L225             Difference]: With dead ends: 5813
[2025-02-07 23:53:05,606 INFO  L226             Difference]: Without dead ends: 2971
[2025-02-07 23:53:05,608 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-02-07 23:53:05,609 INFO  L435           NwaCegarLoop]: 3667 mSDtfsCounter, 3 mSDsluCounter, 7326 mSDsCounter, 0 mSdLazyCounter, 2221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 10993 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-02-07 23:53:05,609 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 10993 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2221 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-02-07 23:53:05,612 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2971 states.
[2025-02-07 23:53:05,639 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2971 to 2967.
[2025-02-07 23:53:05,643 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2967 states, 2966 states have (on average 1.4986513823331085) internal successors, (4445), 2966 states have internal predecessors, (4445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:05,650 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2967 states to 2967 states and 4445 transitions.
[2025-02-07 23:53:05,650 INFO  L78                 Accepts]: Start accepts. Automaton has 2967 states and 4445 transitions. Word has length 259
[2025-02-07 23:53:05,650 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:53:05,651 INFO  L471      AbstractCegarLoop]: Abstraction has 2967 states and 4445 transitions.
[2025-02-07 23:53:05,651 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 64.75) internal successors, (259), 4 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:05,651 INFO  L276                IsEmpty]: Start isEmpty. Operand 2967 states and 4445 transitions.
[2025-02-07 23:53:05,652 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 261
[2025-02-07 23:53:05,652 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:53:05,653 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]
[2025-02-07 23:53:05,653 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-07 23:53:05,653 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:53:05,653 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:53:05,654 INFO  L85        PathProgramCache]: Analyzing trace with hash 1468777447, now seen corresponding path program 1 times
[2025-02-07 23:53:05,654 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:53:05,654 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664308698]
[2025-02-07 23:53:05,654 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:53:05,654 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:53:05,696 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 260 statements into 1 equivalence classes.
[2025-02-07 23:53:05,735 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 260 of 260 statements.
[2025-02-07 23:53:05,736 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:53:05,736 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:53:05,974 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:53:05,974 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:53:05,975 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664308698]
[2025-02-07 23:53:05,975 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664308698] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:53:05,975 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:53:05,975 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:53:05,975 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700134453]
[2025-02-07 23:53:05,975 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:53:05,975 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:53:05,976 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:53:05,976 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:53:05,976 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:53:05,976 INFO  L87              Difference]: Start difference. First operand 2967 states and 4445 transitions. Second operand  has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:06,982 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:53:06,983 INFO  L93              Difference]: Finished difference Result 5819 states and 8718 transitions.
[2025-02-07 23:53:06,983 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:53:06,983 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 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 260
[2025-02-07 23:53:06,983 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:53:06,988 INFO  L225             Difference]: With dead ends: 5819
[2025-02-07 23:53:06,988 INFO  L226             Difference]: Without dead ends: 2973
[2025-02-07 23:53:06,990 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-02-07 23:53:06,991 INFO  L435           NwaCegarLoop]: 3667 mSDtfsCounter, 4 mSDsluCounter, 7326 mSDsCounter, 0 mSdLazyCounter, 2221 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 10993 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-02-07 23:53:06,991 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 10993 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2221 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-02-07 23:53:06,994 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2973 states.
[2025-02-07 23:53:07,024 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2973.
[2025-02-07 23:53:07,029 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2973 states, 2972 states have (on average 1.4983176312247646) internal successors, (4453), 2972 states have internal predecessors, (4453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:07,032 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2973 states to 2973 states and 4453 transitions.
[2025-02-07 23:53:07,032 INFO  L78                 Accepts]: Start accepts. Automaton has 2973 states and 4453 transitions. Word has length 260
[2025-02-07 23:53:07,033 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:53:07,033 INFO  L471      AbstractCegarLoop]: Abstraction has 2973 states and 4453 transitions.
[2025-02-07 23:53:07,033 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:07,033 INFO  L276                IsEmpty]: Start isEmpty. Operand 2973 states and 4453 transitions.
[2025-02-07 23:53:07,035 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 262
[2025-02-07 23:53:07,035 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:53:07,035 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]
[2025-02-07 23:53:07,035 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-07 23:53:07,036 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:53:07,036 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:53:07,036 INFO  L85        PathProgramCache]: Analyzing trace with hash 1673405300, now seen corresponding path program 1 times
[2025-02-07 23:53:07,036 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:53:07,036 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138599817]
[2025-02-07 23:53:07,036 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:53:07,037 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:53:07,078 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes.
[2025-02-07 23:53:07,121 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements.
[2025-02-07 23:53:07,121 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:53:07,121 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:53:07,314 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:53:07,314 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:53:07,314 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138599817]
[2025-02-07 23:53:07,315 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138599817] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:53:07,315 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:53:07,315 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:53:07,315 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265801066]
[2025-02-07 23:53:07,315 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:53:07,315 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:53:07,315 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:53:07,316 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:53:07,316 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:53:07,316 INFO  L87              Difference]: Start difference. First operand 2973 states and 4453 transitions. Second operand  has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:08,296 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:53:08,296 INFO  L93              Difference]: Finished difference Result 5827 states and 8728 transitions.
[2025-02-07 23:53:08,296 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:53:08,297 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 0 states have call successors, (0), 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 261
[2025-02-07 23:53:08,297 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:53:08,302 INFO  L225             Difference]: With dead ends: 5827
[2025-02-07 23:53:08,302 INFO  L226             Difference]: Without dead ends: 2975
[2025-02-07 23:53:08,305 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-02-07 23:53:08,306 INFO  L435           NwaCegarLoop]: 3667 mSDtfsCounter, 0 mSDsluCounter, 7321 mSDsCounter, 0 mSdLazyCounter, 2226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10988 SdHoareTripleChecker+Invalid, 2226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-07 23:53:08,306 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10988 Invalid, 2226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2226 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-07 23:53:08,309 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2975 states.
[2025-02-07 23:53:08,339 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 2975.
[2025-02-07 23:53:08,343 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2975 states, 2974 states have (on average 1.4979825151311366) internal successors, (4455), 2974 states have internal predecessors, (4455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:08,346 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 4455 transitions.
[2025-02-07 23:53:08,346 INFO  L78                 Accepts]: Start accepts. Automaton has 2975 states and 4455 transitions. Word has length 261
[2025-02-07 23:53:08,347 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:53:08,347 INFO  L471      AbstractCegarLoop]: Abstraction has 2975 states and 4455 transitions.
[2025-02-07 23:53:08,347 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 65.25) internal successors, (261), 4 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:08,347 INFO  L276                IsEmpty]: Start isEmpty. Operand 2975 states and 4455 transitions.
[2025-02-07 23:53:08,349 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 263
[2025-02-07 23:53:08,349 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:53:08,349 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]
[2025-02-07 23:53:08,349 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-07 23:53:08,349 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:53:08,350 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:53:08,350 INFO  L85        PathProgramCache]: Analyzing trace with hash 1502323650, now seen corresponding path program 1 times
[2025-02-07 23:53:08,350 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:53:08,350 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889804661]
[2025-02-07 23:53:08,350 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:53:08,350 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:53:08,442 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes.
[2025-02-07 23:53:08,491 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements.
[2025-02-07 23:53:08,491 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:53:08,491 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:53:08,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-02-07 23:53:08,843 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:53:08,843 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889804661]
[2025-02-07 23:53:08,843 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889804661] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:53:08,843 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:53:08,843 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 23:53:08,843 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771966925]
[2025-02-07 23:53:08,843 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:53:08,844 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 23:53:08,844 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:53:08,844 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 23:53:08,845 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 23:53:08,845 INFO  L87              Difference]: Start difference. First operand 2975 states and 4455 transitions. Second operand  has 5 states, 5 states have (on average 52.4) internal successors, (262), 5 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:10,346 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:53:10,346 INFO  L93              Difference]: Finished difference Result 5837 states and 8740 transitions.
[2025-02-07 23:53:10,347 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-07 23:53:10,347 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 52.4) internal successors, (262), 5 states have internal predecessors, (262), 0 states have call successors, (0), 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 262
[2025-02-07 23:53:10,347 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:53:10,353 INFO  L225             Difference]: With dead ends: 5837
[2025-02-07 23:53:10,354 INFO  L226             Difference]: Without dead ends: 2983
[2025-02-07 23:53:10,358 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 23:53:10,358 INFO  L435           NwaCegarLoop]: 3665 mSDtfsCounter, 3 mSDsluCounter, 10981 mSDsCounter, 0 mSdLazyCounter, 2973 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 14646 SdHoareTripleChecker+Invalid, 2975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time
[2025-02-07 23:53:10,359 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 14646 Invalid, 2975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2973 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time]
[2025-02-07 23:53:10,362 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2983 states.
[2025-02-07 23:53:10,391 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 2979.
[2025-02-07 23:53:10,395 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2979 states, 2978 states have (on average 1.4979852249832102) internal successors, (4461), 2978 states have internal predecessors, (4461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:10,399 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2979 states to 2979 states and 4461 transitions.
[2025-02-07 23:53:10,399 INFO  L78                 Accepts]: Start accepts. Automaton has 2979 states and 4461 transitions. Word has length 262
[2025-02-07 23:53:10,400 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:53:10,400 INFO  L471      AbstractCegarLoop]: Abstraction has 2979 states and 4461 transitions.
[2025-02-07 23:53:10,400 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 52.4) internal successors, (262), 5 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:10,400 INFO  L276                IsEmpty]: Start isEmpty. Operand 2979 states and 4461 transitions.
[2025-02-07 23:53:10,402 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 264
[2025-02-07 23:53:10,402 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:53:10,402 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]
[2025-02-07 23:53:10,402 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-07 23:53:10,402 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:53:10,403 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:53:10,403 INFO  L85        PathProgramCache]: Analyzing trace with hash -1926868711, now seen corresponding path program 1 times
[2025-02-07 23:53:10,403 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:53:10,403 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476191231]
[2025-02-07 23:53:10,403 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:53:10,403 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:53:10,443 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes.
[2025-02-07 23:53:10,480 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements.
[2025-02-07 23:53:10,480 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:53:10,480 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:53:10,670 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:53:10,671 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:53:10,671 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476191231]
[2025-02-07 23:53:10,672 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476191231] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:53:10,673 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:53:10,673 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:53:10,673 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703367015]
[2025-02-07 23:53:10,673 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:53:10,673 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:53:10,673 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:53:10,674 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:53:10,674 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:53:10,675 INFO  L87              Difference]: Start difference. First operand 2979 states and 4461 transitions. Second operand  has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:11,705 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:53:11,705 INFO  L93              Difference]: Finished difference Result 5839 states and 8744 transitions.
[2025-02-07 23:53:11,705 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:53:11,706 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 0 states have call successors, (0), 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 263
[2025-02-07 23:53:11,706 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:53:11,712 INFO  L225             Difference]: With dead ends: 5839
[2025-02-07 23:53:11,712 INFO  L226             Difference]: Without dead ends: 2981
[2025-02-07 23:53:11,716 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-02-07 23:53:11,717 INFO  L435           NwaCegarLoop]: 3667 mSDtfsCounter, 0 mSDsluCounter, 7321 mSDsCounter, 0 mSdLazyCounter, 2226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10988 SdHoareTripleChecker+Invalid, 2226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-02-07 23:53:11,718 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10988 Invalid, 2226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2226 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-02-07 23:53:11,721 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2981 states.
[2025-02-07 23:53:11,747 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2981.
[2025-02-07 23:53:11,751 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2981 states, 2980 states have (on average 1.4976510067114095) internal successors, (4463), 2980 states have internal predecessors, (4463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:11,755 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2981 states to 2981 states and 4463 transitions.
[2025-02-07 23:53:11,755 INFO  L78                 Accepts]: Start accepts. Automaton has 2981 states and 4463 transitions. Word has length 263
[2025-02-07 23:53:11,756 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:53:11,756 INFO  L471      AbstractCegarLoop]: Abstraction has 2981 states and 4463 transitions.
[2025-02-07 23:53:11,756 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 65.75) internal successors, (263), 4 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:11,756 INFO  L276                IsEmpty]: Start isEmpty. Operand 2981 states and 4463 transitions.
[2025-02-07 23:53:11,758 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 265
[2025-02-07 23:53:11,758 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:53:11,758 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]
[2025-02-07 23:53:11,758 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-07 23:53:11,758 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:53:11,760 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:53:11,760 INFO  L85        PathProgramCache]: Analyzing trace with hash -1300601699, now seen corresponding path program 1 times
[2025-02-07 23:53:11,760 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:53:11,760 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967604234]
[2025-02-07 23:53:11,761 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:53:11,761 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:53:11,806 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 264 statements into 1 equivalence classes.
[2025-02-07 23:53:11,846 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 264 of 264 statements.
[2025-02-07 23:53:11,846 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:53:11,846 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:53:12,143 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:53:12,144 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:53:12,144 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967604234]
[2025-02-07 23:53:12,144 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967604234] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:53:12,144 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:53:12,144 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 23:53:12,144 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346172951]
[2025-02-07 23:53:12,144 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:53:12,144 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 23:53:12,144 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:53:12,145 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 23:53:12,145 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 23:53:12,145 INFO  L87              Difference]: Start difference. First operand 2981 states and 4463 transitions. Second operand  has 5 states, 5 states have (on average 52.8) internal successors, (264), 5 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:13,101 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:53:13,101 INFO  L93              Difference]: Finished difference Result 5849 states and 8756 transitions.
[2025-02-07 23:53:13,102 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-07 23:53:13,102 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 52.8) internal successors, (264), 5 states have internal predecessors, (264), 0 states have call successors, (0), 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 264
[2025-02-07 23:53:13,102 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:53:13,106 INFO  L225             Difference]: With dead ends: 5849
[2025-02-07 23:53:13,106 INFO  L226             Difference]: Without dead ends: 2989
[2025-02-07 23:53:13,109 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 23:53:13,110 INFO  L435           NwaCegarLoop]: 3665 mSDtfsCounter, 4 mSDsluCounter, 7324 mSDsCounter, 0 mSdLazyCounter, 2230 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 10989 SdHoareTripleChecker+Invalid, 2232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-07 23:53:13,110 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 10989 Invalid, 2232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2230 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-07 23:53:13,114 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2989 states.
[2025-02-07 23:53:13,138 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2989 to 2985.
[2025-02-07 23:53:13,142 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2985 states, 2984 states have (on average 1.4976541554959786) internal successors, (4469), 2984 states have internal predecessors, (4469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:13,145 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2985 states to 2985 states and 4469 transitions.
[2025-02-07 23:53:13,145 INFO  L78                 Accepts]: Start accepts. Automaton has 2985 states and 4469 transitions. Word has length 264
[2025-02-07 23:53:13,146 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:53:13,146 INFO  L471      AbstractCegarLoop]: Abstraction has 2985 states and 4469 transitions.
[2025-02-07 23:53:13,146 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 52.8) internal successors, (264), 5 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:13,146 INFO  L276                IsEmpty]: Start isEmpty. Operand 2985 states and 4469 transitions.
[2025-02-07 23:53:13,148 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 266
[2025-02-07 23:53:13,148 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:53:13,148 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]
[2025-02-07 23:53:13,148 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-07 23:53:13,148 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:53:13,149 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:53:13,149 INFO  L85        PathProgramCache]: Analyzing trace with hash -915561026, now seen corresponding path program 1 times
[2025-02-07 23:53:13,149 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:53:13,149 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348051840]
[2025-02-07 23:53:13,149 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:53:13,150 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:53:13,189 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes.
[2025-02-07 23:53:13,228 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements.
[2025-02-07 23:53:13,228 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:53:13,229 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:53:13,423 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:53:13,423 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:53:13,424 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348051840]
[2025-02-07 23:53:13,424 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348051840] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:53:13,424 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:53:13,424 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:53:13,424 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128123370]
[2025-02-07 23:53:13,424 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:53:13,424 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-07 23:53:13,425 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:53:13,425 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-07 23:53:13,425 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-07 23:53:13,425 INFO  L87              Difference]: Start difference. First operand 2985 states and 4469 transitions. Second operand  has 4 states, 4 states have (on average 66.25) internal successors, (265), 4 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:14,442 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:53:14,442 INFO  L93              Difference]: Finished difference Result 5851 states and 8760 transitions.
[2025-02-07 23:53:14,443 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-07 23:53:14,443 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 66.25) internal successors, (265), 4 states have internal predecessors, (265), 0 states have call successors, (0), 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 265
[2025-02-07 23:53:14,443 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:53:14,446 INFO  L225             Difference]: With dead ends: 5851
[2025-02-07 23:53:14,447 INFO  L226             Difference]: Without dead ends: 2987
[2025-02-07 23:53:14,450 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-02-07 23:53:14,451 INFO  L435           NwaCegarLoop]: 3667 mSDtfsCounter, 0 mSDsluCounter, 7321 mSDsCounter, 0 mSdLazyCounter, 2226 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10988 SdHoareTripleChecker+Invalid, 2226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-02-07 23:53:14,451 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10988 Invalid, 2226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2226 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-02-07 23:53:14,455 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2987 states.
[2025-02-07 23:53:14,482 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 2987.
[2025-02-07 23:53:14,485 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2987 states, 2986 states have (on average 1.4973208305425318) internal successors, (4471), 2986 states have internal predecessors, (4471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:14,489 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2987 states to 2987 states and 4471 transitions.
[2025-02-07 23:53:14,489 INFO  L78                 Accepts]: Start accepts. Automaton has 2987 states and 4471 transitions. Word has length 265
[2025-02-07 23:53:14,490 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:53:14,490 INFO  L471      AbstractCegarLoop]: Abstraction has 2987 states and 4471 transitions.
[2025-02-07 23:53:14,490 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 66.25) internal successors, (265), 4 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:14,490 INFO  L276                IsEmpty]: Start isEmpty. Operand 2987 states and 4471 transitions.
[2025-02-07 23:53:14,492 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 267
[2025-02-07 23:53:14,492 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:53:14,492 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]
[2025-02-07 23:53:14,492 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-02-07 23:53:14,492 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:53:14,493 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:53:14,493 INFO  L85        PathProgramCache]: Analyzing trace with hash -531368328, now seen corresponding path program 1 times
[2025-02-07 23:53:14,493 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:53:14,493 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275195566]
[2025-02-07 23:53:14,493 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:53:14,493 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:53:14,535 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes.
[2025-02-07 23:53:14,571 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements.
[2025-02-07 23:53:14,572 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:53:14,572 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:53:14,819 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:53:14,819 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:53:14,819 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275195566]
[2025-02-07 23:53:14,819 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275195566] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:53:14,819 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:53:14,819 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-07 23:53:14,819 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121788258]
[2025-02-07 23:53:14,819 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:53:14,821 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 23:53:14,821 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:53:14,821 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 23:53:14,821 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 23:53:14,821 INFO  L87              Difference]: Start difference. First operand 2987 states and 4471 transitions. Second operand  has 5 states, 5 states have (on average 53.2) internal successors, (266), 5 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:15,923 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:53:15,924 INFO  L93              Difference]: Finished difference Result 5861 states and 8772 transitions.
[2025-02-07 23:53:15,924 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-07 23:53:15,924 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 53.2) internal successors, (266), 5 states have internal predecessors, (266), 0 states have call successors, (0), 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 266
[2025-02-07 23:53:15,924 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:53:15,926 INFO  L225             Difference]: With dead ends: 5861
[2025-02-07 23:53:15,926 INFO  L226             Difference]: Without dead ends: 2995
[2025-02-07 23:53:15,928 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-07 23:53:15,928 INFO  L435           NwaCegarLoop]: 3665 mSDtfsCounter, 4 mSDsluCounter, 7324 mSDsCounter, 0 mSdLazyCounter, 2230 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 10989 SdHoareTripleChecker+Invalid, 2232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-07 23:53:15,928 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 10989 Invalid, 2232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2230 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-07 23:53:15,930 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2995 states.
[2025-02-07 23:53:15,949 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2995 to 2991.
[2025-02-07 23:53:15,952 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 2991 states, 2990 states have (on average 1.497324414715719) internal successors, (4477), 2990 states have internal predecessors, (4477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:15,955 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2991 states to 2991 states and 4477 transitions.
[2025-02-07 23:53:15,955 INFO  L78                 Accepts]: Start accepts. Automaton has 2991 states and 4477 transitions. Word has length 266
[2025-02-07 23:53:15,955 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:53:15,955 INFO  L471      AbstractCegarLoop]: Abstraction has 2991 states and 4477 transitions.
[2025-02-07 23:53:15,956 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 53.2) internal successors, (266), 5 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:15,956 INFO  L276                IsEmpty]: Start isEmpty. Operand 2991 states and 4477 transitions.
[2025-02-07 23:53:15,957 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 268
[2025-02-07 23:53:15,957 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:53:15,958 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]
[2025-02-07 23:53:15,958 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-02-07 23:53:15,958 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:53:15,958 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:53:15,959 INFO  L85        PathProgramCache]: Analyzing trace with hash -2029506205, now seen corresponding path program 1 times
[2025-02-07 23:53:15,959 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:53:15,959 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381287385]
[2025-02-07 23:53:15,959 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:53:15,959 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:53:15,996 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes.
[2025-02-07 23:53:16,030 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements.
[2025-02-07 23:53:16,030 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:53:16,031 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:53:16,412 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:53:16,412 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:53:16,412 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381287385]
[2025-02-07 23:53:16,412 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381287385] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:53:16,412 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:53:16,413 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-07 23:53:16,413 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107184994]
[2025-02-07 23:53:16,413 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:53:16,413 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-07 23:53:16,413 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:53:16,414 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-07 23:53:16,414 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-07 23:53:16,414 INFO  L87              Difference]: Start difference. First operand 2991 states and 4477 transitions. Second operand  has 5 states, 5 states have (on average 53.4) internal successors, (267), 4 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:18,203 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:53:18,203 INFO  L93              Difference]: Finished difference Result 8589 states and 12858 transitions.
[2025-02-07 23:53:18,203 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-07 23:53:18,203 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 53.4) internal successors, (267), 4 states have internal predecessors, (267), 0 states have call successors, (0), 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 267
[2025-02-07 23:53:18,203 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:53:18,208 INFO  L225             Difference]: With dead ends: 8589
[2025-02-07 23:53:18,208 INFO  L226             Difference]: Without dead ends: 5719
[2025-02-07 23:53:18,211 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2025-02-07 23:53:18,212 INFO  L435           NwaCegarLoop]: 3664 mSDtfsCounter, 4063 mSDsluCounter, 10834 mSDsCounter, 0 mSdLazyCounter, 2941 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4063 SdHoareTripleChecker+Valid, 14498 SdHoareTripleChecker+Invalid, 2941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-02-07 23:53:18,212 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [4063 Valid, 14498 Invalid, 2941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2941 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-02-07 23:53:18,217 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 5719 states.
[2025-02-07 23:53:18,252 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 5719 to 3273.
[2025-02-07 23:53:18,256 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3273 states, 3272 states have (on average 1.4972493887530562) internal successors, (4899), 3272 states have internal predecessors, (4899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:18,260 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3273 states to 3273 states and 4899 transitions.
[2025-02-07 23:53:18,260 INFO  L78                 Accepts]: Start accepts. Automaton has 3273 states and 4899 transitions. Word has length 267
[2025-02-07 23:53:18,260 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:53:18,260 INFO  L471      AbstractCegarLoop]: Abstraction has 3273 states and 4899 transitions.
[2025-02-07 23:53:18,260 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 53.4) internal successors, (267), 4 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:18,260 INFO  L276                IsEmpty]: Start isEmpty. Operand 3273 states and 4899 transitions.
[2025-02-07 23:53:18,278 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1615
[2025-02-07 23:53:18,278 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:53:18,279 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 23:53:18,280 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-02-07 23:53:18,280 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:53:18,281 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:53:18,282 INFO  L85        PathProgramCache]: Analyzing trace with hash 340286561, now seen corresponding path program 1 times
[2025-02-07 23:53:18,282 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:53:18,282 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382019290]
[2025-02-07 23:53:18,282 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:53:18,282 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:53:18,444 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1614 statements into 1 equivalence classes.
[2025-02-07 23:53:20,948 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1614 of 1614 statements.
[2025-02-07 23:53:20,949 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:53:20,949 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:53:23,238 INFO  L134       CoverageAnalysis]: Checked inductivity of 186 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:53:23,238 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:53:23,238 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382019290]
[2025-02-07 23:53:23,239 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382019290] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:53:23,239 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:53:23,239 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-07 23:53:23,239 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974607586]
[2025-02-07 23:53:23,239 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:53:23,241 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-07 23:53:23,241 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:53:23,242 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-07 23:53:23,243 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-07 23:53:23,243 INFO  L87              Difference]: Start difference. First operand 3273 states and 4899 transitions. Second operand  has 3 states, 3 states have (on average 538.0) internal successors, (1614), 3 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:24,010 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:53:24,010 INFO  L93              Difference]: Finished difference Result 6144 states and 9197 transitions.
[2025-02-07 23:53:24,010 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-07 23:53:24,011 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 538.0) internal successors, (1614), 3 states have internal predecessors, (1614), 0 states have call successors, (0), 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 1614
[2025-02-07 23:53:24,011 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:53:24,013 INFO  L225             Difference]: With dead ends: 6144
[2025-02-07 23:53:24,013 INFO  L226             Difference]: Without dead ends: 3274
[2025-02-07 23:53:24,015 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-07 23:53:24,016 INFO  L435           NwaCegarLoop]: 3668 mSDtfsCounter, 0 mSDsluCounter, 3663 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7331 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-07 23:53:24,016 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7331 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-07 23:53:24,019 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3274 states.
[2025-02-07 23:53:24,045 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3274 to 3274.
[2025-02-07 23:53:24,049 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3274 states, 3273 states have (on average 1.497097464100214) internal successors, (4900), 3273 states have internal predecessors, (4900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:24,052 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3274 states to 3274 states and 4900 transitions.
[2025-02-07 23:53:24,052 INFO  L78                 Accepts]: Start accepts. Automaton has 3274 states and 4900 transitions. Word has length 1614
[2025-02-07 23:53:24,052 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:53:24,052 INFO  L471      AbstractCegarLoop]: Abstraction has 3274 states and 4900 transitions.
[2025-02-07 23:53:24,053 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 538.0) internal successors, (1614), 3 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:24,053 INFO  L276                IsEmpty]: Start isEmpty. Operand 3274 states and 4900 transitions.
[2025-02-07 23:53:24,071 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1615
[2025-02-07 23:53:24,071 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:53:24,072 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 23:53:24,072 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-02-07 23:53:24,072 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:53:24,073 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:53:24,074 INFO  L85        PathProgramCache]: Analyzing trace with hash -310323454, now seen corresponding path program 1 times
[2025-02-07 23:53:24,074 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:53:24,074 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41885978]
[2025-02-07 23:53:24,074 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:53:24,074 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:53:24,226 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1614 statements into 1 equivalence classes.
[2025-02-07 23:53:25,053 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1614 of 1614 statements.
[2025-02-07 23:53:25,053 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:53:25,053 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:53:26,526 INFO  L134       CoverageAnalysis]: Checked inductivity of 186 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:53:26,526 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:53:26,526 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41885978]
[2025-02-07 23:53:26,526 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41885978] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:53:26,526 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:53:26,527 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-07 23:53:26,527 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042674312]
[2025-02-07 23:53:26,527 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:53:26,528 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-07 23:53:26,528 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:53:26,530 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-07 23:53:26,530 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-07 23:53:26,530 INFO  L87              Difference]: Start difference. First operand 3274 states and 4900 transitions. Second operand  has 3 states, 3 states have (on average 538.0) internal successors, (1614), 3 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:27,277 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:53:27,277 INFO  L93              Difference]: Finished difference Result 6146 states and 9199 transitions.
[2025-02-07 23:53:27,280 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-07 23:53:27,280 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 538.0) internal successors, (1614), 3 states have internal predecessors, (1614), 0 states have call successors, (0), 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 1614
[2025-02-07 23:53:27,280 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:53:27,282 INFO  L225             Difference]: With dead ends: 6146
[2025-02-07 23:53:27,282 INFO  L226             Difference]: Without dead ends: 3275
[2025-02-07 23:53:27,285 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-07 23:53:27,286 INFO  L435           NwaCegarLoop]: 3668 mSDtfsCounter, 0 mSDsluCounter, 3663 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7331 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-07 23:53:27,286 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7331 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-07 23:53:27,289 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3275 states.
[2025-02-07 23:53:27,312 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3275 to 3275.
[2025-02-07 23:53:27,315 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3275 states, 3274 states have (on average 1.4969456322541235) internal successors, (4901), 3274 states have internal predecessors, (4901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:27,318 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 4901 transitions.
[2025-02-07 23:53:27,318 INFO  L78                 Accepts]: Start accepts. Automaton has 3275 states and 4901 transitions. Word has length 1614
[2025-02-07 23:53:27,318 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:53:27,318 INFO  L471      AbstractCegarLoop]: Abstraction has 3275 states and 4901 transitions.
[2025-02-07 23:53:27,319 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 538.0) internal successors, (1614), 3 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:27,319 INFO  L276                IsEmpty]: Start isEmpty. Operand 3275 states and 4901 transitions.
[2025-02-07 23:53:27,336 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1615
[2025-02-07 23:53:27,337 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:53:27,338 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 23:53:27,338 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-02-07 23:53:27,338 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:53:27,339 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:53:27,340 INFO  L85        PathProgramCache]: Analyzing trace with hash 232980579, now seen corresponding path program 1 times
[2025-02-07 23:53:27,340 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:53:27,340 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63431909]
[2025-02-07 23:53:27,340 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:53:27,341 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:53:27,497 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1614 statements into 1 equivalence classes.
[2025-02-07 23:53:28,427 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1614 of 1614 statements.
[2025-02-07 23:53:28,427 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:53:28,427 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:53:29,950 INFO  L134       CoverageAnalysis]: Checked inductivity of 186 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:53:29,951 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:53:29,951 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63431909]
[2025-02-07 23:53:29,951 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63431909] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:53:29,951 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:53:29,951 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-07 23:53:29,951 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432883558]
[2025-02-07 23:53:29,951 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:53:29,953 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-07 23:53:29,953 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:53:29,955 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-07 23:53:29,955 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-07 23:53:29,955 INFO  L87              Difference]: Start difference. First operand 3275 states and 4901 transitions. Second operand  has 3 states, 3 states have (on average 538.0) internal successors, (1614), 3 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:30,746 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-07 23:53:30,747 INFO  L93              Difference]: Finished difference Result 6148 states and 9201 transitions.
[2025-02-07 23:53:30,747 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2025-02-07 23:53:30,747 INFO  L78                 Accepts]: Start accepts. Automaton has  has 3 states, 3 states have (on average 538.0) internal successors, (1614), 3 states have internal predecessors, (1614), 0 states have call successors, (0), 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 1614
[2025-02-07 23:53:30,748 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-07 23:53:30,751 INFO  L225             Difference]: With dead ends: 6148
[2025-02-07 23:53:30,751 INFO  L226             Difference]: Without dead ends: 3276
[2025-02-07 23:53:30,754 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-07 23:53:30,754 INFO  L435           NwaCegarLoop]: 3668 mSDtfsCounter, 0 mSDsluCounter, 3663 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7331 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-07 23:53:30,754 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7331 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-07 23:53:30,758 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3276 states.
[2025-02-07 23:53:30,795 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 3276.
[2025-02-07 23:53:30,797 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 3276 states, 3275 states have (on average 1.496793893129771) internal successors, (4902), 3275 states have internal predecessors, (4902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:30,801 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3276 states to 3276 states and 4902 transitions.
[2025-02-07 23:53:30,802 INFO  L78                 Accepts]: Start accepts. Automaton has 3276 states and 4902 transitions. Word has length 1614
[2025-02-07 23:53:30,802 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-07 23:53:30,802 INFO  L471      AbstractCegarLoop]: Abstraction has 3276 states and 4902 transitions.
[2025-02-07 23:53:30,802 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 538.0) internal successors, (1614), 3 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-02-07 23:53:30,802 INFO  L276                IsEmpty]: Start isEmpty. Operand 3276 states and 4902 transitions.
[2025-02-07 23:53:30,832 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 1615
[2025-02-07 23:53:30,832 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-07 23:53:30,833 INFO  L218           NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-07 23:53:30,833 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-02-07 23:53:30,833 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-07 23:53:30,834 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-07 23:53:30,835 INFO  L85        PathProgramCache]: Analyzing trace with hash 905131844, now seen corresponding path program 1 times
[2025-02-07 23:53:30,835 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-07 23:53:30,835 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238877935]
[2025-02-07 23:53:30,835 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-07 23:53:30,835 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-07 23:53:31,057 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1614 statements into 1 equivalence classes.
[2025-02-07 23:53:31,913 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1614 of 1614 statements.
[2025-02-07 23:53:31,913 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-07 23:53:31,913 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-07 23:53:33,142 INFO  L134       CoverageAnalysis]: Checked inductivity of 186 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-02-07 23:53:33,143 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-07 23:53:33,143 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238877935]
[2025-02-07 23:53:33,143 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238877935] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-07 23:53:33,143 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-07 23:53:33,143 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2025-02-07 23:53:33,143 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113854887]
[2025-02-07 23:53:33,143 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-07 23:53:33,145 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2025-02-07 23:53:33,145 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-07 23:53:33,146 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2025-02-07 23:53:33,146 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2025-02-07 23:53:33,146 INFO  L87              Difference]: Start difference. First operand 3276 states and 4902 transitions. Second operand  has 3 states, 3 states have (on average 538.0) internal successors, (1614), 3 states have internal predecessors, (1614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)