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


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


Checking for ERROR reachability
Using default analysis
Version c00e63dc
Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n2_w32_d32_e0.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 f47cf78aacf65194fef79baf46fc9683d3c1918ff436d3ab448d61b9df5df9d1
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-c00e63d-m
[2025-02-05 18:08:51,337 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-02-05 18:08:51,389 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf
[2025-02-05 18:08:51,392 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-02-05 18:08:51,392 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-02-05 18:08:51,414 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-02-05 18:08:51,415 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-02-05 18:08:51,415 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-02-05 18:08:51,416 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-02-05 18:08:51,416 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-02-05 18:08:51,416 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-02-05 18:08:51,416 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-02-05 18:08:51,417 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-02-05 18:08:51,417 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-02-05 18:08:51,417 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-02-05 18:08:51,417 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-02-05 18:08:51,417 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-02-05 18:08:51,418 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-02-05 18:08:51,418 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-02-05 18:08:51,418 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-02-05 18:08:51,418 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-02-05 18:08:51,418 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-02-05 18:08:51,418 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-02-05 18:08:51,419 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-02-05 18:08:51,419 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-02-05 18:08:51,419 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-02-05 18:08:51,419 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-02-05 18:08:51,419 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-02-05 18:08:51,419 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-02-05 18:08:51,419 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 18:08:51,419 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-02-05 18:08:51,419 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-02-05 18:08:51,419 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-02-05 18:08:51,419 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-02-05 18:08:51,419 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-02-05 18:08:51,419 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-02-05 18:08:51,419 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2025-02-05 18:08:51,419 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-02-05 18:08:51,419 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-02-05 18:08:51,419 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-02-05 18:08:51,420 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 -> f47cf78aacf65194fef79baf46fc9683d3c1918ff436d3ab448d61b9df5df9d1
[2025-02-05 18:08:51,660 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-02-05 18:08:51,666 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-02-05 18:08:51,667 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-02-05 18:08:51,668 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-02-05 18:08:51,668 INFO  L274        PluginConnector]: CDTParser initialized
[2025-02-05 18:08:51,668 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.arbitrated_top_n2_w32_d32_e0.c
[2025-02-05 18:08:52,794 INFO  L533              CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb645cb9d/7c6f90384c6b4c02aa9dac874ee862f7/FLAGc59f15baf
[2025-02-05 18:08:53,250 INFO  L384              CDTParser]: Found 1 translation units.
[2025-02-05 18:08:53,250 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.arbitrated_top_n2_w32_d32_e0.c
[2025-02-05 18:08:53,269 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb645cb9d/7c6f90384c6b4c02aa9dac874ee862f7/FLAGc59f15baf
[2025-02-05 18:08:53,283 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb645cb9d/7c6f90384c6b4c02aa9dac874ee862f7
[2025-02-05 18:08:53,286 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-02-05 18:08:53,287 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2025-02-05 18:08:53,292 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-02-05 18:08:53,292 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-02-05 18:08:53,295 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-02-05 18:08:53,296 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:08:53" (1/1) ...
[2025-02-05 18:08:53,296 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@655b42f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:08:53, skipping insertion in model container
[2025-02-05 18:08:53,297 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 06:08:53" (1/1) ...
[2025-02-05 18:08:53,357 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-02-05 18:08:53,498 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.arbitrated_top_n2_w32_d32_e0.c[1271,1284]
[2025-02-05 18:08:53,798 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 18:08:53,805 INFO  L200         MainTranslator]: Completed pre-run
[2025-02-05 18:08:53,814 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.arbitrated_top_n2_w32_d32_e0.c[1271,1284]
[2025-02-05 18:08:53,995 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-02-05 18:08:54,005 INFO  L204         MainTranslator]: Completed translation
[2025-02-05 18:08:54,006 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:08:54 WrapperNode
[2025-02-05 18:08:54,006 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-02-05 18:08:54,007 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-02-05 18:08:54,007 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-02-05 18:08:54,007 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-02-05 18:08:54,011 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:08:54" (1/1) ...
[2025-02-05 18:08:54,067 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:08:54" (1/1) ...
[2025-02-05 18:08:54,609 INFO  L138                Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 6630
[2025-02-05 18:08:54,609 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-02-05 18:08:54,611 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-02-05 18:08:54,611 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-02-05 18:08:54,611 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-02-05 18:08:54,617 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:08:54" (1/1) ...
[2025-02-05 18:08:54,617 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:08:54" (1/1) ...
[2025-02-05 18:08:54,737 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:08:54" (1/1) ...
[2025-02-05 18:08:54,843 INFO  L175           MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2025-02-05 18:08:54,845 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:08:54" (1/1) ...
[2025-02-05 18:08:54,845 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:08:54" (1/1) ...
[2025-02-05 18:08:54,925 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:08:54" (1/1) ...
[2025-02-05 18:08:54,940 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:08:54" (1/1) ...
[2025-02-05 18:08:54,960 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:08:54" (1/1) ...
[2025-02-05 18:08:54,984 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:08:54" (1/1) ...
[2025-02-05 18:08:55,026 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-02-05 18:08:55,027 INFO  L112        PluginConnector]: ------------------------IcfgBuilder----------------------------
[2025-02-05 18:08:55,028 INFO  L270        PluginConnector]: Initializing IcfgBuilder...
[2025-02-05 18:08:55,028 INFO  L274        PluginConnector]: IcfgBuilder initialized
[2025-02-05 18:08:55,028 INFO  L184        PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:08:54" (1/1) ...
[2025-02-05 18:08:55,032 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-02-05 18:08:55,040 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 18:08:55,050 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-02-05 18:08:55,054 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-02-05 18:08:55,070 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-02-05 18:08:55,070 INFO  L130     BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2025-02-05 18:08:55,070 INFO  L138     BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2025-02-05 18:08:55,070 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-02-05 18:08:55,070 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-02-05 18:08:55,070 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-02-05 18:08:55,709 INFO  L257             CfgBuilder]: Building ICFG
[2025-02-05 18:08:55,715 INFO  L287             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-02-05 18:09:02,410 INFO  L?                        ?]: Removed 3732 outVars from TransFormulas that were not future-live.
[2025-02-05 18:09:02,410 INFO  L308             CfgBuilder]: Performing block encoding
[2025-02-05 18:09:02,571 INFO  L332             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-02-05 18:09:02,571 INFO  L337             CfgBuilder]: Removed 0 assume(true) statements.
[2025-02-05 18:09:02,572 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:09:02 BoogieIcfgContainer
[2025-02-05 18:09:02,572 INFO  L131        PluginConnector]: ------------------------ END IcfgBuilder----------------------------
[2025-02-05 18:09:02,573 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-02-05 18:09:02,573 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-02-05 18:09:02,577 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-02-05 18:09:02,577 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 06:08:53" (1/3) ...
[2025-02-05 18:09:02,577 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa2880e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:09:02, skipping insertion in model container
[2025-02-05 18:09:02,577 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 06:08:54" (2/3) ...
[2025-02-05 18:09:02,578 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fa2880e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 06:09:02, skipping insertion in model container
[2025-02-05 18:09:02,578 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 06:09:02" (3/3) ...
[2025-02-05 18:09:02,579 INFO  L128   eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.arbitrated_top_n2_w32_d32_e0.c
[2025-02-05 18:09:02,590 INFO  L216   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-02-05 18:09:02,591 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.arbitrated_top_n2_w32_d32_e0.c that has 2 procedures, 1928 locations, 1 initial locations, 1 loop locations, and 1 error locations.
[2025-02-05 18:09:02,655 INFO  L332      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-02-05 18:09:02,662 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;@16901bb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-02-05 18:09:02,662 INFO  L334      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2025-02-05 18:09:02,669 INFO  L276                IsEmpty]: Start isEmpty. Operand  has 1928 states, 1918 states have (on average 1.497393117831074) internal successors, (2872), 1919 states have internal predecessors, (2872), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:02,701 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 600
[2025-02-05 18:09:02,703 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:02,704 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:02,704 INFO  L396      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:02,709 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:02,709 INFO  L85        PathProgramCache]: Analyzing trace with hash 1017128728, now seen corresponding path program 1 times
[2025-02-05 18:09:02,714 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:02,715 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294561742]
[2025-02-05 18:09:02,715 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:02,716 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:02,918 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes.
[2025-02-05 18:09:03,018 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements.
[2025-02-05 18:09:03,019 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:03,019 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:03,508 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked.
[2025-02-05 18:09:03,508 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:03,508 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294561742]
[2025-02-05 18:09:03,511 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294561742] provided 0 perfect and 1 imperfect interpolant sequences
[2025-02-05 18:09:03,511 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066260689]
[2025-02-05 18:09:03,511 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:03,512 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2025-02-05 18:09:03,512 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2025-02-05 18:09:03,514 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2025-02-05 18:09:03,515 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2025-02-05 18:09:04,134 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes.
[2025-02-05 18:09:04,586 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements.
[2025-02-05 18:09:04,586 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:04,586 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:04,599 INFO  L256         TraceCheckSpWp]: Trace formula consists of 3274 conjuncts, 1 conjuncts are in the unsatisfiable core
[2025-02-05 18:09:04,641 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2025-02-05 18:09:04,717 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked.
[2025-02-05 18:09:04,717 INFO  L308         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2025-02-05 18:09:04,717 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066260689] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:04,717 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2025-02-05 18:09:04,717 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2
[2025-02-05 18:09:04,721 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558959469]
[2025-02-05 18:09:04,721 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:04,733 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-02-05 18:09:04,733 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:04,753 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-02-05 18:09:04,753 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 18:09:04,759 INFO  L87              Difference]: Start difference. First operand  has 1928 states, 1918 states have (on average 1.497393117831074) internal successors, (2872), 1919 states have internal predecessors, (2872), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand  has 2 states, 2 states have (on average 284.5) internal successors, (569), 2 states have internal predecessors, (569), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7)
[2025-02-05 18:09:05,232 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:05,232 INFO  L93              Difference]: Finished difference Result 3543 states and 5313 transitions.
[2025-02-05 18:09:05,233 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-02-05 18:09:05,234 INFO  L78                 Accepts]: Start accepts. Automaton has  has 2 states, 2 states have (on average 284.5) internal successors, (569), 2 states have internal predecessors, (569), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 599
[2025-02-05 18:09:05,235 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:05,247 INFO  L225             Difference]: With dead ends: 3543
[2025-02-05 18:09:05,247 INFO  L226             Difference]: Without dead ends: 1925
[2025-02-05 18:09:05,253 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 600 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-02-05 18:09:05,255 INFO  L435           NwaCegarLoop]: 2406 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2406 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:05,255 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2406 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2025-02-05 18:09:05,268 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1925 states.
[2025-02-05 18:09:05,319 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925.
[2025-02-05 18:09:05,321 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1925 states, 1916 states have (on average 1.4963465553235908) internal successors, (2867), 1916 states have internal predecessors, (2867), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:05,328 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2881 transitions.
[2025-02-05 18:09:05,330 INFO  L78                 Accepts]: Start accepts. Automaton has 1925 states and 2881 transitions. Word has length 599
[2025-02-05 18:09:05,330 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:05,330 INFO  L471      AbstractCegarLoop]: Abstraction has 1925 states and 2881 transitions.
[2025-02-05 18:09:05,331 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 284.5) internal successors, (569), 2 states have internal predecessors, (569), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7)
[2025-02-05 18:09:05,331 INFO  L276                IsEmpty]: Start isEmpty. Operand 1925 states and 2881 transitions.
[2025-02-05 18:09:05,337 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 600
[2025-02-05 18:09:05,337 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:05,337 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:05,354 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2025-02-05 18:09:05,538 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0
[2025-02-05 18:09:05,538 INFO  L396      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:05,539 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:05,539 INFO  L85        PathProgramCache]: Analyzing trace with hash -221253519, now seen corresponding path program 1 times
[2025-02-05 18:09:05,539 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:05,539 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045550651]
[2025-02-05 18:09:05,540 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:05,540 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:05,631 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 599 statements into 1 equivalence classes.
[2025-02-05 18:09:05,880 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 599 of 599 statements.
[2025-02-05 18:09:05,881 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:05,881 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:08,169 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:08,169 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:08,169 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045550651]
[2025-02-05 18:09:08,170 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045550651] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:08,170 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:08,170 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 18:09:08,170 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663294207]
[2025-02-05 18:09:08,170 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:08,172 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 18:09:08,172 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:08,173 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 18:09:08,173 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 18:09:08,173 INFO  L87              Difference]: Start difference. First operand 1925 states and 2881 transitions. Second operand  has 4 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:08,998 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:08,999 INFO  L93              Difference]: Finished difference Result 1929 states and 2885 transitions.
[2025-02-05 18:09:09,002 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:09,003 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 599
[2025-02-05 18:09:09,004 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:09,011 INFO  L225             Difference]: With dead ends: 1929
[2025-02-05 18:09:09,011 INFO  L226             Difference]: Without dead ends: 1927
[2025-02-05 18:09:09,011 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-05 18:09:09,012 INFO  L435           NwaCegarLoop]: 2404 mSDtfsCounter, 0 mSDsluCounter, 4803 mSDsCounter, 0 mSdLazyCounter, 1435 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7207 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:09,013 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7207 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1435 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 18:09:09,015 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1927 states.
[2025-02-05 18:09:09,038 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1927.
[2025-02-05 18:09:09,042 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1927 states, 1918 states have (on average 1.4958289885297185) internal successors, (2869), 1918 states have internal predecessors, (2869), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:09,048 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 2883 transitions.
[2025-02-05 18:09:09,048 INFO  L78                 Accepts]: Start accepts. Automaton has 1927 states and 2883 transitions. Word has length 599
[2025-02-05 18:09:09,050 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:09,050 INFO  L471      AbstractCegarLoop]: Abstraction has 1927 states and 2883 transitions.
[2025-02-05 18:09:09,050 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:09,051 INFO  L276                IsEmpty]: Start isEmpty. Operand 1927 states and 2883 transitions.
[2025-02-05 18:09:09,058 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 601
[2025-02-05 18:09:09,058 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:09,058 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:09,058 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-02-05 18:09:09,058 INFO  L396      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:09,059 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:09,059 INFO  L85        PathProgramCache]: Analyzing trace with hash 1735756041, now seen corresponding path program 1 times
[2025-02-05 18:09:09,060 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:09,060 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584302491]
[2025-02-05 18:09:09,060 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:09,060 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:09,177 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 600 statements into 1 equivalence classes.
[2025-02-05 18:09:09,432 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 600 of 600 statements.
[2025-02-05 18:09:09,435 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:09,435 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:10,185 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:10,188 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:10,188 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584302491]
[2025-02-05 18:09:10,188 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584302491] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:10,188 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:10,188 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:10,188 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321690412]
[2025-02-05 18:09:10,188 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:10,189 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:10,190 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:10,190 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:10,190 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:10,191 INFO  L87              Difference]: Start difference. First operand 1927 states and 2883 transitions. Second operand  has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:11,981 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:11,981 INFO  L93              Difference]: Finished difference Result 4943 states and 7399 transitions.
[2025-02-05 18:09:11,981 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2025-02-05 18:09:11,982 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 600
[2025-02-05 18:09:11,983 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:11,990 INFO  L225             Difference]: With dead ends: 4943
[2025-02-05 18:09:11,990 INFO  L226             Difference]: Without dead ends: 1927
[2025-02-05 18:09:11,992 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56
[2025-02-05 18:09:11,994 INFO  L435           NwaCegarLoop]: 2434 mSDtfsCounter, 6096 mSDsluCounter, 4416 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6096 SdHoareTripleChecker+Valid, 6850 SdHoareTripleChecker+Invalid, 2286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:11,995 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [6096 Valid, 6850 Invalid, 2286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time]
[2025-02-05 18:09:11,997 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1927 states.
[2025-02-05 18:09:12,023 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1927.
[2025-02-05 18:09:12,026 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1927 states, 1918 states have (on average 1.4953076120959332) internal successors, (2868), 1918 states have internal predecessors, (2868), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:12,033 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 2882 transitions.
[2025-02-05 18:09:12,033 INFO  L78                 Accepts]: Start accepts. Automaton has 1927 states and 2882 transitions. Word has length 600
[2025-02-05 18:09:12,034 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:12,034 INFO  L471      AbstractCegarLoop]: Abstraction has 1927 states and 2882 transitions.
[2025-02-05 18:09:12,034 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:12,034 INFO  L276                IsEmpty]: Start isEmpty. Operand 1927 states and 2882 transitions.
[2025-02-05 18:09:12,044 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 602
[2025-02-05 18:09:12,045 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:12,045 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:12,046 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-02-05 18:09:12,046 INFO  L396      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:12,047 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:12,047 INFO  L85        PathProgramCache]: Analyzing trace with hash -1137787828, now seen corresponding path program 1 times
[2025-02-05 18:09:12,047 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:12,047 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918322102]
[2025-02-05 18:09:12,047 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:12,047 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:12,176 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes.
[2025-02-05 18:09:12,342 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements.
[2025-02-05 18:09:12,343 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:12,343 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:13,054 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:13,054 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:13,054 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918322102]
[2025-02-05 18:09:13,054 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918322102] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:13,054 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:13,055 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:13,055 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803188268]
[2025-02-05 18:09:13,055 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:13,055 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:13,055 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:13,056 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:13,056 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:13,056 INFO  L87              Difference]: Start difference. First operand 1927 states and 2882 transitions. Second operand  has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:14,220 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:14,220 INFO  L93              Difference]: Finished difference Result 3544 states and 5300 transitions.
[2025-02-05 18:09:14,221 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:14,221 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 601
[2025-02-05 18:09:14,222 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:14,226 INFO  L225             Difference]: With dead ends: 3544
[2025-02-05 18:09:14,227 INFO  L226             Difference]: Without dead ends: 1927
[2025-02-05 18:09:14,228 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:09:14,229 INFO  L435           NwaCegarLoop]: 1960 mSDtfsCounter, 2704 mSDsluCounter, 1973 mSDsCounter, 0 mSdLazyCounter, 1844 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2711 SdHoareTripleChecker+Valid, 3933 SdHoareTripleChecker+Invalid, 1845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:14,230 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2711 Valid, 3933 Invalid, 1845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1844 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time]
[2025-02-05 18:09:14,233 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1927 states.
[2025-02-05 18:09:14,251 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1927.
[2025-02-05 18:09:14,253 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1927 states, 1918 states have (on average 1.494786235662148) internal successors, (2867), 1918 states have internal predecessors, (2867), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:14,257 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 2881 transitions.
[2025-02-05 18:09:14,257 INFO  L78                 Accepts]: Start accepts. Automaton has 1927 states and 2881 transitions. Word has length 601
[2025-02-05 18:09:14,258 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:14,258 INFO  L471      AbstractCegarLoop]: Abstraction has 1927 states and 2881 transitions.
[2025-02-05 18:09:14,258 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:14,258 INFO  L276                IsEmpty]: Start isEmpty. Operand 1927 states and 2881 transitions.
[2025-02-05 18:09:14,261 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 603
[2025-02-05 18:09:14,261 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:14,261 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:14,262 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-02-05 18:09:14,262 INFO  L396      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:14,262 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:14,262 INFO  L85        PathProgramCache]: Analyzing trace with hash -2073712076, now seen corresponding path program 1 times
[2025-02-05 18:09:14,262 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:14,262 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596501594]
[2025-02-05 18:09:14,263 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:14,263 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:14,348 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 602 statements into 1 equivalence classes.
[2025-02-05 18:09:14,465 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 602 of 602 statements.
[2025-02-05 18:09:14,466 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:14,466 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:15,192 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:15,192 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:15,192 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596501594]
[2025-02-05 18:09:15,192 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596501594] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:15,192 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:15,192 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 18:09:15,192 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307574103]
[2025-02-05 18:09:15,193 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:15,194 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 18:09:15,194 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:15,195 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 18:09:15,195 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 18:09:15,195 INFO  L87              Difference]: Start difference. First operand 1927 states and 2881 transitions. Second operand  has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:15,886 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:15,886 INFO  L93              Difference]: Finished difference Result 3546 states and 5301 transitions.
[2025-02-05 18:09:15,887 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:15,887 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 602
[2025-02-05 18:09:15,888 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:15,894 INFO  L225             Difference]: With dead ends: 3546
[2025-02-05 18:09:15,894 INFO  L226             Difference]: Without dead ends: 1929
[2025-02-05 18:09:15,896 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-05 18:09:15,897 INFO  L435           NwaCegarLoop]: 2402 mSDtfsCounter, 0 mSDsluCounter, 4796 mSDsCounter, 0 mSdLazyCounter, 1438 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7198 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:15,897 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7198 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1438 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 18:09:15,899 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1929 states.
[2025-02-05 18:09:15,916 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1929.
[2025-02-05 18:09:15,919 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1929 states, 1920 states have (on average 1.4942708333333334) internal successors, (2869), 1920 states have internal predecessors, (2869), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:15,921 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2883 transitions.
[2025-02-05 18:09:15,921 INFO  L78                 Accepts]: Start accepts. Automaton has 1929 states and 2883 transitions. Word has length 602
[2025-02-05 18:09:15,922 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:15,922 INFO  L471      AbstractCegarLoop]: Abstraction has 1929 states and 2883 transitions.
[2025-02-05 18:09:15,922 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:15,923 INFO  L276                IsEmpty]: Start isEmpty. Operand 1929 states and 2883 transitions.
[2025-02-05 18:09:15,927 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 604
[2025-02-05 18:09:15,927 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:15,928 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:15,928 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-02-05 18:09:15,928 INFO  L396      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:15,929 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:15,929 INFO  L85        PathProgramCache]: Analyzing trace with hash 2070945697, now seen corresponding path program 1 times
[2025-02-05 18:09:15,929 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:15,931 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907683126]
[2025-02-05 18:09:15,931 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:15,931 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:16,022 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 603 statements into 1 equivalence classes.
[2025-02-05 18:09:16,136 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 603 of 603 statements.
[2025-02-05 18:09:16,137 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:16,137 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:17,147 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:17,147 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:17,147 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907683126]
[2025-02-05 18:09:17,147 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907683126] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:17,147 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:17,148 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 18:09:17,148 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996829888]
[2025-02-05 18:09:17,148 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:17,148 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 18:09:17,148 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:17,149 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 18:09:17,149 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 18:09:17,149 INFO  L87              Difference]: Start difference. First operand 1929 states and 2883 transitions. Second operand  has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:17,938 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:17,938 INFO  L93              Difference]: Finished difference Result 3548 states and 5302 transitions.
[2025-02-05 18:09:17,939 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:17,939 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 603
[2025-02-05 18:09:17,940 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:17,949 INFO  L225             Difference]: With dead ends: 3548
[2025-02-05 18:09:17,949 INFO  L226             Difference]: Without dead ends: 1929
[2025-02-05 18:09:17,951 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:17,951 INFO  L435           NwaCegarLoop]: 2328 mSDtfsCounter, 2458 mSDsluCounter, 2330 mSDsCounter, 0 mSdLazyCounter, 1106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2458 SdHoareTripleChecker+Valid, 4658 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:17,952 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2458 Valid, 4658 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1106 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 18:09:17,954 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1929 states.
[2025-02-05 18:09:17,976 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1929.
[2025-02-05 18:09:17,978 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1929 states, 1920 states have (on average 1.49375) internal successors, (2868), 1920 states have internal predecessors, (2868), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:17,984 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2882 transitions.
[2025-02-05 18:09:17,985 INFO  L78                 Accepts]: Start accepts. Automaton has 1929 states and 2882 transitions. Word has length 603
[2025-02-05 18:09:17,986 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:17,986 INFO  L471      AbstractCegarLoop]: Abstraction has 1929 states and 2882 transitions.
[2025-02-05 18:09:17,987 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:17,987 INFO  L276                IsEmpty]: Start isEmpty. Operand 1929 states and 2882 transitions.
[2025-02-05 18:09:17,992 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 605
[2025-02-05 18:09:17,993 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:17,993 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:17,993 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2025-02-05 18:09:17,993 INFO  L396      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:17,994 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:17,994 INFO  L85        PathProgramCache]: Analyzing trace with hash 151542645, now seen corresponding path program 1 times
[2025-02-05 18:09:17,994 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:17,994 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929619700]
[2025-02-05 18:09:17,994 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:17,994 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:18,139 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 604 statements into 1 equivalence classes.
[2025-02-05 18:09:18,288 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 604 of 604 statements.
[2025-02-05 18:09:18,288 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:18,288 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:18,884 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:18,885 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:18,885 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929619700]
[2025-02-05 18:09:18,885 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929619700] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:18,885 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:18,885 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:18,885 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319567651]
[2025-02-05 18:09:18,885 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:18,886 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:18,886 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:18,887 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:18,887 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:18,887 INFO  L87              Difference]: Start difference. First operand 1929 states and 2882 transitions. Second operand  has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:19,789 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:19,789 INFO  L93              Difference]: Finished difference Result 3856 states and 5760 transitions.
[2025-02-05 18:09:19,789 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 18:09:19,790 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 604
[2025-02-05 18:09:19,790 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:19,795 INFO  L225             Difference]: With dead ends: 3856
[2025-02-05 18:09:19,795 INFO  L226             Difference]: Without dead ends: 1929
[2025-02-05 18:09:19,796 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-02-05 18:09:19,797 INFO  L435           NwaCegarLoop]: 2390 mSDtfsCounter, 3367 mSDsluCounter, 4726 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3367 SdHoareTripleChecker+Valid, 7116 SdHoareTripleChecker+Invalid, 1530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:19,797 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3367 Valid, 7116 Invalid, 1530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 18:09:19,799 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1929 states.
[2025-02-05 18:09:19,813 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1929.
[2025-02-05 18:09:19,815 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1929 states, 1920 states have (on average 1.4932291666666666) internal successors, (2867), 1920 states have internal predecessors, (2867), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:19,817 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2881 transitions.
[2025-02-05 18:09:19,817 INFO  L78                 Accepts]: Start accepts. Automaton has 1929 states and 2881 transitions. Word has length 604
[2025-02-05 18:09:19,817 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:19,817 INFO  L471      AbstractCegarLoop]: Abstraction has 1929 states and 2881 transitions.
[2025-02-05 18:09:19,817 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:19,818 INFO  L276                IsEmpty]: Start isEmpty. Operand 1929 states and 2881 transitions.
[2025-02-05 18:09:19,821 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 606
[2025-02-05 18:09:19,821 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:19,821 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:19,821 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2025-02-05 18:09:19,821 INFO  L396      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:19,822 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:19,822 INFO  L85        PathProgramCache]: Analyzing trace with hash -174127351, now seen corresponding path program 1 times
[2025-02-05 18:09:19,822 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:19,823 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619493525]
[2025-02-05 18:09:19,823 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:19,823 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:19,929 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 605 statements into 1 equivalence classes.
[2025-02-05 18:09:20,020 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 605 of 605 statements.
[2025-02-05 18:09:20,020 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:20,020 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:20,487 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:20,487 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:20,487 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619493525]
[2025-02-05 18:09:20,487 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619493525] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:20,487 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:20,487 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:20,488 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516518453]
[2025-02-05 18:09:20,488 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:20,488 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:20,488 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:20,489 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:20,489 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:20,489 INFO  L87              Difference]: Start difference. First operand 1929 states and 2881 transitions. Second operand  has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:21,230 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:21,230 INFO  L93              Difference]: Finished difference Result 3548 states and 5298 transitions.
[2025-02-05 18:09:21,233 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:21,234 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 605
[2025-02-05 18:09:21,234 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:21,239 INFO  L225             Difference]: With dead ends: 3548
[2025-02-05 18:09:21,239 INFO  L226             Difference]: Without dead ends: 1929
[2025-02-05 18:09:21,240 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:09:21,241 INFO  L435           NwaCegarLoop]: 2328 mSDtfsCounter, 2857 mSDsluCounter, 2341 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2864 SdHoareTripleChecker+Valid, 4669 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:21,241 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2864 Valid, 4669 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 18:09:21,243 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1929 states.
[2025-02-05 18:09:21,256 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1929.
[2025-02-05 18:09:21,262 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1929 states, 1920 states have (on average 1.4927083333333333) internal successors, (2866), 1920 states have internal predecessors, (2866), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:21,265 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2880 transitions.
[2025-02-05 18:09:21,265 INFO  L78                 Accepts]: Start accepts. Automaton has 1929 states and 2880 transitions. Word has length 605
[2025-02-05 18:09:21,266 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:21,266 INFO  L471      AbstractCegarLoop]: Abstraction has 1929 states and 2880 transitions.
[2025-02-05 18:09:21,266 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 114.6) internal successors, (573), 5 states have internal predecessors, (573), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:21,267 INFO  L276                IsEmpty]: Start isEmpty. Operand 1929 states and 2880 transitions.
[2025-02-05 18:09:21,271 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 607
[2025-02-05 18:09:21,271 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:21,271 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:21,271 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2025-02-05 18:09:21,272 INFO  L396      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:21,272 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:21,272 INFO  L85        PathProgramCache]: Analyzing trace with hash -346115056, now seen corresponding path program 1 times
[2025-02-05 18:09:21,272 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:21,272 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594386366]
[2025-02-05 18:09:21,273 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:21,273 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:21,387 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 606 statements into 1 equivalence classes.
[2025-02-05 18:09:21,479 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 606 of 606 statements.
[2025-02-05 18:09:21,479 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:21,479 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:21,921 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:21,922 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:21,922 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594386366]
[2025-02-05 18:09:21,922 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594386366] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:21,922 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:21,922 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:21,922 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41238240]
[2025-02-05 18:09:21,922 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:21,923 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:21,923 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:21,924 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:21,924 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:21,924 INFO  L87              Difference]: Start difference. First operand 1929 states and 2880 transitions. Second operand  has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:22,633 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:22,633 INFO  L93              Difference]: Finished difference Result 3548 states and 5296 transitions.
[2025-02-05 18:09:22,633 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:22,634 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 606
[2025-02-05 18:09:22,634 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:22,639 INFO  L225             Difference]: With dead ends: 3548
[2025-02-05 18:09:22,639 INFO  L226             Difference]: Without dead ends: 1929
[2025-02-05 18:09:22,640 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:09:22,641 INFO  L435           NwaCegarLoop]: 2328 mSDtfsCounter, 5461 mSDsluCounter, 2330 mSDsCounter, 0 mSdLazyCounter, 1100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5468 SdHoareTripleChecker+Valid, 4658 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:22,641 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5468 Valid, 4658 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1100 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 18:09:22,643 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1929 states.
[2025-02-05 18:09:22,655 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1929.
[2025-02-05 18:09:22,657 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1929 states, 1920 states have (on average 1.4921875) internal successors, (2865), 1920 states have internal predecessors, (2865), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:22,658 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2879 transitions.
[2025-02-05 18:09:22,658 INFO  L78                 Accepts]: Start accepts. Automaton has 1929 states and 2879 transitions. Word has length 606
[2025-02-05 18:09:22,659 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:22,659 INFO  L471      AbstractCegarLoop]: Abstraction has 1929 states and 2879 transitions.
[2025-02-05 18:09:22,659 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:22,659 INFO  L276                IsEmpty]: Start isEmpty. Operand 1929 states and 2879 transitions.
[2025-02-05 18:09:22,662 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 608
[2025-02-05 18:09:22,662 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:22,662 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:22,663 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2025-02-05 18:09:22,663 INFO  L396      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:22,663 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:22,663 INFO  L85        PathProgramCache]: Analyzing trace with hash 549345476, now seen corresponding path program 1 times
[2025-02-05 18:09:22,663 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:22,663 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186479037]
[2025-02-05 18:09:22,663 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:22,664 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:22,742 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes.
[2025-02-05 18:09:22,829 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements.
[2025-02-05 18:09:22,829 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:22,829 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:23,371 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:23,372 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:23,372 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186479037]
[2025-02-05 18:09:23,372 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186479037] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:23,372 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:23,372 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:23,372 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490850664]
[2025-02-05 18:09:23,372 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:23,373 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:23,373 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:23,374 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:23,374 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:23,374 INFO  L87              Difference]: Start difference. First operand 1929 states and 2879 transitions. Second operand  has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:24,146 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:24,147 INFO  L93              Difference]: Finished difference Result 3548 states and 5294 transitions.
[2025-02-05 18:09:24,147 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:24,147 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 607
[2025-02-05 18:09:24,148 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:24,152 INFO  L225             Difference]: With dead ends: 3548
[2025-02-05 18:09:24,152 INFO  L226             Difference]: Without dead ends: 1929
[2025-02-05 18:09:24,153 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:09:24,154 INFO  L435           NwaCegarLoop]: 2328 mSDtfsCounter, 2849 mSDsluCounter, 2341 mSDsCounter, 0 mSdLazyCounter, 1098 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2856 SdHoareTripleChecker+Valid, 4669 SdHoareTripleChecker+Invalid, 1099 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:24,154 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2856 Valid, 4669 Invalid, 1099 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1098 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 18:09:24,156 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1929 states.
[2025-02-05 18:09:24,174 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1929.
[2025-02-05 18:09:24,176 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1929 states, 1920 states have (on average 1.4916666666666667) internal successors, (2864), 1920 states have internal predecessors, (2864), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:24,178 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2878 transitions.
[2025-02-05 18:09:24,179 INFO  L78                 Accepts]: Start accepts. Automaton has 1929 states and 2878 transitions. Word has length 607
[2025-02-05 18:09:24,179 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:24,179 INFO  L471      AbstractCegarLoop]: Abstraction has 1929 states and 2878 transitions.
[2025-02-05 18:09:24,179 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:24,180 INFO  L276                IsEmpty]: Start isEmpty. Operand 1929 states and 2878 transitions.
[2025-02-05 18:09:24,185 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 609
[2025-02-05 18:09:24,185 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:24,185 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:24,185 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2025-02-05 18:09:24,185 INFO  L396      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:24,186 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:24,186 INFO  L85        PathProgramCache]: Analyzing trace with hash -212240853, now seen corresponding path program 1 times
[2025-02-05 18:09:24,186 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:24,186 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423145554]
[2025-02-05 18:09:24,186 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:24,186 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:24,290 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 608 statements into 1 equivalence classes.
[2025-02-05 18:09:24,390 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 608 of 608 statements.
[2025-02-05 18:09:24,390 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:24,390 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:24,878 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:24,879 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:24,879 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423145554]
[2025-02-05 18:09:24,879 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423145554] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:24,879 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:24,879 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:24,879 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316375037]
[2025-02-05 18:09:24,879 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:24,880 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:24,880 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:24,880 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:24,880 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:24,881 INFO  L87              Difference]: Start difference. First operand 1929 states and 2878 transitions. Second operand  has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:25,571 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:25,572 INFO  L93              Difference]: Finished difference Result 3548 states and 5292 transitions.
[2025-02-05 18:09:25,572 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:25,572 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 608
[2025-02-05 18:09:25,573 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:25,577 INFO  L225             Difference]: With dead ends: 3548
[2025-02-05 18:09:25,577 INFO  L226             Difference]: Without dead ends: 1929
[2025-02-05 18:09:25,578 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:09:25,579 INFO  L435           NwaCegarLoop]: 2328 mSDtfsCounter, 5143 mSDsluCounter, 2330 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5150 SdHoareTripleChecker+Valid, 4658 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:25,580 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5150 Valid, 4658 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 18:09:25,581 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1929 states.
[2025-02-05 18:09:25,593 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1929.
[2025-02-05 18:09:25,594 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1929 states, 1920 states have (on average 1.4911458333333334) internal successors, (2863), 1920 states have internal predecessors, (2863), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:25,596 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2877 transitions.
[2025-02-05 18:09:25,596 INFO  L78                 Accepts]: Start accepts. Automaton has 1929 states and 2877 transitions. Word has length 608
[2025-02-05 18:09:25,596 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:25,596 INFO  L471      AbstractCegarLoop]: Abstraction has 1929 states and 2877 transitions.
[2025-02-05 18:09:25,596 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:25,597 INFO  L276                IsEmpty]: Start isEmpty. Operand 1929 states and 2877 transitions.
[2025-02-05 18:09:25,599 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 610
[2025-02-05 18:09:25,599 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:25,600 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:25,600 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2025-02-05 18:09:25,600 INFO  L396      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:25,600 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:25,600 INFO  L85        PathProgramCache]: Analyzing trace with hash 624317670, now seen corresponding path program 1 times
[2025-02-05 18:09:25,600 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:25,601 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210370705]
[2025-02-05 18:09:25,601 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:25,601 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:25,708 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 609 statements into 1 equivalence classes.
[2025-02-05 18:09:25,794 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 609 of 609 statements.
[2025-02-05 18:09:25,794 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:25,794 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:26,235 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:26,235 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:26,235 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210370705]
[2025-02-05 18:09:26,235 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210370705] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:26,235 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:26,235 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:26,235 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954342138]
[2025-02-05 18:09:26,235 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:26,236 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:26,236 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:26,236 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:26,236 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:26,237 INFO  L87              Difference]: Start difference. First operand 1929 states and 2877 transitions. Second operand  has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:26,937 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:26,937 INFO  L93              Difference]: Finished difference Result 3548 states and 5290 transitions.
[2025-02-05 18:09:26,938 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:26,938 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 609
[2025-02-05 18:09:26,938 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:26,967 INFO  L225             Difference]: With dead ends: 3548
[2025-02-05 18:09:26,968 INFO  L226             Difference]: Without dead ends: 1929
[2025-02-05 18:09:26,969 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:09:26,969 INFO  L435           NwaCegarLoop]: 2328 mSDtfsCounter, 2687 mSDsluCounter, 2341 mSDsCounter, 0 mSdLazyCounter, 1094 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2694 SdHoareTripleChecker+Valid, 4669 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:26,969 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2694 Valid, 4669 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1094 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 18:09:26,971 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1929 states.
[2025-02-05 18:09:26,982 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1929.
[2025-02-05 18:09:26,984 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1929 states, 1920 states have (on average 1.490625) internal successors, (2862), 1920 states have internal predecessors, (2862), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:26,986 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2876 transitions.
[2025-02-05 18:09:26,986 INFO  L78                 Accepts]: Start accepts. Automaton has 1929 states and 2876 transitions. Word has length 609
[2025-02-05 18:09:26,987 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:26,987 INFO  L471      AbstractCegarLoop]: Abstraction has 1929 states and 2876 transitions.
[2025-02-05 18:09:26,987 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 115.4) internal successors, (577), 5 states have internal predecessors, (577), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:26,987 INFO  L276                IsEmpty]: Start isEmpty. Operand 1929 states and 2876 transitions.
[2025-02-05 18:09:26,990 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 611
[2025-02-05 18:09:26,990 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:26,991 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:26,991 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2025-02-05 18:09:26,991 INFO  L396      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:26,991 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:26,991 INFO  L85        PathProgramCache]: Analyzing trace with hash -360883285, now seen corresponding path program 1 times
[2025-02-05 18:09:26,991 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:26,991 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615602504]
[2025-02-05 18:09:26,992 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:26,992 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:27,076 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 610 statements into 1 equivalence classes.
[2025-02-05 18:09:27,163 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 610 of 610 statements.
[2025-02-05 18:09:27,164 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:27,164 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:27,610 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:27,610 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:27,610 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615602504]
[2025-02-05 18:09:27,610 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615602504] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:27,610 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:27,611 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:27,611 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500484415]
[2025-02-05 18:09:27,611 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:27,611 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:27,611 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:27,612 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:27,612 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:27,613 INFO  L87              Difference]: Start difference. First operand 1929 states and 2876 transitions. Second operand  has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:28,321 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:28,322 INFO  L93              Difference]: Finished difference Result 3548 states and 5288 transitions.
[2025-02-05 18:09:28,322 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:28,322 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 610
[2025-02-05 18:09:28,323 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:28,331 INFO  L225             Difference]: With dead ends: 3548
[2025-02-05 18:09:28,331 INFO  L226             Difference]: Without dead ends: 1929
[2025-02-05 18:09:28,333 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:09:28,333 INFO  L435           NwaCegarLoop]: 2328 mSDtfsCounter, 2683 mSDsluCounter, 2341 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2690 SdHoareTripleChecker+Valid, 4669 SdHoareTripleChecker+Invalid, 1093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:28,333 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2690 Valid, 4669 Invalid, 1093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 18:09:28,335 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1929 states.
[2025-02-05 18:09:28,350 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1929.
[2025-02-05 18:09:28,352 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1929 states, 1920 states have (on average 1.4901041666666666) internal successors, (2861), 1920 states have internal predecessors, (2861), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:28,354 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2875 transitions.
[2025-02-05 18:09:28,354 INFO  L78                 Accepts]: Start accepts. Automaton has 1929 states and 2875 transitions. Word has length 610
[2025-02-05 18:09:28,355 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:28,355 INFO  L471      AbstractCegarLoop]: Abstraction has 1929 states and 2875 transitions.
[2025-02-05 18:09:28,355 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:28,355 INFO  L276                IsEmpty]: Start isEmpty. Operand 1929 states and 2875 transitions.
[2025-02-05 18:09:28,359 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 612
[2025-02-05 18:09:28,359 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:28,359 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:28,359 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2025-02-05 18:09:28,360 INFO  L396      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:28,360 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:28,360 INFO  L85        PathProgramCache]: Analyzing trace with hash -697354975, now seen corresponding path program 1 times
[2025-02-05 18:09:28,360 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:28,361 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237768767]
[2025-02-05 18:09:28,361 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:28,361 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:28,446 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 611 statements into 1 equivalence classes.
[2025-02-05 18:09:28,576 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 611 of 611 statements.
[2025-02-05 18:09:28,577 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:28,577 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:29,298 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:29,298 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:29,298 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237768767]
[2025-02-05 18:09:29,298 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237768767] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:29,299 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:29,299 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 18:09:29,299 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593125831]
[2025-02-05 18:09:29,299 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:29,300 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 18:09:29,300 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:29,301 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 18:09:29,301 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 18:09:29,301 INFO  L87              Difference]: Start difference. First operand 1929 states and 2875 transitions. Second operand  has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:29,823 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:29,824 INFO  L93              Difference]: Finished difference Result 3547 states and 5285 transitions.
[2025-02-05 18:09:29,824 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:29,824 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 611
[2025-02-05 18:09:29,825 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:29,830 INFO  L225             Difference]: With dead ends: 3547
[2025-02-05 18:09:29,830 INFO  L226             Difference]: Without dead ends: 1928
[2025-02-05 18:09:29,834 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:29,834 INFO  L435           NwaCegarLoop]: 2352 mSDtfsCounter, 2447 mSDsluCounter, 2354 mSDsCounter, 0 mSdLazyCounter, 1039 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2447 SdHoareTripleChecker+Valid, 4706 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1039 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:29,834 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2447 Valid, 4706 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1039 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 18:09:29,836 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1928 states.
[2025-02-05 18:09:29,847 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928.
[2025-02-05 18:09:29,849 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1928 states, 1919 states have (on average 1.4893173527879104) internal successors, (2858), 1919 states have internal predecessors, (2858), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:29,850 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2872 transitions.
[2025-02-05 18:09:29,850 INFO  L78                 Accepts]: Start accepts. Automaton has 1928 states and 2872 transitions. Word has length 611
[2025-02-05 18:09:29,851 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:29,851 INFO  L471      AbstractCegarLoop]: Abstraction has 1928 states and 2872 transitions.
[2025-02-05 18:09:29,851 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:29,851 INFO  L276                IsEmpty]: Start isEmpty. Operand 1928 states and 2872 transitions.
[2025-02-05 18:09:29,853 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 613
[2025-02-05 18:09:29,854 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:29,854 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:29,854 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2025-02-05 18:09:29,854 INFO  L396      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:29,854 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:29,855 INFO  L85        PathProgramCache]: Analyzing trace with hash -1969285461, now seen corresponding path program 1 times
[2025-02-05 18:09:29,855 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:29,855 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648897745]
[2025-02-05 18:09:29,855 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:29,855 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:29,981 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 612 statements into 1 equivalence classes.
[2025-02-05 18:09:30,071 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 612 of 612 statements.
[2025-02-05 18:09:30,071 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:30,071 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:30,545 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:30,545 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:30,545 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648897745]
[2025-02-05 18:09:30,545 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648897745] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:30,545 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:30,545 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:30,546 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796943564]
[2025-02-05 18:09:30,546 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:30,546 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:30,548 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:30,548 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:30,548 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:30,549 INFO  L87              Difference]: Start difference. First operand 1928 states and 2872 transitions. Second operand  has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:31,616 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:31,616 INFO  L93              Difference]: Finished difference Result 3858 states and 5742 transitions.
[2025-02-05 18:09:31,616 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 18:09:31,616 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 612
[2025-02-05 18:09:31,617 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:31,620 INFO  L225             Difference]: With dead ends: 3858
[2025-02-05 18:09:31,620 INFO  L226             Difference]: Without dead ends: 1928
[2025-02-05 18:09:31,622 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-02-05 18:09:31,623 INFO  L435           NwaCegarLoop]: 2383 mSDtfsCounter, 3365 mSDsluCounter, 4743 mSDsCounter, 0 mSdLazyCounter, 1485 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3365 SdHoareTripleChecker+Valid, 7126 SdHoareTripleChecker+Invalid, 1488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:31,623 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3365 Valid, 7126 Invalid, 1488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1485 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time]
[2025-02-05 18:09:31,625 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1928 states.
[2025-02-05 18:09:31,636 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928.
[2025-02-05 18:09:31,637 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1928 states, 1919 states have (on average 1.4887962480458572) internal successors, (2857), 1919 states have internal predecessors, (2857), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:31,638 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2871 transitions.
[2025-02-05 18:09:31,639 INFO  L78                 Accepts]: Start accepts. Automaton has 1928 states and 2871 transitions. Word has length 612
[2025-02-05 18:09:31,639 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:31,639 INFO  L471      AbstractCegarLoop]: Abstraction has 1928 states and 2871 transitions.
[2025-02-05 18:09:31,639 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:31,639 INFO  L276                IsEmpty]: Start isEmpty. Operand 1928 states and 2871 transitions.
[2025-02-05 18:09:31,642 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 614
[2025-02-05 18:09:31,642 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:31,642 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:31,642 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2025-02-05 18:09:31,642 INFO  L396      AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:31,643 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:31,643 INFO  L85        PathProgramCache]: Analyzing trace with hash -477554615, now seen corresponding path program 1 times
[2025-02-05 18:09:31,643 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:31,643 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689844864]
[2025-02-05 18:09:31,644 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:31,644 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:31,730 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 613 statements into 1 equivalence classes.
[2025-02-05 18:09:31,855 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 613 of 613 statements.
[2025-02-05 18:09:31,855 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:31,855 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:32,265 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:32,265 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:32,265 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689844864]
[2025-02-05 18:09:32,265 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689844864] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:32,265 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:32,265 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:32,265 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063892895]
[2025-02-05 18:09:32,266 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:32,266 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:32,266 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:32,267 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:32,267 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:32,267 INFO  L87              Difference]: Start difference. First operand 1928 states and 2871 transitions. Second operand  has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:32,898 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:32,898 INFO  L93              Difference]: Finished difference Result 3546 states and 5278 transitions.
[2025-02-05 18:09:32,898 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:32,898 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 613
[2025-02-05 18:09:32,899 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:32,901 INFO  L225             Difference]: With dead ends: 3546
[2025-02-05 18:09:32,902 INFO  L226             Difference]: Without dead ends: 1928
[2025-02-05 18:09:32,903 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:09:32,904 INFO  L435           NwaCegarLoop]: 2352 mSDtfsCounter, 5453 mSDsluCounter, 2354 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5460 SdHoareTripleChecker+Valid, 4706 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:32,904 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5460 Valid, 4706 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 18:09:32,905 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1928 states.
[2025-02-05 18:09:32,917 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928.
[2025-02-05 18:09:32,918 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1928 states, 1919 states have (on average 1.4882751433038042) internal successors, (2856), 1919 states have internal predecessors, (2856), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:32,920 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2870 transitions.
[2025-02-05 18:09:32,920 INFO  L78                 Accepts]: Start accepts. Automaton has 1928 states and 2870 transitions. Word has length 613
[2025-02-05 18:09:32,920 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:32,920 INFO  L471      AbstractCegarLoop]: Abstraction has 1928 states and 2870 transitions.
[2025-02-05 18:09:32,921 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 116.2) internal successors, (581), 5 states have internal predecessors, (581), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:32,921 INFO  L276                IsEmpty]: Start isEmpty. Operand 1928 states and 2870 transitions.
[2025-02-05 18:09:32,923 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 615
[2025-02-05 18:09:32,923 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:32,923 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:32,924 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2025-02-05 18:09:32,924 INFO  L396      AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:32,924 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:32,924 INFO  L85        PathProgramCache]: Analyzing trace with hash -1761026042, now seen corresponding path program 1 times
[2025-02-05 18:09:32,924 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:32,924 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736981092]
[2025-02-05 18:09:32,924 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:32,925 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:33,019 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 614 statements into 1 equivalence classes.
[2025-02-05 18:09:33,112 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 614 of 614 statements.
[2025-02-05 18:09:33,112 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:33,112 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:33,816 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:33,817 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:33,817 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736981092]
[2025-02-05 18:09:33,817 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736981092] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:33,817 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:33,817 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:33,817 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688982707]
[2025-02-05 18:09:33,817 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:33,817 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:33,818 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:33,818 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:33,818 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:33,818 INFO  L87              Difference]: Start difference. First operand 1928 states and 2870 transitions. Second operand  has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:34,391 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:34,392 INFO  L93              Difference]: Finished difference Result 3546 states and 5276 transitions.
[2025-02-05 18:09:34,395 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:34,396 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 614
[2025-02-05 18:09:34,396 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:34,398 INFO  L225             Difference]: With dead ends: 3546
[2025-02-05 18:09:34,398 INFO  L226             Difference]: Without dead ends: 1928
[2025-02-05 18:09:34,400 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:09:34,400 INFO  L435           NwaCegarLoop]: 2352 mSDtfsCounter, 2684 mSDsluCounter, 2365 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2691 SdHoareTripleChecker+Valid, 4717 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:34,401 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2691 Valid, 4717 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2025-02-05 18:09:34,402 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1928 states.
[2025-02-05 18:09:34,418 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928.
[2025-02-05 18:09:34,419 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1928 states, 1919 states have (on average 1.487754038561751) internal successors, (2855), 1919 states have internal predecessors, (2855), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:34,420 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2869 transitions.
[2025-02-05 18:09:34,421 INFO  L78                 Accepts]: Start accepts. Automaton has 1928 states and 2869 transitions. Word has length 614
[2025-02-05 18:09:34,421 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:34,421 INFO  L471      AbstractCegarLoop]: Abstraction has 1928 states and 2869 transitions.
[2025-02-05 18:09:34,421 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:34,421 INFO  L276                IsEmpty]: Start isEmpty. Operand 1928 states and 2869 transitions.
[2025-02-05 18:09:34,424 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 616
[2025-02-05 18:09:34,424 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:34,424 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:34,424 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2025-02-05 18:09:34,424 INFO  L396      AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:34,425 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:34,425 INFO  L85        PathProgramCache]: Analyzing trace with hash -993633247, now seen corresponding path program 1 times
[2025-02-05 18:09:34,425 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:34,425 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343682829]
[2025-02-05 18:09:34,425 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:34,425 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:34,504 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 615 statements into 1 equivalence classes.
[2025-02-05 18:09:34,610 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 615 of 615 statements.
[2025-02-05 18:09:34,610 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:34,610 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:35,258 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:35,258 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:35,258 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343682829]
[2025-02-05 18:09:35,259 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343682829] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:35,259 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:35,259 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 18:09:35,259 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328014388]
[2025-02-05 18:09:35,259 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:35,260 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 18:09:35,260 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:35,260 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 18:09:35,260 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 18:09:35,261 INFO  L87              Difference]: Start difference. First operand 1928 states and 2869 transitions. Second operand  has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:35,927 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:35,929 INFO  L93              Difference]: Finished difference Result 3546 states and 5274 transitions.
[2025-02-05 18:09:35,929 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:35,929 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 615
[2025-02-05 18:09:35,930 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:35,932 INFO  L225             Difference]: With dead ends: 3546
[2025-02-05 18:09:35,933 INFO  L226             Difference]: Without dead ends: 1928
[2025-02-05 18:09:35,934 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:35,934 INFO  L435           NwaCegarLoop]: 2251 mSDtfsCounter, 2420 mSDsluCounter, 2253 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2420 SdHoareTripleChecker+Valid, 4504 SdHoareTripleChecker+Invalid, 1232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:35,935 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2420 Valid, 4504 Invalid, 1232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 18:09:35,937 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1928 states.
[2025-02-05 18:09:35,949 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928.
[2025-02-05 18:09:35,950 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1928 states, 1919 states have (on average 1.4872329338196977) internal successors, (2854), 1919 states have internal predecessors, (2854), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:35,952 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2868 transitions.
[2025-02-05 18:09:35,952 INFO  L78                 Accepts]: Start accepts. Automaton has 1928 states and 2868 transitions. Word has length 615
[2025-02-05 18:09:35,953 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:35,953 INFO  L471      AbstractCegarLoop]: Abstraction has 1928 states and 2868 transitions.
[2025-02-05 18:09:35,953 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:35,954 INFO  L276                IsEmpty]: Start isEmpty. Operand 1928 states and 2868 transitions.
[2025-02-05 18:09:35,956 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 617
[2025-02-05 18:09:35,957 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:35,957 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:35,957 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2025-02-05 18:09:35,957 INFO  L396      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:35,958 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:35,958 INFO  L85        PathProgramCache]: Analyzing trace with hash 1419177303, now seen corresponding path program 1 times
[2025-02-05 18:09:35,958 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:35,958 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649287935]
[2025-02-05 18:09:35,958 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:35,958 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:36,062 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 616 statements into 1 equivalence classes.
[2025-02-05 18:09:36,155 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 616 of 616 statements.
[2025-02-05 18:09:36,155 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:36,155 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:36,566 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:36,566 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:36,567 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649287935]
[2025-02-05 18:09:36,567 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649287935] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:36,567 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:36,567 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:36,567 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728483935]
[2025-02-05 18:09:36,567 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:36,567 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:36,568 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:36,568 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:36,568 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:36,569 INFO  L87              Difference]: Start difference. First operand 1928 states and 2868 transitions. Second operand  has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:37,493 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:37,493 INFO  L93              Difference]: Finished difference Result 3849 states and 5718 transitions.
[2025-02-05 18:09:37,494 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 18:09:37,494 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 616
[2025-02-05 18:09:37,495 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:37,502 INFO  L225             Difference]: With dead ends: 3849
[2025-02-05 18:09:37,502 INFO  L226             Difference]: Without dead ends: 1928
[2025-02-05 18:09:37,503 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2025-02-05 18:09:37,503 INFO  L435           NwaCegarLoop]: 2371 mSDtfsCounter, 3289 mSDsluCounter, 4630 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3289 SdHoareTripleChecker+Valid, 7001 SdHoareTripleChecker+Invalid, 1609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:37,504 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [3289 Valid, 7001 Invalid, 1609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1598 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 18:09:37,505 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1928 states.
[2025-02-05 18:09:37,518 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928.
[2025-02-05 18:09:37,520 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1928 states, 1919 states have (on average 1.4867118290776447) internal successors, (2853), 1919 states have internal predecessors, (2853), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:37,521 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2867 transitions.
[2025-02-05 18:09:37,521 INFO  L78                 Accepts]: Start accepts. Automaton has 1928 states and 2867 transitions. Word has length 616
[2025-02-05 18:09:37,522 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:37,522 INFO  L471      AbstractCegarLoop]: Abstraction has 1928 states and 2867 transitions.
[2025-02-05 18:09:37,522 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:37,522 INFO  L276                IsEmpty]: Start isEmpty. Operand 1928 states and 2867 transitions.
[2025-02-05 18:09:37,525 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 618
[2025-02-05 18:09:37,525 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:37,525 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:37,525 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2025-02-05 18:09:37,525 INFO  L396      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:37,525 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:37,526 INFO  L85        PathProgramCache]: Analyzing trace with hash -64144811, now seen corresponding path program 1 times
[2025-02-05 18:09:37,526 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:37,526 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954330994]
[2025-02-05 18:09:37,526 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:37,526 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:37,610 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 617 statements into 1 equivalence classes.
[2025-02-05 18:09:37,703 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 617 of 617 statements.
[2025-02-05 18:09:37,704 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:37,704 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:38,064 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:38,064 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:38,064 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954330994]
[2025-02-05 18:09:38,064 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954330994] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:38,064 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:38,064 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:38,064 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179038773]
[2025-02-05 18:09:38,064 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:38,065 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:38,065 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:38,065 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:38,065 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:38,066 INFO  L87              Difference]: Start difference. First operand 1928 states and 2867 transitions. Second operand  has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:38,828 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:38,828 INFO  L93              Difference]: Finished difference Result 3546 states and 5270 transitions.
[2025-02-05 18:09:38,828 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:38,828 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 617
[2025-02-05 18:09:38,829 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:38,831 INFO  L225             Difference]: With dead ends: 3546
[2025-02-05 18:09:38,831 INFO  L226             Difference]: Without dead ends: 1928
[2025-02-05 18:09:38,833 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:09:38,833 INFO  L435           NwaCegarLoop]: 2251 mSDtfsCounter, 5427 mSDsluCounter, 2253 mSDsCounter, 0 mSdLazyCounter, 1228 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5434 SdHoareTripleChecker+Valid, 4504 SdHoareTripleChecker+Invalid, 1229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:38,833 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5434 Valid, 4504 Invalid, 1229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1228 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 18:09:38,834 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1928 states.
[2025-02-05 18:09:38,845 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928.
[2025-02-05 18:09:38,846 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1928 states, 1919 states have (on average 1.4861907243355914) internal successors, (2852), 1919 states have internal predecessors, (2852), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:38,847 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2866 transitions.
[2025-02-05 18:09:38,847 INFO  L78                 Accepts]: Start accepts. Automaton has 1928 states and 2866 transitions. Word has length 617
[2025-02-05 18:09:38,848 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:38,848 INFO  L471      AbstractCegarLoop]: Abstraction has 1928 states and 2866 transitions.
[2025-02-05 18:09:38,848 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 117.0) internal successors, (585), 5 states have internal predecessors, (585), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:38,848 INFO  L276                IsEmpty]: Start isEmpty. Operand 1928 states and 2866 transitions.
[2025-02-05 18:09:38,850 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 619
[2025-02-05 18:09:38,851 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:38,851 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:38,851 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2025-02-05 18:09:38,851 INFO  L396      AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:38,851 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:38,852 INFO  L85        PathProgramCache]: Analyzing trace with hash -1165345294, now seen corresponding path program 1 times
[2025-02-05 18:09:38,852 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:38,852 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022881298]
[2025-02-05 18:09:38,852 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:38,852 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:38,931 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 618 statements into 1 equivalence classes.
[2025-02-05 18:09:39,027 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 618 of 618 statements.
[2025-02-05 18:09:39,027 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:39,028 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:39,427 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:39,427 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:39,427 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022881298]
[2025-02-05 18:09:39,427 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022881298] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:39,427 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:39,427 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:39,427 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663782254]
[2025-02-05 18:09:39,428 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:39,428 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:39,428 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:39,429 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:39,429 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:39,429 INFO  L87              Difference]: Start difference. First operand 1928 states and 2866 transitions. Second operand  has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:40,202 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:40,202 INFO  L93              Difference]: Finished difference Result 3546 states and 5268 transitions.
[2025-02-05 18:09:40,203 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:40,203 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 618
[2025-02-05 18:09:40,203 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:40,206 INFO  L225             Difference]: With dead ends: 3546
[2025-02-05 18:09:40,206 INFO  L226             Difference]: Without dead ends: 1928
[2025-02-05 18:09:40,208 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:09:40,208 INFO  L435           NwaCegarLoop]: 2251 mSDtfsCounter, 5419 mSDsluCounter, 2253 mSDsCounter, 0 mSdLazyCounter, 1226 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5426 SdHoareTripleChecker+Valid, 4504 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:40,208 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5426 Valid, 4504 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1226 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 18:09:40,210 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1928 states.
[2025-02-05 18:09:40,221 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928.
[2025-02-05 18:09:40,223 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1928 states, 1919 states have (on average 1.4856696195935384) internal successors, (2851), 1919 states have internal predecessors, (2851), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:40,224 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2865 transitions.
[2025-02-05 18:09:40,225 INFO  L78                 Accepts]: Start accepts. Automaton has 1928 states and 2865 transitions. Word has length 618
[2025-02-05 18:09:40,225 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:40,225 INFO  L471      AbstractCegarLoop]: Abstraction has 1928 states and 2865 transitions.
[2025-02-05 18:09:40,225 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:40,225 INFO  L276                IsEmpty]: Start isEmpty. Operand 1928 states and 2865 transitions.
[2025-02-05 18:09:40,228 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 620
[2025-02-05 18:09:40,228 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:40,228 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:40,228 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2025-02-05 18:09:40,229 INFO  L396      AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:40,229 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:40,229 INFO  L85        PathProgramCache]: Analyzing trace with hash 601086352, now seen corresponding path program 1 times
[2025-02-05 18:09:40,229 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:40,229 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825626944]
[2025-02-05 18:09:40,229 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:40,229 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:40,312 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 619 statements into 1 equivalence classes.
[2025-02-05 18:09:40,410 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 619 of 619 statements.
[2025-02-05 18:09:40,411 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:40,411 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:40,796 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:40,796 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:40,796 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825626944]
[2025-02-05 18:09:40,796 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825626944] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:40,796 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:40,796 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:40,796 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056690413]
[2025-02-05 18:09:40,796 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:40,797 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:40,797 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:40,797 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:40,798 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:40,798 INFO  L87              Difference]: Start difference. First operand 1928 states and 2865 transitions. Second operand  has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:41,513 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:41,513 INFO  L93              Difference]: Finished difference Result 3546 states and 5266 transitions.
[2025-02-05 18:09:41,514 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:41,514 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 619
[2025-02-05 18:09:41,516 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:41,519 INFO  L225             Difference]: With dead ends: 3546
[2025-02-05 18:09:41,519 INFO  L226             Difference]: Without dead ends: 1928
[2025-02-05 18:09:41,520 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:09:41,521 INFO  L435           NwaCegarLoop]: 2251 mSDtfsCounter, 2835 mSDsluCounter, 2264 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2842 SdHoareTripleChecker+Valid, 4515 SdHoareTripleChecker+Invalid, 1225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:41,522 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2842 Valid, 4515 Invalid, 1225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 18:09:41,523 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1928 states.
[2025-02-05 18:09:41,602 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928.
[2025-02-05 18:09:41,603 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1928 states, 1919 states have (on average 1.4851485148514851) internal successors, (2850), 1919 states have internal predecessors, (2850), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:41,605 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2864 transitions.
[2025-02-05 18:09:41,605 INFO  L78                 Accepts]: Start accepts. Automaton has 1928 states and 2864 transitions. Word has length 619
[2025-02-05 18:09:41,605 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:41,605 INFO  L471      AbstractCegarLoop]: Abstraction has 1928 states and 2864 transitions.
[2025-02-05 18:09:41,605 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:41,606 INFO  L276                IsEmpty]: Start isEmpty. Operand 1928 states and 2864 transitions.
[2025-02-05 18:09:41,608 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 621
[2025-02-05 18:09:41,608 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:41,608 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:41,609 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2025-02-05 18:09:41,609 INFO  L396      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:41,609 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:41,609 INFO  L85        PathProgramCache]: Analyzing trace with hash 117442573, now seen corresponding path program 1 times
[2025-02-05 18:09:41,609 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:41,609 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516808798]
[2025-02-05 18:09:41,610 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:41,610 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:41,695 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 620 statements into 1 equivalence classes.
[2025-02-05 18:09:41,797 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 620 of 620 statements.
[2025-02-05 18:09:41,797 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:41,798 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:42,238 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:42,238 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:42,238 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516808798]
[2025-02-05 18:09:42,238 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516808798] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:42,238 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:42,238 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:42,238 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305648545]
[2025-02-05 18:09:42,238 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:42,239 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:42,239 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:42,239 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:42,240 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:42,240 INFO  L87              Difference]: Start difference. First operand 1928 states and 2864 transitions. Second operand  has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:42,967 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:42,967 INFO  L93              Difference]: Finished difference Result 3546 states and 5264 transitions.
[2025-02-05 18:09:42,969 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:42,969 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 620
[2025-02-05 18:09:42,970 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:42,976 INFO  L225             Difference]: With dead ends: 3546
[2025-02-05 18:09:42,976 INFO  L226             Difference]: Without dead ends: 1928
[2025-02-05 18:09:42,977 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:09:42,982 INFO  L435           NwaCegarLoop]: 2251 mSDtfsCounter, 5403 mSDsluCounter, 2253 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5410 SdHoareTripleChecker+Valid, 4504 SdHoareTripleChecker+Invalid, 1223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:42,982 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5410 Valid, 4504 Invalid, 1223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 18:09:42,984 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1928 states.
[2025-02-05 18:09:43,008 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928.
[2025-02-05 18:09:43,013 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1928 states, 1919 states have (on average 1.4846274101094319) internal successors, (2849), 1919 states have internal predecessors, (2849), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:43,018 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2863 transitions.
[2025-02-05 18:09:43,022 INFO  L78                 Accepts]: Start accepts. Automaton has 1928 states and 2863 transitions. Word has length 620
[2025-02-05 18:09:43,022 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:43,022 INFO  L471      AbstractCegarLoop]: Abstraction has 1928 states and 2863 transitions.
[2025-02-05 18:09:43,022 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:43,022 INFO  L276                IsEmpty]: Start isEmpty. Operand 1928 states and 2863 transitions.
[2025-02-05 18:09:43,025 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 622
[2025-02-05 18:09:43,025 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:43,025 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:43,025 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2025-02-05 18:09:43,025 INFO  L396      AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:43,025 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:43,029 INFO  L85        PathProgramCache]: Analyzing trace with hash -966534581, now seen corresponding path program 1 times
[2025-02-05 18:09:43,029 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:43,029 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596411763]
[2025-02-05 18:09:43,030 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:43,030 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:43,188 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 621 statements into 1 equivalence classes.
[2025-02-05 18:09:43,345 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 621 of 621 statements.
[2025-02-05 18:09:43,346 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:43,346 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:43,948 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:43,948 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:43,948 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596411763]
[2025-02-05 18:09:43,948 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596411763] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:43,948 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:43,949 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:43,949 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779615568]
[2025-02-05 18:09:43,949 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:43,949 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:43,949 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:43,950 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:43,950 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:43,950 INFO  L87              Difference]: Start difference. First operand 1928 states and 2863 transitions. Second operand  has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:44,744 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:44,744 INFO  L93              Difference]: Finished difference Result 3546 states and 5262 transitions.
[2025-02-05 18:09:44,744 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:44,745 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 621
[2025-02-05 18:09:44,745 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:44,752 INFO  L225             Difference]: With dead ends: 3546
[2025-02-05 18:09:44,755 INFO  L226             Difference]: Without dead ends: 1928
[2025-02-05 18:09:44,757 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:09:44,758 INFO  L435           NwaCegarLoop]: 2251 mSDtfsCounter, 5395 mSDsluCounter, 2253 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5402 SdHoareTripleChecker+Valid, 4504 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:44,758 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5402 Valid, 4504 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 18:09:44,759 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1928 states.
[2025-02-05 18:09:44,788 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928.
[2025-02-05 18:09:44,789 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1928 states, 1919 states have (on average 1.4841063053673789) internal successors, (2848), 1919 states have internal predecessors, (2848), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:44,794 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2862 transitions.
[2025-02-05 18:09:44,794 INFO  L78                 Accepts]: Start accepts. Automaton has 1928 states and 2862 transitions. Word has length 621
[2025-02-05 18:09:44,795 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:44,795 INFO  L471      AbstractCegarLoop]: Abstraction has 1928 states and 2862 transitions.
[2025-02-05 18:09:44,795 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:44,795 INFO  L276                IsEmpty]: Start isEmpty. Operand 1928 states and 2862 transitions.
[2025-02-05 18:09:44,801 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 623
[2025-02-05 18:09:44,801 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:44,802 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:44,802 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2025-02-05 18:09:44,802 INFO  L396      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:44,802 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:44,806 INFO  L85        PathProgramCache]: Analyzing trace with hash 738462632, now seen corresponding path program 1 times
[2025-02-05 18:09:44,807 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:44,807 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732852794]
[2025-02-05 18:09:44,807 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:44,807 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:44,968 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes.
[2025-02-05 18:09:45,205 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements.
[2025-02-05 18:09:45,206 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:45,206 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:45,687 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:45,687 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:45,687 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732852794]
[2025-02-05 18:09:45,687 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732852794] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:45,688 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:45,688 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:45,688 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941189538]
[2025-02-05 18:09:45,688 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:45,689 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:45,689 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:45,689 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:45,690 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:45,690 INFO  L87              Difference]: Start difference. First operand 1928 states and 2862 transitions. Second operand  has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:46,445 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:46,445 INFO  L93              Difference]: Finished difference Result 3546 states and 5260 transitions.
[2025-02-05 18:09:46,449 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:46,450 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 622
[2025-02-05 18:09:46,450 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:46,457 INFO  L225             Difference]: With dead ends: 3546
[2025-02-05 18:09:46,457 INFO  L226             Difference]: Without dead ends: 1928
[2025-02-05 18:09:46,459 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:09:46,463 INFO  L435           NwaCegarLoop]: 2251 mSDtfsCounter, 5387 mSDsluCounter, 2253 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5394 SdHoareTripleChecker+Valid, 4504 SdHoareTripleChecker+Invalid, 1219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:46,464 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5394 Valid, 4504 Invalid, 1219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 18:09:46,465 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1928 states.
[2025-02-05 18:09:46,495 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928.
[2025-02-05 18:09:46,496 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1928 states, 1919 states have (on average 1.4835852006253256) internal successors, (2847), 1919 states have internal predecessors, (2847), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:46,502 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2861 transitions.
[2025-02-05 18:09:46,503 INFO  L78                 Accepts]: Start accepts. Automaton has 1928 states and 2861 transitions. Word has length 622
[2025-02-05 18:09:46,503 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:46,503 INFO  L471      AbstractCegarLoop]: Abstraction has 1928 states and 2861 transitions.
[2025-02-05 18:09:46,503 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:46,503 INFO  L276                IsEmpty]: Start isEmpty. Operand 1928 states and 2861 transitions.
[2025-02-05 18:09:46,509 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 624
[2025-02-05 18:09:46,509 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:46,509 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:46,510 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2025-02-05 18:09:46,510 INFO  L396      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:46,510 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:46,513 INFO  L85        PathProgramCache]: Analyzing trace with hash -94962554, now seen corresponding path program 1 times
[2025-02-05 18:09:46,514 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:46,514 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184908776]
[2025-02-05 18:09:46,514 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:46,514 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:46,770 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 623 statements into 1 equivalence classes.
[2025-02-05 18:09:46,991 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 623 of 623 statements.
[2025-02-05 18:09:46,991 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:46,991 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:47,364 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:47,364 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:47,364 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184908776]
[2025-02-05 18:09:47,364 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184908776] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:47,365 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:47,365 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:47,365 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541476853]
[2025-02-05 18:09:47,365 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:47,365 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:47,365 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:47,366 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:47,366 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:47,367 INFO  L87              Difference]: Start difference. First operand 1928 states and 2861 transitions. Second operand  has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:47,959 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:47,960 INFO  L93              Difference]: Finished difference Result 3546 states and 5258 transitions.
[2025-02-05 18:09:47,960 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:47,960 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 623
[2025-02-05 18:09:47,961 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:47,962 INFO  L225             Difference]: With dead ends: 3546
[2025-02-05 18:09:47,962 INFO  L226             Difference]: Without dead ends: 1928
[2025-02-05 18:09:47,963 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:09:47,964 INFO  L435           NwaCegarLoop]: 2251 mSDtfsCounter, 5379 mSDsluCounter, 2253 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5386 SdHoareTripleChecker+Valid, 4504 SdHoareTripleChecker+Invalid, 1217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:47,966 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5386 Valid, 4504 Invalid, 1217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 18:09:47,968 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1928 states.
[2025-02-05 18:09:47,980 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928.
[2025-02-05 18:09:47,981 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1928 states, 1919 states have (on average 1.4830640958832726) internal successors, (2846), 1919 states have internal predecessors, (2846), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:47,983 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2860 transitions.
[2025-02-05 18:09:47,983 INFO  L78                 Accepts]: Start accepts. Automaton has 1928 states and 2860 transitions. Word has length 623
[2025-02-05 18:09:47,985 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:47,985 INFO  L471      AbstractCegarLoop]: Abstraction has 1928 states and 2860 transitions.
[2025-02-05 18:09:47,985 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:47,985 INFO  L276                IsEmpty]: Start isEmpty. Operand 1928 states and 2860 transitions.
[2025-02-05 18:09:47,988 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 625
[2025-02-05 18:09:47,988 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:47,989 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:47,989 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2025-02-05 18:09:47,989 INFO  L396      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:47,990 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:47,990 INFO  L85        PathProgramCache]: Analyzing trace with hash 247597251, now seen corresponding path program 1 times
[2025-02-05 18:09:47,990 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:47,990 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399491089]
[2025-02-05 18:09:47,990 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:47,990 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:48,090 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 624 statements into 1 equivalence classes.
[2025-02-05 18:09:48,225 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 624 of 624 statements.
[2025-02-05 18:09:48,225 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:48,225 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:48,688 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:48,688 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:48,688 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399491089]
[2025-02-05 18:09:48,688 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399491089] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:48,689 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:48,690 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:48,690 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375924476]
[2025-02-05 18:09:48,690 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:48,690 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:48,693 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:48,694 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:48,694 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:48,694 INFO  L87              Difference]: Start difference. First operand 1928 states and 2860 transitions. Second operand  has 5 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:49,435 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:49,435 INFO  L93              Difference]: Finished difference Result 3546 states and 5256 transitions.
[2025-02-05 18:09:49,435 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:49,436 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 624
[2025-02-05 18:09:49,436 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:49,438 INFO  L225             Difference]: With dead ends: 3546
[2025-02-05 18:09:49,438 INFO  L226             Difference]: Without dead ends: 1928
[2025-02-05 18:09:49,439 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:09:49,439 INFO  L435           NwaCegarLoop]: 2251 mSDtfsCounter, 2666 mSDsluCounter, 2264 mSDsCounter, 0 mSdLazyCounter, 1214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2673 SdHoareTripleChecker+Valid, 4515 SdHoareTripleChecker+Invalid, 1215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:49,439 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2673 Valid, 4515 Invalid, 1215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1214 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 18:09:49,444 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1928 states.
[2025-02-05 18:09:49,467 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928.
[2025-02-05 18:09:49,469 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1928 states, 1919 states have (on average 1.4825429911412193) internal successors, (2845), 1919 states have internal predecessors, (2845), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:49,474 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2859 transitions.
[2025-02-05 18:09:49,474 INFO  L78                 Accepts]: Start accepts. Automaton has 1928 states and 2859 transitions. Word has length 624
[2025-02-05 18:09:49,475 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:49,475 INFO  L471      AbstractCegarLoop]: Abstraction has 1928 states and 2859 transitions.
[2025-02-05 18:09:49,475 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 118.4) internal successors, (592), 5 states have internal predecessors, (592), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:49,475 INFO  L276                IsEmpty]: Start isEmpty. Operand 1928 states and 2859 transitions.
[2025-02-05 18:09:49,480 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 626
[2025-02-05 18:09:49,481 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:49,481 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:49,481 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2025-02-05 18:09:49,481 INFO  L396      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:49,486 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:49,487 INFO  L85        PathProgramCache]: Analyzing trace with hash -2007541146, now seen corresponding path program 1 times
[2025-02-05 18:09:49,487 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:49,487 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930726113]
[2025-02-05 18:09:49,487 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:49,487 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:49,776 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 625 statements into 1 equivalence classes.
[2025-02-05 18:09:49,907 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 625 of 625 statements.
[2025-02-05 18:09:49,907 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:49,907 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:50,379 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:50,380 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:50,380 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930726113]
[2025-02-05 18:09:50,380 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930726113] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:50,380 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:50,380 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:50,380 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689228583]
[2025-02-05 18:09:50,383 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:50,384 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:50,384 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:50,385 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:50,385 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:50,385 INFO  L87              Difference]: Start difference. First operand 1928 states and 2859 transitions. Second operand  has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:51,013 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:51,013 INFO  L93              Difference]: Finished difference Result 3546 states and 5254 transitions.
[2025-02-05 18:09:51,013 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:51,014 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 625
[2025-02-05 18:09:51,014 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:51,015 INFO  L225             Difference]: With dead ends: 3546
[2025-02-05 18:09:51,015 INFO  L226             Difference]: Without dead ends: 1928
[2025-02-05 18:09:51,017 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:09:51,017 INFO  L435           NwaCegarLoop]: 2251 mSDtfsCounter, 5065 mSDsluCounter, 2253 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5072 SdHoareTripleChecker+Valid, 4504 SdHoareTripleChecker+Invalid, 1213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:51,018 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5072 Valid, 4504 Invalid, 1213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 18:09:51,023 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1928 states.
[2025-02-05 18:09:51,037 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928.
[2025-02-05 18:09:51,038 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1928 states, 1919 states have (on average 1.4820218863991663) internal successors, (2844), 1919 states have internal predecessors, (2844), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:51,039 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2858 transitions.
[2025-02-05 18:09:51,040 INFO  L78                 Accepts]: Start accepts. Automaton has 1928 states and 2858 transitions. Word has length 625
[2025-02-05 18:09:51,040 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:51,040 INFO  L471      AbstractCegarLoop]: Abstraction has 1928 states and 2858 transitions.
[2025-02-05 18:09:51,040 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:51,040 INFO  L276                IsEmpty]: Start isEmpty. Operand 1928 states and 2858 transitions.
[2025-02-05 18:09:51,043 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 627
[2025-02-05 18:09:51,043 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:51,046 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:51,046 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2025-02-05 18:09:51,046 INFO  L396      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:51,047 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:51,047 INFO  L85        PathProgramCache]: Analyzing trace with hash 570676072, now seen corresponding path program 1 times
[2025-02-05 18:09:51,047 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:51,047 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457504386]
[2025-02-05 18:09:51,047 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:51,047 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:51,129 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 626 statements into 1 equivalence classes.
[2025-02-05 18:09:51,232 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 626 of 626 statements.
[2025-02-05 18:09:51,232 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:51,233 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:51,727 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:51,728 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:51,728 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457504386]
[2025-02-05 18:09:51,728 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457504386] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:51,728 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:51,728 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:51,728 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367542768]
[2025-02-05 18:09:51,728 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:51,728 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:51,729 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:51,729 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:51,729 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:51,730 INFO  L87              Difference]: Start difference. First operand 1928 states and 2858 transitions. Second operand  has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:52,413 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:52,414 INFO  L93              Difference]: Finished difference Result 3546 states and 5252 transitions.
[2025-02-05 18:09:52,414 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:52,414 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 626
[2025-02-05 18:09:52,415 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:52,416 INFO  L225             Difference]: With dead ends: 3546
[2025-02-05 18:09:52,416 INFO  L226             Difference]: Without dead ends: 1928
[2025-02-05 18:09:52,418 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:09:52,418 INFO  L435           NwaCegarLoop]: 2251 mSDtfsCounter, 5057 mSDsluCounter, 2253 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5064 SdHoareTripleChecker+Valid, 4504 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:52,419 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5064 Valid, 4504 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 18:09:52,424 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1928 states.
[2025-02-05 18:09:52,436 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928.
[2025-02-05 18:09:52,437 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1928 states, 1919 states have (on average 1.481500781657113) internal successors, (2843), 1919 states have internal predecessors, (2843), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:52,439 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2857 transitions.
[2025-02-05 18:09:52,439 INFO  L78                 Accepts]: Start accepts. Automaton has 1928 states and 2857 transitions. Word has length 626
[2025-02-05 18:09:52,440 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:52,440 INFO  L471      AbstractCegarLoop]: Abstraction has 1928 states and 2857 transitions.
[2025-02-05 18:09:52,440 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:52,440 INFO  L276                IsEmpty]: Start isEmpty. Operand 1928 states and 2857 transitions.
[2025-02-05 18:09:52,442 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 628
[2025-02-05 18:09:52,442 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:52,443 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:52,443 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2025-02-05 18:09:52,443 INFO  L396      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:52,443 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:52,443 INFO  L85        PathProgramCache]: Analyzing trace with hash -41361877, now seen corresponding path program 1 times
[2025-02-05 18:09:52,444 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:52,444 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741189706]
[2025-02-05 18:09:52,444 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:52,444 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:52,528 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 627 statements into 1 equivalence classes.
[2025-02-05 18:09:52,635 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 627 of 627 statements.
[2025-02-05 18:09:52,635 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:52,635 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:53,102 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:53,102 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:53,102 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741189706]
[2025-02-05 18:09:53,102 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741189706] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:53,102 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:53,102 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:53,102 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331837693]
[2025-02-05 18:09:53,102 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:53,103 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:53,104 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:53,105 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:53,105 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:53,105 INFO  L87              Difference]: Start difference. First operand 1928 states and 2857 transitions. Second operand  has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:53,769 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:53,769 INFO  L93              Difference]: Finished difference Result 3546 states and 5250 transitions.
[2025-02-05 18:09:53,770 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:53,770 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 627
[2025-02-05 18:09:53,770 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:53,772 INFO  L225             Difference]: With dead ends: 3546
[2025-02-05 18:09:53,772 INFO  L226             Difference]: Without dead ends: 1928
[2025-02-05 18:09:53,773 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:09:53,773 INFO  L435           NwaCegarLoop]: 2251 mSDtfsCounter, 5043 mSDsluCounter, 2253 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5050 SdHoareTripleChecker+Valid, 4504 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:53,774 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5050 Valid, 4504 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 18:09:53,775 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1928 states.
[2025-02-05 18:09:53,784 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928.
[2025-02-05 18:09:53,785 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1928 states, 1919 states have (on average 1.4809796769150598) internal successors, (2842), 1919 states have internal predecessors, (2842), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:53,786 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2856 transitions.
[2025-02-05 18:09:53,787 INFO  L78                 Accepts]: Start accepts. Automaton has 1928 states and 2856 transitions. Word has length 627
[2025-02-05 18:09:53,787 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:53,787 INFO  L471      AbstractCegarLoop]: Abstraction has 1928 states and 2856 transitions.
[2025-02-05 18:09:53,787 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:53,787 INFO  L276                IsEmpty]: Start isEmpty. Operand 1928 states and 2856 transitions.
[2025-02-05 18:09:53,790 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 629
[2025-02-05 18:09:53,790 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:53,793 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:53,794 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2025-02-05 18:09:53,794 INFO  L396      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:53,794 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:53,794 INFO  L85        PathProgramCache]: Analyzing trace with hash -2143720984, now seen corresponding path program 1 times
[2025-02-05 18:09:53,794 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:53,794 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758389767]
[2025-02-05 18:09:53,794 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:53,794 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:53,878 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 628 statements into 1 equivalence classes.
[2025-02-05 18:09:54,075 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 628 of 628 statements.
[2025-02-05 18:09:54,076 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:54,076 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:54,680 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:54,681 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:54,681 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758389767]
[2025-02-05 18:09:54,681 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758389767] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:54,681 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:54,681 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:54,681 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274631478]
[2025-02-05 18:09:54,681 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:54,682 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:54,682 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:54,682 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:54,682 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:54,683 INFO  L87              Difference]: Start difference. First operand 1928 states and 2856 transitions. Second operand  has 5 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:55,273 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:55,274 INFO  L93              Difference]: Finished difference Result 3546 states and 5248 transitions.
[2025-02-05 18:09:55,274 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:55,274 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 628
[2025-02-05 18:09:55,275 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:55,276 INFO  L225             Difference]: With dead ends: 3546
[2025-02-05 18:09:55,276 INFO  L226             Difference]: Without dead ends: 1928
[2025-02-05 18:09:55,277 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:09:55,278 INFO  L435           NwaCegarLoop]: 2251 mSDtfsCounter, 2647 mSDsluCounter, 2264 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2654 SdHoareTripleChecker+Valid, 4515 SdHoareTripleChecker+Invalid, 1207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:55,278 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2654 Valid, 4515 Invalid, 1207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 18:09:55,279 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1928 states.
[2025-02-05 18:09:55,289 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928.
[2025-02-05 18:09:55,290 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1928 states, 1919 states have (on average 1.4804585721730068) internal successors, (2841), 1919 states have internal predecessors, (2841), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:55,292 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2855 transitions.
[2025-02-05 18:09:55,292 INFO  L78                 Accepts]: Start accepts. Automaton has 1928 states and 2855 transitions. Word has length 628
[2025-02-05 18:09:55,292 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:55,292 INFO  L471      AbstractCegarLoop]: Abstraction has 1928 states and 2855 transitions.
[2025-02-05 18:09:55,293 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:55,293 INFO  L276                IsEmpty]: Start isEmpty. Operand 1928 states and 2855 transitions.
[2025-02-05 18:09:55,295 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 630
[2025-02-05 18:09:55,295 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:55,295 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:55,295 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2025-02-05 18:09:55,296 INFO  L396      AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:55,296 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:55,296 INFO  L85        PathProgramCache]: Analyzing trace with hash -924537370, now seen corresponding path program 1 times
[2025-02-05 18:09:55,296 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:55,296 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608225067]
[2025-02-05 18:09:55,296 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:55,296 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:55,372 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 629 statements into 1 equivalence classes.
[2025-02-05 18:09:55,480 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 629 of 629 statements.
[2025-02-05 18:09:55,480 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:55,481 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:55,902 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:55,902 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:55,902 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608225067]
[2025-02-05 18:09:55,902 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608225067] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:55,902 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:55,902 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:55,902 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421393541]
[2025-02-05 18:09:55,902 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:55,903 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:55,903 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:55,904 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:55,904 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:55,904 INFO  L87              Difference]: Start difference. First operand 1928 states and 2855 transitions. Second operand  has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:56,628 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:56,629 INFO  L93              Difference]: Finished difference Result 3546 states and 5246 transitions.
[2025-02-05 18:09:56,629 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:56,629 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 629
[2025-02-05 18:09:56,630 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:56,635 INFO  L225             Difference]: With dead ends: 3546
[2025-02-05 18:09:56,635 INFO  L226             Difference]: Without dead ends: 1928
[2025-02-05 18:09:56,636 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:09:56,637 INFO  L435           NwaCegarLoop]: 2251 mSDtfsCounter, 2643 mSDsluCounter, 2264 mSDsCounter, 0 mSdLazyCounter, 1204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2650 SdHoareTripleChecker+Valid, 4515 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:56,637 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2650 Valid, 4515 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1204 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 18:09:56,641 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1928 states.
[2025-02-05 18:09:56,655 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928.
[2025-02-05 18:09:56,657 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1928 states, 1919 states have (on average 1.4799374674309536) internal successors, (2840), 1919 states have internal predecessors, (2840), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:56,659 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2854 transitions.
[2025-02-05 18:09:56,659 INFO  L78                 Accepts]: Start accepts. Automaton has 1928 states and 2854 transitions. Word has length 629
[2025-02-05 18:09:56,660 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:56,660 INFO  L471      AbstractCegarLoop]: Abstraction has 1928 states and 2854 transitions.
[2025-02-05 18:09:56,660 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:56,660 INFO  L276                IsEmpty]: Start isEmpty. Operand 1928 states and 2854 transitions.
[2025-02-05 18:09:56,663 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 631
[2025-02-05 18:09:56,663 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:56,663 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:56,663 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2025-02-05 18:09:56,663 INFO  L396      AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:56,664 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:56,664 INFO  L85        PathProgramCache]: Analyzing trace with hash -1773564797, now seen corresponding path program 1 times
[2025-02-05 18:09:56,664 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:56,664 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076341363]
[2025-02-05 18:09:56,664 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:56,664 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:56,749 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 630 statements into 1 equivalence classes.
[2025-02-05 18:09:56,869 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 630 of 630 statements.
[2025-02-05 18:09:56,870 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:56,870 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:57,328 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:57,329 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:57,329 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076341363]
[2025-02-05 18:09:57,329 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076341363] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:57,329 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:57,329 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:57,329 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254208718]
[2025-02-05 18:09:57,329 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:57,329 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:57,330 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:57,330 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:57,330 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:57,330 INFO  L87              Difference]: Start difference. First operand 1928 states and 2854 transitions. Second operand  has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:57,927 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:09:57,927 INFO  L93              Difference]: Finished difference Result 3546 states and 5244 transitions.
[2025-02-05 18:09:57,927 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:09:57,927 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 630
[2025-02-05 18:09:57,928 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:09:57,929 INFO  L225             Difference]: With dead ends: 3546
[2025-02-05 18:09:57,929 INFO  L226             Difference]: Without dead ends: 1928
[2025-02-05 18:09:57,931 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:09:57,931 INFO  L435           NwaCegarLoop]: 2251 mSDtfsCounter, 2639 mSDsluCounter, 2264 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2646 SdHoareTripleChecker+Valid, 4515 SdHoareTripleChecker+Invalid, 1203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time
[2025-02-05 18:09:57,931 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2646 Valid, 4515 Invalid, 1203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1202 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time]
[2025-02-05 18:09:57,932 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1928 states.
[2025-02-05 18:09:57,942 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928.
[2025-02-05 18:09:57,944 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1928 states, 1919 states have (on average 1.4794163626889005) internal successors, (2839), 1919 states have internal predecessors, (2839), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:09:57,945 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2853 transitions.
[2025-02-05 18:09:57,945 INFO  L78                 Accepts]: Start accepts. Automaton has 1928 states and 2853 transitions. Word has length 630
[2025-02-05 18:09:57,946 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:09:57,946 INFO  L471      AbstractCegarLoop]: Abstraction has 1928 states and 2853 transitions.
[2025-02-05 18:09:57,946 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:09:57,946 INFO  L276                IsEmpty]: Start isEmpty. Operand 1928 states and 2853 transitions.
[2025-02-05 18:09:57,948 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 632
[2025-02-05 18:09:57,948 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:09:57,949 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:09:57,949 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2025-02-05 18:09:57,949 INFO  L396      AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:09:57,950 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:09:57,950 INFO  L85        PathProgramCache]: Analyzing trace with hash 702095137, now seen corresponding path program 1 times
[2025-02-05 18:09:57,950 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:09:57,950 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471455438]
[2025-02-05 18:09:57,950 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:09:57,950 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:09:58,042 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes.
[2025-02-05 18:09:58,799 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements.
[2025-02-05 18:09:58,799 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:09:58,800 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:09:59,373 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:09:59,374 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:09:59,374 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471455438]
[2025-02-05 18:09:59,374 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471455438] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:09:59,374 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:09:59,374 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:09:59,374 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772480954]
[2025-02-05 18:09:59,374 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:09:59,374 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:09:59,375 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:09:59,375 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:09:59,375 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:09:59,375 INFO  L87              Difference]: Start difference. First operand 1928 states and 2853 transitions. Second operand  has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:10:00,351 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:10:00,351 INFO  L93              Difference]: Finished difference Result 3546 states and 5242 transitions.
[2025-02-05 18:10:00,351 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:10:00,351 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 631
[2025-02-05 18:10:00,352 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:10:00,354 INFO  L225             Difference]: With dead ends: 3546
[2025-02-05 18:10:00,354 INFO  L226             Difference]: Without dead ends: 1928
[2025-02-05 18:10:00,356 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:10:00,357 INFO  L435           NwaCegarLoop]: 2251 mSDtfsCounter, 2575 mSDsluCounter, 4495 mSDsCounter, 0 mSdLazyCounter, 1803 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2575 SdHoareTripleChecker+Valid, 6746 SdHoareTripleChecker+Invalid, 1803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time
[2025-02-05 18:10:00,357 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2575 Valid, 6746 Invalid, 1803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1803 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time]
[2025-02-05 18:10:00,358 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1928 states.
[2025-02-05 18:10:00,376 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928.
[2025-02-05 18:10:00,381 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1928 states, 1919 states have (on average 1.4788952579468473) internal successors, (2838), 1919 states have internal predecessors, (2838), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:10:00,383 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2852 transitions.
[2025-02-05 18:10:00,383 INFO  L78                 Accepts]: Start accepts. Automaton has 1928 states and 2852 transitions. Word has length 631
[2025-02-05 18:10:00,383 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:10:00,383 INFO  L471      AbstractCegarLoop]: Abstraction has 1928 states and 2852 transitions.
[2025-02-05 18:10:00,383 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 119.8) internal successors, (599), 5 states have internal predecessors, (599), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:10:00,384 INFO  L276                IsEmpty]: Start isEmpty. Operand 1928 states and 2852 transitions.
[2025-02-05 18:10:00,390 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 633
[2025-02-05 18:10:00,390 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:10:00,390 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:10:00,391 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2025-02-05 18:10:00,391 INFO  L396      AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:10:00,391 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:10:00,391 INFO  L85        PathProgramCache]: Analyzing trace with hash -1395800615, now seen corresponding path program 1 times
[2025-02-05 18:10:00,391 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:10:00,391 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463323472]
[2025-02-05 18:10:00,391 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:10:00,391 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:10:00,516 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes.
[2025-02-05 18:10:01,314 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements.
[2025-02-05 18:10:01,314 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:10:01,314 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:10:01,889 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:10:01,890 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:10:01,890 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463323472]
[2025-02-05 18:10:01,890 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463323472] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:10:01,890 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:10:01,890 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:10:01,890 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694817356]
[2025-02-05 18:10:01,890 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:10:01,891 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:10:01,891 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:10:01,892 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:10:01,892 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:10:01,892 INFO  L87              Difference]: Start difference. First operand 1928 states and 2852 transitions. Second operand  has 5 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:10:02,758 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:10:02,759 INFO  L93              Difference]: Finished difference Result 3546 states and 5240 transitions.
[2025-02-05 18:10:02,759 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:10:02,759 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 632
[2025-02-05 18:10:02,759 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:10:02,761 INFO  L225             Difference]: With dead ends: 3546
[2025-02-05 18:10:02,761 INFO  L226             Difference]: Without dead ends: 1928
[2025-02-05 18:10:02,763 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:10:02,764 INFO  L435           NwaCegarLoop]: 2251 mSDtfsCounter, 5140 mSDsluCounter, 2253 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5140 SdHoareTripleChecker+Valid, 4504 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 18:10:02,765 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5140 Valid, 4504 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 18:10:02,766 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1928 states.
[2025-02-05 18:10:02,780 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928.
[2025-02-05 18:10:02,781 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1928 states, 1919 states have (on average 1.4783741532047943) internal successors, (2837), 1919 states have internal predecessors, (2837), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:10:02,783 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2851 transitions.
[2025-02-05 18:10:02,783 INFO  L78                 Accepts]: Start accepts. Automaton has 1928 states and 2851 transitions. Word has length 632
[2025-02-05 18:10:02,783 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:10:02,784 INFO  L471      AbstractCegarLoop]: Abstraction has 1928 states and 2851 transitions.
[2025-02-05 18:10:02,784 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:10:02,784 INFO  L276                IsEmpty]: Start isEmpty. Operand 1928 states and 2851 transitions.
[2025-02-05 18:10:02,787 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 634
[2025-02-05 18:10:02,787 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:10:02,787 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:10:02,787 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2025-02-05 18:10:02,787 INFO  L396      AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:10:02,788 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:10:02,788 INFO  L85        PathProgramCache]: Analyzing trace with hash -644979028, now seen corresponding path program 1 times
[2025-02-05 18:10:02,788 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:10:02,788 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116129706]
[2025-02-05 18:10:02,788 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:10:02,788 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:10:02,932 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 633 statements into 1 equivalence classes.
[2025-02-05 18:10:03,357 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 633 of 633 statements.
[2025-02-05 18:10:03,357 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:10:03,357 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:10:03,994 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:10:03,994 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:10:03,994 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116129706]
[2025-02-05 18:10:03,994 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116129706] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:10:03,994 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:10:03,994 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 18:10:03,994 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125262924]
[2025-02-05 18:10:03,994 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:10:03,995 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 18:10:03,995 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:10:03,995 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 18:10:03,995 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2025-02-05 18:10:03,996 INFO  L87              Difference]: Start difference. First operand 1928 states and 2851 transitions. Second operand  has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)
[2025-02-05 18:10:04,866 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:10:04,866 INFO  L93              Difference]: Finished difference Result 3646 states and 5387 transitions.
[2025-02-05 18:10:04,867 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:10:04,868 INFO  L78                 Accepts]: Start accepts. Automaton has  has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 633
[2025-02-05 18:10:04,868 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:10:04,870 INFO  L225             Difference]: With dead ends: 3646
[2025-02-05 18:10:04,870 INFO  L226             Difference]: Without dead ends: 1928
[2025-02-05 18:10:04,871 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-05 18:10:04,872 INFO  L435           NwaCegarLoop]: 2422 mSDtfsCounter, 70 mSDsluCounter, 4363 mSDsCounter, 0 mSdLazyCounter, 1898 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 6785 SdHoareTripleChecker+Invalid, 1908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time
[2025-02-05 18:10:04,872 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 6785 Invalid, 1908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1898 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time]
[2025-02-05 18:10:04,874 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1928 states.
[2025-02-05 18:10:04,884 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928.
[2025-02-05 18:10:04,885 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1928 states, 1919 states have (on average 1.477853048462741) internal successors, (2836), 1919 states have internal predecessors, (2836), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:10:04,888 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2850 transitions.
[2025-02-05 18:10:04,889 INFO  L78                 Accepts]: Start accepts. Automaton has 1928 states and 2850 transitions. Word has length 633
[2025-02-05 18:10:04,890 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:10:04,890 INFO  L471      AbstractCegarLoop]: Abstraction has 1928 states and 2850 transitions.
[2025-02-05 18:10:04,893 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)
[2025-02-05 18:10:04,894 INFO  L276                IsEmpty]: Start isEmpty. Operand 1928 states and 2850 transitions.
[2025-02-05 18:10:04,896 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 635
[2025-02-05 18:10:04,896 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:10:04,897 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:10:04,897 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2025-02-05 18:10:04,897 INFO  L396      AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:10:04,897 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:10:04,897 INFO  L85        PathProgramCache]: Analyzing trace with hash -1752098241, now seen corresponding path program 1 times
[2025-02-05 18:10:04,898 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:10:04,898 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310137534]
[2025-02-05 18:10:04,898 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:10:04,898 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:10:05,004 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 634 statements into 1 equivalence classes.
[2025-02-05 18:10:05,917 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 634 of 634 statements.
[2025-02-05 18:10:05,918 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:10:05,918 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:10:06,514 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:10:06,514 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:10:06,515 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310137534]
[2025-02-05 18:10:06,515 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310137534] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:10:06,515 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:10:06,515 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:10:06,515 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136386683]
[2025-02-05 18:10:06,515 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:10:06,515 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:10:06,516 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:10:06,516 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:10:06,516 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:10:06,516 INFO  L87              Difference]: Start difference. First operand 1928 states and 2850 transitions. Second operand  has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:10:07,310 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:10:07,310 INFO  L93              Difference]: Finished difference Result 3546 states and 5236 transitions.
[2025-02-05 18:10:07,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2025-02-05 18:10:07,310 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 634
[2025-02-05 18:10:07,311 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:10:07,313 INFO  L225             Difference]: With dead ends: 3546
[2025-02-05 18:10:07,313 INFO  L226             Difference]: Without dead ends: 1928
[2025-02-05 18:10:07,315 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30
[2025-02-05 18:10:07,316 INFO  L435           NwaCegarLoop]: 2250 mSDtfsCounter, 5130 mSDsluCounter, 2252 mSDsCounter, 0 mSdLazyCounter, 1196 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5130 SdHoareTripleChecker+Valid, 4502 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time
[2025-02-05 18:10:07,316 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [5130 Valid, 4502 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1196 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time]
[2025-02-05 18:10:07,318 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1928 states.
[2025-02-05 18:10:07,333 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1928.
[2025-02-05 18:10:07,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1928 states, 1919 states have (on average 1.4773319437206878) internal successors, (2835), 1919 states have internal predecessors, (2835), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:10:07,336 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2849 transitions.
[2025-02-05 18:10:07,337 INFO  L78                 Accepts]: Start accepts. Automaton has 1928 states and 2849 transitions. Word has length 634
[2025-02-05 18:10:07,337 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:10:07,338 INFO  L471      AbstractCegarLoop]: Abstraction has 1928 states and 2849 transitions.
[2025-02-05 18:10:07,338 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2025-02-05 18:10:07,338 INFO  L276                IsEmpty]: Start isEmpty. Operand 1928 states and 2849 transitions.
[2025-02-05 18:10:07,341 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 636
[2025-02-05 18:10:07,342 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:10:07,342 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:10:07,342 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2025-02-05 18:10:07,342 INFO  L396      AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:10:07,347 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:10:07,347 INFO  L85        PathProgramCache]: Analyzing trace with hash 778263459, now seen corresponding path program 1 times
[2025-02-05 18:10:07,347 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:10:07,347 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774134496]
[2025-02-05 18:10:07,347 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:10:07,347 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:10:07,540 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 635 statements into 1 equivalence classes.
[2025-02-05 18:10:08,126 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 635 of 635 statements.
[2025-02-05 18:10:08,126 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:10:08,126 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:10:09,144 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:10:09,144 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:10:09,144 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774134496]
[2025-02-05 18:10:09,145 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774134496] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:10:09,145 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:10:09,145 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:10:09,145 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667766780]
[2025-02-05 18:10:09,145 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:10:09,145 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:10:09,145 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:10:09,146 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:10:09,146 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:10:09,146 INFO  L87              Difference]: Start difference. First operand 1928 states and 2849 transitions. Second operand  has 5 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)
[2025-02-05 18:10:10,457 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:10:10,457 INFO  L93              Difference]: Finished difference Result 3550 states and 5240 transitions.
[2025-02-05 18:10:10,457 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 18:10:10,457 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 635
[2025-02-05 18:10:10,458 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:10:10,464 INFO  L225             Difference]: With dead ends: 3550
[2025-02-05 18:10:10,464 INFO  L226             Difference]: Without dead ends: 1932
[2025-02-05 18:10:10,465 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:10:10,467 INFO  L435           NwaCegarLoop]: 1941 mSDtfsCounter, 2773 mSDsluCounter, 3861 mSDsCounter, 0 mSdLazyCounter, 2732 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2775 SdHoareTripleChecker+Valid, 5802 SdHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-05 18:10:10,467 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2775 Valid, 5802 Invalid, 2733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2732 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-05 18:10:10,468 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1932 states.
[2025-02-05 18:10:10,482 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1930.
[2025-02-05 18:10:10,483 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1930 states, 1921 states have (on average 1.4768349817803228) internal successors, (2837), 1921 states have internal predecessors, (2837), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:10:10,485 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 2851 transitions.
[2025-02-05 18:10:10,485 INFO  L78                 Accepts]: Start accepts. Automaton has 1930 states and 2851 transitions. Word has length 635
[2025-02-05 18:10:10,485 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:10:10,485 INFO  L471      AbstractCegarLoop]: Abstraction has 1930 states and 2851 transitions.
[2025-02-05 18:10:10,485 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 120.6) internal successors, (603), 5 states have internal predecessors, (603), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)
[2025-02-05 18:10:10,486 INFO  L276                IsEmpty]: Start isEmpty. Operand 1930 states and 2851 transitions.
[2025-02-05 18:10:10,488 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 637
[2025-02-05 18:10:10,488 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:10:10,489 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:10:10,489 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2025-02-05 18:10:10,489 INFO  L396      AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:10:10,489 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:10:10,489 INFO  L85        PathProgramCache]: Analyzing trace with hash 1185096802, now seen corresponding path program 1 times
[2025-02-05 18:10:10,489 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:10:10,489 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970155555]
[2025-02-05 18:10:10,490 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:10:10,490 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:10:10,579 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 636 statements into 1 equivalence classes.
[2025-02-05 18:10:11,115 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 636 of 636 statements.
[2025-02-05 18:10:11,115 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:10:11,115 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:10:12,174 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:10:12,174 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:10:12,174 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970155555]
[2025-02-05 18:10:12,174 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970155555] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:10:12,174 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:10:12,174 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-02-05 18:10:12,174 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955391977]
[2025-02-05 18:10:12,174 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:10:12,175 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2025-02-05 18:10:12,175 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:10:12,176 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2025-02-05 18:10:12,176 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:10:12,176 INFO  L87              Difference]: Start difference. First operand 1930 states and 2851 transitions. Second operand  has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)
[2025-02-05 18:10:13,512 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-02-05 18:10:13,513 INFO  L93              Difference]: Finished difference Result 3554 states and 5244 transitions.
[2025-02-05 18:10:13,513 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2025-02-05 18:10:13,513 INFO  L78                 Accepts]: Start accepts. Automaton has  has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 636
[2025-02-05 18:10:13,514 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2025-02-05 18:10:13,517 INFO  L225             Difference]: With dead ends: 3554
[2025-02-05 18:10:13,517 INFO  L226             Difference]: Without dead ends: 1934
[2025-02-05 18:10:13,518 INFO  L434           NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2025-02-05 18:10:13,518 INFO  L435           NwaCegarLoop]: 1941 mSDtfsCounter, 2594 mSDsluCounter, 3861 mSDsCounter, 0 mSdLazyCounter, 2732 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2596 SdHoareTripleChecker+Valid, 5802 SdHoareTripleChecker+Invalid, 2733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time
[2025-02-05 18:10:13,519 INFO  L436           NwaCegarLoop]: SdHoareTripleChecker [2596 Valid, 5802 Invalid, 2733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2732 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time]
[2025-02-05 18:10:13,520 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1934 states.
[2025-02-05 18:10:13,535 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1932.
[2025-02-05 18:10:13,536 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 1932 states, 1923 states have (on average 1.4763390535621426) internal successors, (2839), 1923 states have internal predecessors, (2839), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7)
[2025-02-05 18:10:13,538 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1932 states to 1932 states and 2853 transitions.
[2025-02-05 18:10:13,538 INFO  L78                 Accepts]: Start accepts. Automaton has 1932 states and 2853 transitions. Word has length 636
[2025-02-05 18:10:13,538 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2025-02-05 18:10:13,539 INFO  L471      AbstractCegarLoop]: Abstraction has 1932 states and 2853 transitions.
[2025-02-05 18:10:13,539 INFO  L472      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)
[2025-02-05 18:10:13,539 INFO  L276                IsEmpty]: Start isEmpty. Operand 1932 states and 2853 transitions.
[2025-02-05 18:10:13,541 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 638
[2025-02-05 18:10:13,541 INFO  L210           NwaCegarLoop]: Found error trace
[2025-02-05 18:10:13,542 INFO  L218           NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-02-05 18:10:13,542 WARN  L453      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2025-02-05 18:10:13,542 INFO  L396      AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2025-02-05 18:10:13,542 INFO  L157       PredicateUnifier]: Initialized classic predicate unifier
[2025-02-05 18:10:13,542 INFO  L85        PathProgramCache]: Analyzing trace with hash 321878653, now seen corresponding path program 1 times
[2025-02-05 18:10:13,543 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-02-05 18:10:13,543 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529299312]
[2025-02-05 18:10:13,543 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-02-05 18:10:13,543 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-02-05 18:10:13,631 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 637 statements into 1 equivalence classes.
[2025-02-05 18:10:14,143 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 637 of 637 statements.
[2025-02-05 18:10:14,144 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-02-05 18:10:14,144 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-02-05 18:10:14,778 INFO  L134       CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked.
[2025-02-05 18:10:14,778 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-02-05 18:10:14,779 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529299312]
[2025-02-05 18:10:14,779 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529299312] provided 1 perfect and 0 imperfect interpolant sequences
[2025-02-05 18:10:14,779 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-02-05 18:10:14,779 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2025-02-05 18:10:14,779 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171931770]
[2025-02-05 18:10:14,779 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-02-05 18:10:14,779 INFO  L548      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2025-02-05 18:10:14,779 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-02-05 18:10:14,780 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2025-02-05 18:10:14,780 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2025-02-05 18:10:14,780 INFO  L87              Difference]: Start difference. First operand 1932 states and 2853 transitions. Second operand  has 4 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)